The edge connectivity of a simple graph is the least number of edges whose removal disconnects the graph.
<clarity> The edge connectivity of a simple graph is the least number of edges whose removal disconnects the graph.
The minimum cut problem in an undirected and weighted graph G is to find the minimum total weight of a set of edges whose removal disconnects the graph.