搜索资源列表
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举,之后对每个枚举情况,把除去源汇两点的其余所有顶点看成是容量限制为1的点,求网络的最大流,就是此点对的顶点连通度,之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法:将带容量限制的顶点u拆成两个点u 和u*,原顶点u的入边为u 的入边,原顶点u的出边为u*的出边,之后在u 和u*之间连接双向边,边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F
maxflow-v2.2.src.tar
- 最大流最小割算法的经典实现,对于图像处理的初学者很有帮助。内附说明文档。
stream
- 网络流算法 涉及:数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割
dinic的网络最大流算法模板
- dinic的网络最大流算法模板,非常实用,经过自己多次测试通过的!Q,Dinic network maximum flow algorithm templates, very useful, after their own, adopted a series of trial runs! Q
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板,包括二分图匹配,欧拉回路的构造以及网络流中的最大流与最小费用最大流等,可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
zuidaliu
- 用VC++6.0求算法分析设计中的最大流问题。-Using VC++6.0 analysis of algorithms designed to seek the maximum flow problem.
shortestaugmentingpath
- 最大流问题的最短增广路径算法 是算法中的重要部分 -Maximum flow problem of the shortest augmenting path algorithm is an important part of the algorithm
FordFulkerson
- 网络优化:最大流的FordFulkerson标号算法-MaxFlow:FordFulkerson
maxflow
- 实现的是最大流的两种增广路算法,用到队列和BFS寻增广路-To achieve the maximum flow of the two augmenting path algorithm, used in the queue and the BFS search augmenting path
mincostflow
- 实现的是最小费用最大流问题,在残量网络中找s-t最短路,运用bellman-ford算法。-To achieve the minimum cost maximum flow problem, in the residual network, find the shortest st, the use of bellman-ford algorithm.
FF
- ford-fulkerson算法的具体实现。实现了最大流算法。编程语言c-ford-fulkerson algorithm implementation. To achieve the maximum flow algorithm. C++ programming language
Bipartite-graph-matching-template
- 求二分图匹配多种算法,网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
1163
- 最大流算法,差分约束系统, 最大流算法,差分约束系统, 最大流算法,差分约束系统,的代码实现-the algorithm of maxflow askfasfka alskdfja aldfjas askdjfa askdlfjad askdf askfj askdfj askfjaf
fafu1198
- FAFU(福建农林大学)1198小三大作战的题解,用的是最大流EK算法。-FAFU (Fujian Agriculture and Forestry University) 1198 small three operations problem solution, using a maximum flow EK algorithm.
wll
- 网络流算法,自己写的实现最大流问题的好方法,是用邻接表实现的ISAP,网上可是很少的哟-Network flow algorithm, a good way to write your own to achieve the maximum flow problem, is the ISAP adjacency list online but few yo
EK
- 图论---数据结构---算法,网络流中求最大流的经典算法,EK算法。-Graph Theory--- Data Structures--- algorithms, network flow for maximum flow of the classical algorithm, EK algorithms.
Ford_Fulkerson
- 最大流Ford-Fulkerson算法源代码 流量网络中,寻找流量最大的可行流-Ford-Fulkerson maximum flow algorithm source code flow network, looking for the greatest possible flow of traffic
224Edmonds_Karp
- T017_最大流增广路算法224Edmonds_Karp-T017_ maximum flow augmenting path algorithm 224Edmonds_Karp
zuidazuixiaofeiyongliu
- 关于T018_最小费用最大流问题的算法,求出最大流最小费用-About T018_ minimum cost maximum flow problem algorithm, find the maximum flow minimum cost
MaxFlowMinCost
- 最大流,最大流最小费用算法,能够求取网络流图中的最大流,最大流最小费用,包括源代码,测试数据和结果分析。- Maximum flow, minimum cost maximum flow algorithms to strike a network flow diagram maximum flow, maximum flow minimum cost, including source code, test data and results analysis.