搜索资源列表
StreamEdmondsKarp.rar
- 最大网络流问题 一个Edmonds-Karp算法,也就是广搜增广路径,用了16MS,A maximum network flow problem Edmonds-Karp algorithm, which is widely found augmented path, with a 16ms
tulun
- 图论的各种算法,包括最短路 最大流等,代码都在里面-A variety of graph theory algorithm code on the inside
Dinic
- 网络最大流 Dinic算法 比Ford-Furkson,Edmond-Karps效率要高, 算法复杂性为O(V^2*E)-Dinic is a high-efficient maximum-flow algorithm proposed by a russian named diniz
network
- 算网络的最大流,通过该算法可以计算一个网络是否达到了最大流,以及时候还存在增广路径-compute the max of a network
dinic
- 一个网络流dinic算法的模板,用来求解一个网络的最大流,速度非常快。-A network flow dinic algorithm template, used to solving a network of maximum flow, at a very fast rate.