Title:
cut-the-minimum-cut-problem
Download
Description: cut the minimum cut problem network G = (V, E) of the cut cut (S, T) is the vertex set V of G into two disjoint subsets S and T, so that s Î S, t Î T, and cut ( S, T) = {(u, v) Î E | u Î S, vÎ T}. Let each edge (u, v) the right side is a (u, v), then cut cut (S, T) has a weight cut (S, T) and the rights of all sides. Minimum cut problem requires a network G, the minimum weight cut.
To Search:
File list (Check if you may need any files):
cut 最小割问题\cut.pdf
..............\沈志斌\cut.cpp
..............\......\cut.ppt
..............\高波\cut.cpp
..............\....\cut.ppt
..............\沈志斌
..............\高波
cut 最小割问题
