FindEdgeCut

FindEdgeCut[g] finds a smallest edge cut of the graph g.

• FindEdgeCut[g,s,t] finds a smallest s-t edge cut of the graph g.
• FindEdgeCut[{v->w,…},…] uses rules v->w to specify the graph g.

Examples

(* Find the smallest edge cut *)
g = Graph[{1 <-> 2, 2 <-> 3, 3 <-> 4, 1 <-> 4}];
FindEdgeCut[g]

(* Find s-t edge cut *)
FindEdgeCut[g, 1, 3]

(* Visualize the cut *)
cut = FindEdgeCut[g];
HighlightGraph[g, cut]

Please visit the official Wolfram Language Reference for more details.