Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact descr iption, is easy to implement, and has a surprisingly simple proof of correctness.