搜索资源列表
random_bipartite
- 生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test-Generation Bipartite Graphs.
判断一个连通无向图是否为二部图
- 判断一个连通无向图是否为二部图 利用两个集合存放两个不相交的子集,Determine whether a connected undirected graph is a bipartite graph
kmMatch.rar
- KM算法，实现二分图的最优匹配。 可实现最大匹配或者最小匹配。,KM algorithm, bipartite graph to achieve the optimal match. Can achieve maximum or minimum match to match.
biMatichHungary
- 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm descr iption completely according to the use of computing to achieve a collection of matlab code. Her
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
fm
- 基于图的二分算法，使用c++编写，执行效率非常高，特别适用于网络划分-Bipartite graph-based algorithm, the use of c++ Preparation, implementation efficiency is very high, especially for network segmentation
Matching_on_Weighted_Bipartite_Graph
- 加权二分图匹配，对于给定权重的二分图求出最大匹配-find the max matching of a given weighted bipartite graph
bipartite_matching.cpp.tar
- This is a small program for bipartite matching-This is a small program for bipartite matching...
11
- 二分图的最大匹配，非常好的资料。这是我辛勤找来的。-Bipartite graph of maximum matching, very good information. This is what I found the hard.
erbutu
- 这一代码应用最经典的二部图算法，稍加改动便可用于其它类似题目，希望有所帮助-The code of the most classic bipartite graph algorithm can be modified for other similar topic, hope that help
MessageBox
- The preparation of Euler circuit algorithm, bipartite graph of the curriculum design, implementation, use of credit to the path to achieve
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
Bipartite-graph-to-determine
- 本压缩文件完整地实现了二分图判定的判定算法，代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
BipartiteGraphs
- Bipartite Graphs for Graph Teory
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
Bipartite-graph-matching-problem)
- 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
bipartite-graph-algorithms
- 本文初步介绍了二分图有关的基本算法，和常用的建模方法-The paper initially describes the bipartite graph algorithms, and modeling
Bipartite-graph
- 使用matlab编程，讨论二分图的最大匹配和最优匹配-Using matlab programming, discussing the maximum bipartite matching and optimal matching
Bipartite-graph-matching
- 自己的笔记，二分图匹配详解，是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
bipartiteLocalModel
- 二分图的局部模型代码，用于解决二分图问题，及其二分图的链路预测问题(Bipartite map of the local model code, used to solve the bipartite graph problem, and its bipartite graph link prediction problem)