Version 5.0 The LEDA User Manual

12.5 Minimum Cut ( min cut )
A cut C in a network is a set S of nodes that is neither empty nor the entire set of nodes.
The weight of a cut is the sum of the weights of the edges having exactly one endpoint in
S.
int
list
int
MIN CUT(const graph& G, const edge array& weight,
list& C, bool use heuristic = true)
MIN CUT takes a graph G and an edge array weight
that gives for each edge a non-negative integer weight.
The algorithm ([82]) computes a cut of minimum
weight. A cut of minimum weight is returned in C
and the value of the cut is the return value of the
function. The running time is O(nm + n 2 log n). The
function uses a heuristic to speed up its computation.
Precondition: The edge weights are non-negative.
MIN CUT(const graph& G, const edge array& weight)
as above, but the cut C is returned.
CUT VALUE(const graph& G, const edge array& weight,
const list& C)
returns the value of the cut C.