Package | Description |
---|---|
org.jgrapht.alg.interfaces |
Algorithm related interfaces.
|
org.jgrapht.alg.matching |
Algorithms for the computation of matchings.
|
Modifier and Type | Class and Description |
---|---|
static class |
MatchingAlgorithm.MatchingImpl<V,E>
A default implementation of the matching interface.
|
Modifier and Type | Method and Description |
---|---|
MatchingAlgorithm.Matching<V,E> |
MatchingAlgorithm.getMatching()
Compute a matching for a given graph.
|
Modifier and Type | Method and Description |
---|---|
MatchingAlgorithm.Matching<V,E> |
KuhnMunkresMinimalWeightBipartitePerfectMatching.getMatching()
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<V,E> |
MaximumWeightBipartiteMatching.getMatching()
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<V,E> |
PathGrowingWeightedMatching.getMatching()
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
|
MatchingAlgorithm.Matching<V,E> |
EdmondsMaximumCardinalityMatching.getMatching()
Returns a matching of maximum cardinality.
|
MatchingAlgorithm.Matching<V,E> |
GreedyWeightedMatching.getMatching()
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
|
MatchingAlgorithm.Matching<V,E> |
HopcroftKarpMaximumCardinalityBipartiteMatching.getMatching() |
MatchingAlgorithm.Matching<V,E> |
GreedyMaximumCardinalityMatching.getMatching()
Get a matching that is a $\frac{1}{2}$-approximation of the maximum cardinality matching.
|
Modifier and Type | Method and Description |
---|---|
boolean |
EdmondsMaximumCardinalityMatching.isMaximumMatching(MatchingAlgorithm.Matching<V,E> matching)
Checks whether the given matching is of maximum cardinality.
|
Copyright © 2018. All rights reserved.