@graphty/algorithms / index / BipartiteMatchingResult
Interface: BipartiteMatchingResult ​
Defined in: algorithms/matching/bipartite.ts:15
Maximum Bipartite Matching implementation using Hopcroft-Karp algorithm
Finds the maximum matching in a bipartite graph. A matching is a set of edges without common vertices. Maximum matching has the largest possible number of edges.
Time complexity: O(√V × E) Space complexity: O(V)
Properties ​
matching ​
Defined in: algorithms/matching/bipartite.ts:16
size ​
size:
number
Defined in: algorithms/matching/bipartite.ts:17