搜索资源列表
version-3.1
- min-cut max-flow implemtation
maxflow-v3.03.src
- 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 Pattern Analys
dinic
- dinic算法的实现。用来计算最大流最小割问题-Dinic algorithm for solving min-cut or max-flow problems
maxflow-v2.22.src
- 由最大流最小割算法，求图的最大流。基于论文 “An Experimental Comparison of Min-Cut/Max-Flow Algorithms”-The maximum flow minimum cut algorithm, seeking maximum flow chart. Paper-based An Experimental Comparison of Min-Cut/Max-Flow Algorithms
max_flow
- min s-t graph cut // max flow
maxflow-v3.04.src
- 图割法程序，min-cut/max-flow实现图像的分割-Graph cut method procedures, min-cut/max-flow of image segmentation