Mincut. In computer science and optimization theory the max flow min cut theorem states that in a flow network the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut i e. This theorem states that the maximum flow through any network from a given source to a given sink is exactly the sum of the edge weights that if removed would totally disconnect the source from the sink.
Its capacity is the sum of the capacities of the edges from a to b. The minimum cut problem or mincut problem is to nd a cut of minimum cost. In computer science and optimization theory the max flow min cut theorem states that in a flow network the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut i e.
Variations of the minimum cut problem consider weighted graphs directed graphs terminals and partitioning the vertices into more than two sets.
Minimum st cut mincut problem. The smallest total weight of the edges which if removed would disconnect the source from the sink. Import torch eps 1e 15. Using the current best max flow algorithms this results in an overall running time of o m min p m n2 3 for weighted graphs and m4 3 o 1 for unweighted multi graphs.
