darian-catalin-cucer/maximum-matching

The Maximum Matching algorithm finds the largest possible set of edges in a graph with no common vertices. It has applications in computer science, mathematics, and operations research and can be solved efficiently with algorithms such as augmenting path and Hopcroft-Karp with a time complexity of O(E√V).

Kotlin