An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs.
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.
This class is an implementation of the Hopcroft-Karp algorithm which finds a maximum matching in an undirected simple bipartite graph.
Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres) solving assignment problem also known as hungarian algorithm (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
This class finds a maximum weight matching of a simple undirected weighted bipartite graph.
A linear time 1/2-approximation algorithm for finding a maximum weight matching in an arbitrary graph.
Copyright © 2017. All rights reserved.