JOIN
Get Time
forums  Revision History
Search My Post History  |  My Watches  |  User Settings
Forums Tutorial Discussions Maximum Flow tutorial Re: Finding Minimum Edges Minimum Cut Revision History (1 edit)
Re: Finding Minimum Edges Minimum Cut (response to post by zdravko_b)
Let S be the set of all vertices reachable from the source(including the source itself) and T = V \ S. Then the pair (S, T) forms a minimum cut and, therefore, dfs is all you need.
Re: Finding Minimum Edges Minimum Cut (response to post by zdravko_b)
Let S be a set of vertices reachable from the source(including the source itself) and T = V \ S. Then the pair (S, T) forms a minimum cut and, therefore, dfs is all you need.