[−][src]Module gamma::matching
Structs
| Matching | An undirected graph in which each node has degree one. |
Functions
| greedy | Attempts a greedy matching. The Graph is traversed in depth-first order from the first node it iterates. Edges are added to the result if neither terminal has been added already. Bipartate graphs always return a perfect Matching. Non-bipartate graphs yield either maximal or maximum Matchings. |