#include <vector>#include <queue>#include <set>#include <lemon/bits/invalid.h>#include <lemon/unionfind.h>#include <lemon/graph_utils.h>#include <lemon/bin_heap.h>Classes | |
| class | MaxMatching< Graph > |
| Edmonds' alternating forest maximum matching algorithm. More... | |
| class | MaxWeightedMatching< _UGraph, _WeightMap > |
| Weighted matching in general undirected graphs. More... | |
| class | BlossomIt |
| Lemon iterator for get the items of the blossom. More... | |
| class | MaxWeightedPerfectMatching< _UGraph, _WeightMap > |
| Weighted perfect matching in general undirected graphs. More... | |
| class | BlossomIt |
| Lemon iterator for get the items of the blossom. More... | |
Namespaces | |
| namespace | lemon |
| The namespace of LEMON. | |
1.5.9