搜索资源列表
max flow/min cut
- max flow/min cut 实现最大流最小割算法的程序
Ford-Fulkerson
- Ford-Fulkerson Min cut / Max flow-Ford-Fulkerson Min cut/Max flow
AnExperimentalComparisonofMin-CutMax-FlowAlgorithm
- The goal of this paper is to provide an experimental comparison of the efficiency ofmin-cut/max flow algorithms for applications in vision
Excel_usin
- 简单的excel表在C与内置的功能的剪切、复制、粘贴和提供功能如最大值、最小值、转置、金额。-Simple excel sheet in C with inbuilt functionalities of cut, copy, paste and provides funcitons like max,min,transpose,sum.
maxflow
- 最大流 最小割 是图割理论的重要部分，能用于双目立体视觉的立体匹配当中。-Max-flow is the important part of graph-cut theory,it also used to the stereo matching.
dinic
- dinic算法的实现。用来计算最大流最小割问题-Dinic algorithm for solving min-cut or max-flow problems
TSPSearch
- c++使用禁忌算法解决MAX-CUT问题-c++ use tabu search algorithm to solve the problem of MAX-CUT