Version 5.0 The LEDA User Manual

Worst-Case Running Time: All functions for computing maximum or minimum
weighted (perfect or non-perfect) matchings guarantee a running time of O(nm log n),
where n and m denote the number of nodes and edges, respectively.
template
list MAX WEIGHT MATCHING T(const graph& G, const edge array& w,
bool check = true, int heur = 2)
computes a maximum-weight matching M of the undirected graph G with
weight function w. If check is set to true, the optimality of M is checked
internally. The heuristic used for the construction of an initial matching
is determined by heur.
Precondition: All edge weights must be non-negative.
template
list MAX WEIGHT MATCHING T(const graph& G, const edge array& w,
node array& pot, array& BT, node array& b,
bool check = true, int heur = 2)
computes a maximum-weight matching M of the undirected graph G
with weight function w. The function provides a proof of optimality in
the form of a dual solution given by pot, BT and b. If check is set to
true, the optimality of M is checked internally. The heuristic used for
the construction of an initial matching is determined by heur.
Precondition: All edge weights must be non-negative.
template
bool CHECK MAX WEIGHT MATCHING T(const graph& G,
const edge array& w,
const list& M,
const node array& pot,
const array& BT , const node array& b)
checks if M together with the dual solution represented by pot, BT and
b are optimal. The function returns true if M is a maximum-weight
matching of G with weight function w.
template