The functions that yield a matching in a general graph make use of two algorithms:
| Algorithm | Mode of Operation | |
| WorstAlternativeNext | heuristic | |
| greedy | use first applicable edge |
Implemented is the following function:
| Function | Short Description | |
| MinimumWeight- Matching |
(maximum) matching in a graph with minimum cost/weight |
The facing column contains an example for the function.
