搜索资源列表
dinic
- dinic的网络最大流算法模板，非常实用，经过自己多次测试通过的!Q-Dinic network maximum flow algorithm templates, very useful, after their own, adopted a series of trial runs! Q
Dinic
- dinic算法 相当实用，ACM最大流必备-useful dinic algorithm, ACM maximum flow must
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_Max_Flow_Algorithm.ppt.tar
- This file is about Max Flow , especially Dinic s algorithm-This file is about Max Flow , especially Dinic s algorithm....
10092-dinic
- UVA 10092 acm dinic AC
10092-fast
- ACM UVA 10092 - flow dinic fast-ACM UVA 10092- flow dinic fast
Dinic
- 用才c语言实现了dinic算法，算法效率高-Using only c language to implement dinic algorithm is efficient
1149_AC_0MS_304K
- dinic网络最大流算法，POJ测试通过-dinic algorithm,accessed by POJ
dinic
- 网络流 采用dinic算法实现 效率较高-max flow(dinic)
pku_graphic
- pku常见的图论问题经典算法,包含最小奇数环， dinic等 -Pku classical algorithm
Dinic
- 网络最大流 Dinic算法 比Ford-Furkson,Edmond-Karps效率要高， 算法复杂性为O(V^2*E)-Dinic is a high-efficient maximum-flow algorithm proposed by a russian named diniz
DinicFlow
- 提供了DINIC算法的程序，可以帮助了叫dinic算法的过程-Algorithm provides a DINIC program that can help the process of the algorithm called dinic
FastFlow
- Dinic algorithm implementation, Tested on spoj problem FastFlow
dinic
- 一个网络流dinic算法的模板，用来求解一个网络的最大流，速度非常快。-A network flow dinic algorithm template, used to solving a network of maximum flow, at a very fast rate.
a.lin
- Dinic method of maximum flow construction, for O(n^3), using pseudo-maximal flow construction by Malhotra - Kumar - Maheshvari. By Vitold Lipsky ( Combinatorics for programmers , 1988). Written by: Amir Tu
dinic
- dinic算法的实现。用来计算最大流最小割问题-Dinic algorithm for solving min-cut or max-flow problems
dinic
- dinic : an algorithm for the maxflow of the network
dinic
- 图论算法中基于分层网络的最短增广链算法，用于解决最大流问题-Graph algorithms in the shortest augmenting chain algorithm based on a hierarchical network for solving the maximum flow problem
Dinic
- 在图论中的网络流部分，使用Dinic算法求解网络中的最大流。(Can achieve maximum flow in graph theory)