Add support for maximum matching in general graphs
Add support for maximum matching in general graphs: a task in LegoFlow-SWE (Harbor dataset). Currently the library only provides igraph maximum bipartite matching() , which is limited to bipartite graphs. There is no function to find a maximum cardinality matching in arbitrary undirected graphs…
The task
Currently the library only provides `igraph_maximum_bipartite_matching()`, which is limited to bipartite graphs. There is no function to find a **maximum cardinality matching** in arbitrary undirected graphs, including non‑bipartite ones (graphs containing odd‑length cycles). This leaves users without a general…
Part of Lego-X/LegoFlow-SWE.