I'll leave it for you to check that there is no cut in this graph with fewer than two crossing edges, so this is in fact a min cut. &amp;gt;&amp;gt;Of course, this is a randomized algorithm, and randomized algorithms can behave differently on different executions. 