Description: 这是自己用c#写的一段关于图的最小切的算法，主要参考了论文：
《An Experimental Comparison of
Min-Cut/Max-Flow Algorithms for
Energy Minimization in Vision》
此文中的算法是目前比较优秀的最小切算法-This is their use of c# Write a paragraph on the minimum cut graph algorithm, the main reference of the thesis: Platform: |
Size: 3072 |
Author:张曦 |
Hits:
Description: C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版-C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates Platform: |
Size: 11264 |
Author:jz |
Hits:
Description: Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5-Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5 Platform: |
Size: 1024 |
Author:Joao |
Hits:
Description: 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 description, is easy to implement, and
has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm
known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the
algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about uVu nearly
identical phases each of which is a maximum adjacency search. Platform: |
Size: 2048 |
Author:Daniel |
Hits:
Description: 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts Platform: |
Size: 1033216 |
Author:黄鹏 |
Hits:
Description: 对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 minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate. Platform: |
Size: 55296 |
Author:中士 |
Hits:
Description: 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。
-Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method. Platform: |
Size: 38912 |
Author:小马 |
Hits:
Description: 全局立体匹配一直是一个比较困难的问题，本算法通过C++编译器，实现了全局立体匹配算法，希望对你有帮助-Stereo matching algorithm based on graph cuts, using the maximum flow/minimum cut methods to achieve global stereo matching. Platform: |
Size: 6223872 |
Author:gongwenbiao |
Hits:
Description: 这是一种图割算法的实现，包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation Platform: |
Size: 149504 |
Author:renmeimei |
Hits:
Description: 这是对最大流/最小割算法的改进方法的文献，希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard Platform: |
Size: 396288 |
Author:renmeimei |
Hits:
Description: 求最小割集的近似算法，具有近似性的保证，可用于社会网络的分析以及求图的最小割集。-trives for the approximate algorithm of minimum cut sets, with approximate guarantee, can be used for the analysis of social networks and strives for the minimum cut set of the graph. Platform: |
Size: 1281024 |
Author:达松 |
Hits:
Description: 使用最小割最大流实现图割的立体匹配算法，建立匹配能量函数，构造网格图并求得最小值，匹配效率高时间短，内附说明文档及分析用法。
-The use of the maximum flow minimum cut graph cut algorithm for stereo matching, matching of energy function, and obtain the minimum mesh structure, high efficiency, short time, containing documentation and analysis. Platform: |
Size: 7521280 |
Author:helloC |
Hits:
Search - minimum cut graph algorithm