Assume an undirected system, graph where you want to find out elements in their permutations that makes the system disjoint such that each set is minimum. This graph has two special nodes: sink and source that cannot be in the elements.
How can you computationally find the minimum cuts given some graph G=(V,E)?
