搜索资源列表
maxflow
- 实现的是最大流的两种增广路算法，用到队列和BFS寻增广路-To achieve the maximum flow of the two augmenting path algorithm, used in the queue and the BFS search augmenting path
graphcut
- 最大流最小割，用于图片分割以及与图片分割类似的网络问题-Maxflow/minium cut,used in graph cut or other similar problem
1163
- 最大流算法，差分约束系统， 最大流算法，差分约束系统， 最大流算法，差分约束系统，的代码实现-the algorithm of maxflow askfasfka alskdfja aldfjas askdjfa askdlfjad askdf askfj askdfj askfjaf
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
dgc
- 动态的基于图模型的图像分割算法 ，利用最大流最小波-DYNNAMIC GRAPH CUTS- software for dynamically computing mincut/maxflow in a graph
Synth5src4img
- This software library implements the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. Yuri Boykov and Vladimir Kolmogorov. In IEEE Transactions on Patte
match-v3.4.src.tar
- 计算机视觉中的，基于图论的图像分割，最大流/最小切-maxflow/mincut ,graph cuts,computer vision
coseg_maxflow_distrib.tar
- 使用maxflow解决图像协同分割的算法-use maxflow to solve the co-segmentation task
CMF_ML_v1.0
- 使用maxflow算法处理2D或者3D的图像分割问题，包括了matlab和c的代码。-The software package includes the programs solving the 2D/3D multi-region image segmentation problem,through the fast continuous max-flow algorithm
maxflow
- maximum flow in a network
mincut
- An implementation of "A min cut algorithm" by Stoer and Wagner. In addition there is an option to find the minimal cut that does not separate a set of vertices. This is not a mincut-maxflow algorithm.
maxflow
- 通过标号发计算网络优化技术中的最大流问题。-By the maximum flow problem in the label hair computing network optimization technology.
maxflow-with-mincost
- 最小费用最大流 供在学生学习使用，信息学竞赛资料-Minimum cost maximum flow for use in student learning, information science contest
maxflow
- 最大流算法，图像处理，进行处理使图像 优化，提取轮廓-failed to translate
maxflow-v3.01
- Boykov 和 Kolmogorov 的代码，图像处理 graphcut-Boykov and Kolmogorov code, image processing graphcut
maxflow-v3.01
- 最新版本的max flow 算法，功能很强大很有作用-max—flow algorithm
maxflow-v3.02.src
- 图的最大流算法实现 构造图，寻找增光路径，求取图的最大流-Graph algorithms to achieve maximum flow
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
maxflow
- 最大流算法 可以解决最小费用最大流问题 非常好用，推荐推荐-Maximum flow algorithm can solve the problem of minimum cost maximum flow is very good, recommended!!!!!!!!!!!
testMaxflow
- 最大流ford fulkerson C++代码实现。-Maxflow algorithm implementation