搜索资源列表
Ford-Fulkerson-algorithm
- C语言编写的，用标号算法解决最大流问题，文件中有例子和结果，适合初学者学习使用。-Written in C language, with Ford-Fulkerson algorithm to solve the problem, a file with examples and results, suitable for beginners learning to use.
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
Maximum-Flow
- 最大流问题C++实现，对于数学建模或者图像处理领域都有较大帮助。-Maximum flow problem in C++, or in the field of mathematical modeling for image processing have greatly help.
Edmonds_Kap
- 最大流算法C语言实现，采用edmonds_kap非递归广度优先搜索-maximum flow algorithm implemented by C language
zuixiaofeiyong
- 给定一个有向图，根据上面的容量和费用问题，求出最小费用最大流来解决常见的工程问题-Given a directed graph, according to the capacity and cost issues above, find the minimum cost maximum flow to solve common engineering problems
MinimumCostFlow
- 最小费用最大流算法通用Matlab函数，最短路算法的Ford和Fulkerson法迭加算-Common minimum cost maximum flow algorithm Matlab function, the shortest path algorithm of Ford and Fulkerson method of superposition operator
maxflow
- 许多系统包含了流量问题。例如交通系统有车流量，金融系统有现金流，控制系统有信息流等。许多流问题主要是确定这类系统网络所能承受的最大流量以及如何达到这个最大流量。MATLAB环境下解决最大流问题-Many systems contain a flow problem. Traffic such as traffic system, the financial system has cash flow, information flow control system. Many flow probl
zuidaliu
- 最大流最小截问题，用ｍａｔｌａｂ编写的，ｒａｒ中有说明，较清晰-Maximum flow minimum cut problem, using matlab prepared, rar have stated more clearly
Minimum-cost-maximum-flow-
- 此程序能够解决网络中最小费用最大流问题，内含调试结果及解释。并附有分析流程，结果分析。-This program can solve the minimum cost maximum network flow problem, containing debugging results and interpretation. Together with the analysis process, the results of the analysis.
max_flow_min_cost
- 基于matlab的最小费用最大流的实现,用于最优化运输路径的选择，常用于图论问题、资源分配最优化问题-Matlab-based program of the minimum cost maximum flow ,which helps select optimal transport path. It is commonly used in graph theory problem of resource allocation optimization problem
flow
- 计算复杂网络的任意节点对间的最大流，基于python的复杂网络工具包-Complex network of maximum flow between any pair of nodes, based on complex network toolkit python
gco-v3.0
- 这是一种图割算法的实现，包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
zuixiaofeiyongzuidaliu
- 该程序使用VC编写的，其主要是实现ACM最小费用最大流的功能。-The program uses the VC, and its main function is to achieve minimum cost maximum flow of ACM.
1087(A-Plug-for-UNIX)(SAPPGAPPBFS)
- poj1087,SAP+GAP+BFS，最快的基于增广路径的最大流算法-poj1087, SAP+GAP+BFS, the fastest maximum flow algorithm based on augmenting path
1087(A-Plug-for-UNIX)
- poj1087,最快的基于预流推进的最大流算法-poj1087, the fastest maximum flow algorithm based on pre-stream propulsion
Matlab-code
- Matlab最大流，最小流等各种优化算法M文件-Matlab maximum flow, minimum flow, and other optimization algorithms M file
Puma-phase-unwrapping
- 利用图割方法（最大流最小割）进行相位解缠-Use graph cut method (maximum flow minimum cut) for phase unwrapping
active-graph-cuts
- 这是对最大流/最小割算法的改进方法的文献，希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard
maxflowmincut
- 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.