Wikipedia has a nice diagram on another page[0] - in a weighted graph where all nodes have enough connections, separating just a single node is likely to cost m

Wikipedia has a nice diagram on another page[0] - in a weighted graph where all nodes have enough connections, separating just a single node is likely to cost more than finding some cheap partition between two groups. [0] https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm#/media/File:Stoer_wagner-example-min-cut.gif https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm...