Package | Description |
---|---|
org.jgrapht.alg.matching |
Algorithms for the computation of matchings.
|
Modifier and Type | Class and Description |
---|---|
class |
EdmondsBlossomShrinking<V,E>
Deprecated.
Deprecated in favor of the more efficient
EdmondsMaximumCardinalityMatching . |
class |
EdmondsMaximumCardinalityMatching<V,E>
This implementation of Edmonds' blossom algorithm computes maximum cardinality matchings in
undirected graphs.
|
class |
GreedyMaximumCardinalityMatching<V,E>
A simple class which computes a random, maximum cardinality matching.
|
class |
GreedyWeightedMatching<V,E>
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.
|
class |
HopcroftKarpBipartiteMatching<V,E>
Deprecated.
Deprecated in favor of
HopcroftKarpMaximumCardinalityBipartiteMatching |
class |
HopcroftKarpMaximumCardinalityBipartiteMatching<V,E>
Implementation of the well-known Hopcroft Karp algorithm to compute a matching of maximum
cardinality in a 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.
|
class |
PathGrowingWeightedMatching<V,E>
A linear time 1/2-approximation algorithm for finding a maximum weight matching in an arbitrary
graph.
|
Constructor and Description |
---|
EdmondsMaximumCardinalityMatching(Graph<V,E> graph,
MatchingAlgorithm<V,E> initializer)
Constructs a new instance of the algorithm.
|
Copyright © 2017. All rights reserved.