搜索资源列表
最小费用最大流1
- 本文用C语言实现了优化算法-最小费用最大流算法,主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory
网络流
- 有关网络流的一个算法:求一个网络中的最大流-the flow of a network algorithm : a network for the maximum flow
有关网络流的一个算法:求一个网络中的最大流
- 有关网络流的一个算法:求一个网络中的最大流-the flow of a network algorithm : a network for the maximum flow
最大流最小割
- 图割算法,最大流最小割,用于图像分割。
max flow/min cut
- max flow/min cut 实现最大流最小割算法的程序
1149_AC_0MS_304K
- dinic网络最大流算法,POJ测试通过-dinic algorithm,accessed by POJ
maxnetworkflow
- 详细阐述了网络中的最大流量的实现方法,并编写了实现算法。-Elaborated in detail on the largest network flow method and the preparation of the algorithm.
network_flow
- 最大流算法,对于给定的有向图,计算出该图上的最大流-Maximum flow algorithm, for a given directed graph is calculated on the graph of maximum flow
xq
- 图论中最短路算法,最小生成树,最大匹配与最佳匹配的算法,旅行商问题,求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Fulkerson labeling algorithm
max_flow
- 介绍最大流算法的ppt,The Ford-Fulkerson Augmenting Path Algorithm,The Capacity Scaling Algorithm,The Goldberg-Tarjan Preflow Push Algorithm,-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, The Capacity Scaling Algorithm,
Maximum_flow
- 用C++实现的3种最大流算法。CS(Capacity-Scaling Algorithm)、SAP(Shortest Augmenting Path Algorithm)、ISAP(Improved Shortest Augmenting Path Algorithm)。-C++ implementation with three kinds of maximum flow algorithms. CS (Capacity-Scaling Algorithm), SAP (Shortest Au
matlabCode
- floyd最短路算法、dijkstra最短路算法、求网络的最小费用最大流-floyd shortest path algorithm, dijkstra shortest path algorithm, find the minimum cost maximum flow networks
graphtheory
- 5个关于图论的算法 包括K短路问题 NLOGN问题 二分图匹配问题 费用流问题 最大流问题-5 on the graph theory algorithms, including K shortest path problem NLOGN problems cost bipartite matching maximum flow flow
Recent_developments_in_maximum_flow_algorithms
- Goldberg关于最大流算法研究进展的文章。-The maximum flow problem is a classical optimization problem with many applications. Algorithms for this problem have been studied for over four decades. Recently, significant improvements have been made in theoretical perform
The-biggest-circulation-in-program
- 最大流通用程序,适用于运筹学里的最大流算法,很实用,很好用-The biggest circulation in program
dell
- 最大流算法,简单易懂的算法,可作为初学者学习!-Maximum flow algorithm, a straightforward algorithm, as a beginner to learn!
Edmonds.cpp.tar
- Edmonds算法,寻找网络最大流 算法流程: 在残余网络中, 通过广搜找到一条增广路 找出增广路上的最小权值的边 更新残余网络 直到找不到增广路为止 // 统计当前网络中汇点的流-Edmonds algorithm to find the maximum network flow algorithm process: in the residual network, through extensive search to find an augmenting path
maxflow-v3.02.src
- 图的最大流算法实现 构造图,寻找增光路径,求取图的最大流-Graph algorithms to achieve maximum flow
Dinic
- 在图论中的网络流部分,使用Dinic算法求解网络中的最大流。(Can achieve maximum flow in graph theory)
pipei
- 求二分图最大匹配可以用最大流或者匈牙利算法。 最大匹配 给定一个二分图G,在G的一个子图M中,M的边集中的任意两条边都不依附于同一个顶点,则称M是一个匹配. 选择这样的边数最大的子集称为图的最大匹配问题 如果一个匹配中,图中的每个顶点都和图中某条边相关联,则称此匹配为完全匹配,也称作完备匹配。(For maximum matching of two partite graphs, maximum flow or Hungarian algorithm can be used. The maxim