computes a maximum cardinality matching in an undirected Graph
This is a programming exercise for a lecture course in combinatorial optimisation. The precise assignment can be found on the second page of the third exercise set.
Shaomada/Maximum-Cardinality-Matching
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|