Version 5.0 The LEDA User Manual

inline bool CHECK MAX FLOW T(const graph& G, node s, node t,
const edge array& cap,
const edge array& f)
checks whether f is a maximum flow in the network (G, s, t, cap). The functions
returns false if this is not the case.
bool MAX FLOW SCALE CAPS(const graph& G, node s, edge array& cap)
replaces cap[e] by cap1 [e] for every edge e, where cap1 [e] is as defined above.
The function returns false if the scaling changed some capacity, and returns
true otherwise.
template
inline NT MAX FLOW T(graph& G, node s, node t, const edge array& lcap,
const edge array& ucap, edge array& f)
computes a maximum (s, t)-flow f in the network (G, s, t, ucap) s.th. f(e) ≤
lcap[e] for every edge e. If a feasible flow exists, its value returned; otherwise
the return value is -1.
The following functions are only available in template form. They allow to study the effect
of different heuristics and of different selection rules on the preflow push method. The
class SET must provide the following operations: construction, destruction, del, insert,
insert0 , and clear; see the LEDA book for details. Three implementations are part of the
distribution: fifo set, hl set, and mfifo set.
template
NT MAX FLOW BASIC T(const graph& G, node s, node t,
const edge array& cap, edge array& flow,
SET & U, int& num pushes, int& num edge inspections,
int& num relabels)
The basic version of the preflow push algorithm: No heuristic is used.
template
inline NT MAX FLOW LH T(const graph& G, node s, node t,
const edge array& cap, edge array& flow,
SET & U, int& num pushes, int& num edge inspections,
int& num relabels)
The preflow push method with the distinction between low and high nodes.
template
inline NT MAX FLOW LRH T(const graph& G, node s, node t,
const edge array& cap, edge array& flow,
SET & U, int& num pushes,
int& num edge inspections, int& num relabels)
The preflow push method with the distinction between low and high nodes and
the local relabeling heuristic.
template