@graphty/algorithms / index / maximumBipartiteMatching
Function: maximumBipartiteMatching() ​
maximumBipartiteMatching(
graph,options):BipartiteMatchingResult
Defined in: algorithms/matching/bipartite.ts:33
Find maximum matching in a bipartite graph using augmenting path algorithm (simplified implementation that's more reliable than Hopcroft-Karp for this context)
Parameters ​
graph ​
The bipartite graph to find maximum matching for
options ​
Optional configuration including left and right node partitions
Returns ​
The maximum matching as a map from left nodes to right nodes and the matching size
Throws ​
Error if the graph is not bipartite