搜索资源列表
maxstream
- java程序实现求解网络最大流问题,亲测，可以实现，欢迎交流-java program to achieve maximum network flow problem solving, pro-test, can be achieved, welcomed the exchange
PatientSystem
- 基于最大流的图像分割方法,利用图分割的方法，- a small code for image segmentation，using gtaph cut method
Minimum-cost-maximum-flow-algorithm
- 最大流最小费用算法-Minimum cost maximum flow algorithms. . . . . . . . . . . . . . .
EK
- 图论---数据结构---算法，网络流中求最大流的经典算法，EK算法。-Graph Theory--- Data Structures--- algorithms, network flow for maximum flow of the classical algorithm, EK algorithms.
network
- 对一个网络求最大流， 用朴素的 EdmondsKarp效率 O(E*f)Of a network for maximum flow, using simple EdmondsKarp the efficiency of O (E* f)-Of a network for maximum flow, using simple EdmondsKarp the efficiency of O (E* f)
Ford_Fulkerson
- 最大流Ford-Fulkerson算法源代码 流量网络中，寻找流量最大的可行流-Ford-Fulkerson maximum flow algorithm source code flow network, looking for the greatest possible flow of traffic
tulun
- 最小费用最大流问题通用LINGO程序。解决图论问题的必备。-Minimum cost maximum flow problem common LINGO program. Essential to solve the problem of graph theory.
maxflow-v3.01
- 这个软件图书馆实现了maxflow算法描述 “一个实验比较的最大流最小切/能量最小化算法在视觉。-This software library implements the maxflow algorithm described in "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.
lingo
- lingo 的一些编程,包括最大流，最短路和配对模型-some programming lingo, including maximum flow, shortest and matching model
max_min_segment
- 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
zui-xiao-fei-yong-zui-da-liu--Matlab
- 计算最小费用最大流的完整Matlab函数-Calculate the minimum cost maximum flow full Matlab functions
Minimum-Cost-Flow
- 最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。-Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity&q
ford-max-flow
- 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maxim
tulusuanfa
- 图论算法，里边的内容包括最短路径，最小生成树，最大流，遍历的算法及详细讲解。-Graph algorithms, including inside the shortest path, minimum spanning tree, maximum flow, traversal algorithms and detailed explanation.
MaxFlowMinCut_Me
- 利用Ford--Fulkerson 标号法求最大流算法的MATLAB 程序代码 -Use Ford- Fulkerson labeling method for maximum flow algorithm MATLAB code
EK
- ek最大流，求网络中可行的最大流量，返回该最大值-Feasible in ek maximum flow, network maximum flow, return to the maximum
linear-programming
- 最大流是关于流网络的最简单问题,线性规划要满足一定的约束条件。-Maximum flow is about the easiest flow network problems, linear programming to meet certain constraints.
maxflow1
- 最大流问题，用标号法寻求网络中最大流的基本思想是寻找可增广轨，使网络的流量得到增加，直到最大为止。-maximal flow
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