Deprecated in favor of the more efficient
This implementation of Edmonds' blossom algorithm computes maximum cardinality matchings in undirected graphs.
A simple class which computes a random, maximum cardinality matching.
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.
Deprecated in favor of
Implementation of the well-known Hopcroft Karp algorithm to compute a matching of maximum cardinality in a 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.