搜索资源列表
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.
BipartiteGraphs
- Bipartite Graphs for Graph Teory
assignment_2009_12_01
- This source code solves the assignment problem in Bipartite graphs by implementing the Hungarian Algorithm.
bipmatch
- This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm.
Hungarian
- This source code is one version of Hungarian Algorithm used in bipartite graphs. For more information please refer to source codes.-This source code is one version of Hungarian Algorithm used in bipartite graphs. For more information please refer to
Xong
- A matchings in a graph is a set of edges, no two which share an endpoint. In this section we show how to find maximum matchings in bipartite graphs
hungrian
- 匈牙利算法的源代码，可以解决二分图的最大匹配问题-Hungarian algorithm source code, can solve the maximum matching problem for bipartite graphs
graph-coloring
- 基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classe
C
- KM算法可以计算二分图的最大权匹配，匈牙利算法可以计算最大匹配(KM algorithm can calculate the maximum weight matching of bipartite graphs, Hungary algorithm can calculate the maximum matching.)