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

- Packages that use MatchingAlgorithm
  Package | Description
  --- | ---
  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
    Modifier and Type | Class and Description
    --- | ---
    `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).
    `class` | `MaximumWeightBipartiteMatching<V,E>` This class finds a maximum weight matching of a simple undirected weighted bipartite graph.

  - ### Uses of MatchingAlgorithm in org.jgrapht.alg.interfaces

    Subinterfaces of MatchingAlgorithm in org.jgrapht.alg.interfaces
    Modifier and Type | Interface and Description
    --- | ---
    `interface` | `WeightedMatchingAlgorithm<V,E>` Allows to derive weighted matching from general graph

Copyright © 2016. All rights reserved.