Search - cut.e - CodeBus

Search - cut.e - List

[Data structs] cut-the-minimum-cut-problem DL : 0: cut 最小割问题网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-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.
Date : 2025-12-22 Size : 329kb User : yjian