搜索资源列表
最大流最小割定理
- 最大流最小割定理-maximum flow minimum cut theorem
MaxStream
- 学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
介绍了图割的基本思想
- 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
3_MinCut.rar
- 一个经典的求解最大流最小割代码 VC++版本,A classical solution of maximum flow minimum cut code VC++ Version
max-flow-min-cut-theorem
- 初学最大流最小割的几个很有用的参考资料，详细介绍了它的应用，很有帮助哦！-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
graph_cut
- 最大流最小割的代码，功能很好很强大，可以用在图形剪除这方面。-Maximum flow minimum cut of the code, very very powerful feature can be used to cut off this area in the graphics.
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
Simple_MinCut
- Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact descr iption, is easy to implement, and has a surprisingly simple proof of correctness.
Maxiflowminicut
- 最大流和最小截算法，在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-Maximum flow and minimum cut algorithms, in this function exists in the preparation of a detail, if any label does not take a check point has been, I get the most fr
newmaxflowaigorithm
- 实现了An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov]中的新的最大流算法，经过实验验证比传统的最大流算法效率更高-Achieved An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Mini
maxflow-v2.21.src
- 最大流最小割算法的c++源代码,用于图像分割和处理领域-Minimum cut maximum flow algorithm c++ source code for image segmentation and processing
graphcut
- Kmeans 聚类，graphcut 图像分割,最大流最小割算法-Kmeans clustering, graphcut image segmentation, the maximum flow minimum cut algorithm
zuidaliu
- 最大流最小截问题，用ｍａｔｌａｂ编写的，ｒａｒ中有说明，较清晰-Maximum flow minimum cut problem, written with matlab, rar have stated more clearly
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
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
ALE
- 图像分割算法，是基于最小切最大流算法的分割方法。-The image segmentation algorithm is a segmentation method based on the maximum flow minimum cut algorithm.
dijkstra
- 用于图像分割的dijkstra距离的计算，用于最大流最小割等算法-To dijkstra distance calculation used to image segmentation for the maximum flow minimum cut algorithm
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
Maximum flow / min cut
- Maximum flow / minimum cut through path algorithm
Graph_Cut (C++代码)
- 利用最大流最小割的原理，实现了graph cut对图像的分割，方法简单，易于理解(Using the principle of maximum flow minimum cut, graph cut can be used to segment images. The method is simple and easy to understand.)