edgecut
An edge cut of a graph is a set of edges whose removal increases the number of connected components of the graph. Equivalently, a cut set is the set of edges that cross a partition of the vertices into two nonempty parts; removing those crossing edges disconnects the graph.
The minimum size of an edge cut in a connected graph is called the edge connectivity, denoted
In weighted graphs, edges have capacities or weights, and the minimum cut problem seeks a cut with
Edge cuts have applications in network reliability, designer optimization, clustering, and circuit layout. They are closely