Description: Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed graph.
To Search:
File list (Check if you may need any files):
图论\KM(近广搜实现的）.pas
....\KM最大价值匹配.cpp
....\km求最佳匹配.cpp
....\一般图最大匹配.cpp
....\弦图判定.cpp
....\有向图最小生成树.cpp
....\求最小上下界网络流_另一种方法.cpp
....\求最小下界网络流_反边.cpp
图论
Download