Uses of Interface
org.jgrapht.alg.interfaces.MatchingAlgorithm

Packages that use MatchingAlgorithm
org.jgrapht.alg Algorithms provided with JGraphT
org.jgrapht.alg.interfaces   
 

Uses of MatchingAlgorithm in org.jgrapht.alg
 

Classes in org.jgrapht.alg that implement MatchingAlgorithm
 class EdmondsBlossomShrinking<V,E>
          An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs.
 class HopcroftKarpBipartiteMatching<V,E>
          This class is an implementation of the Hopcroft-Karp algorithm which finds a maximum matching in an undirected simple bipartite graph.
 class KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E>
          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).
 

Uses of MatchingAlgorithm in org.jgrapht.alg.interfaces
 

Subinterfaces of MatchingAlgorithm in org.jgrapht.alg.interfaces
 interface WeightedMatchingAlgorithm<V,E>
          Allows to derive weighted matching from general graph
 



Copyright © 2013. All rights reserved.