搜索资源列表
1149_AC_0MS_304K
- dinic网络最大流算法，POJ测试通过-dinic algorithm,accessed by POJ
DinicAndSAP
- 求最大流的Dinic和SAP算法的实现，各自有递归与非递归版本。在稀疏图上效果比较好。-Dinic for the maximum flow algorithm and the SAP implementation, each of which has recursive and non-recursive version. Effect on the sparse map is better.
Dinic
- Dinic求最大流, Dinic求最大流, Dinic求最大流,Dinic求最大流-Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow
Dinic
- 用才c语言实现了dinic算法，算法效率高-Using only c language to implement dinic algorithm is efficient
dinic
- 网络流 采用dinic算法实现 效率较高-max flow(dinic)
pku_graphic
- pku常见的图论问题经典算法,包含最小奇数环， dinic等 -Pku classical algorithm
dinic
- dinic算法的实现。用来计算最大流最小割问题-Dinic algorithm for solving min-cut or max-flow problems
dinic
- 图论算法中基于分层网络的最短增广链算法，用于解决最大流问题-Graph algorithms in the shortest augmenting chain algorithm based on a hierarchical network for solving the maximum flow problem
main
- Dinic算法。这种算法相比Edmond-Karp算法,更加快速,更加常用。-Dinic algorithm. Compared with the Edmond-Karp algorithm, this algorithm is faster and more common.
Dinic
- 在图论中的网络流部分，使用Dinic算法求解网络中的最大流。(Can achieve maximum flow in graph theory)