Package | Description |
---|---|
org.jgrapht.alg |
Algorithms provided with JGraphT.
|
org.jgrapht.alg.interfaces |
Algorithm related interfaces.
|
org.jgrapht.alg.matching |
Algorithms for the computation of matchings.
|
Modifier and Type | Method and Description |
---|---|
MatchingAlgorithm.Matching<E> |
EdmondsBlossomShrinking.computeMatching()
Deprecated.
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<E> |
HopcroftKarpBipartiteMatching.computeMatching()
Deprecated.
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<E> |
KuhnMunkresMinimalWeightBipartitePerfectMatching.computeMatching()
Deprecated.
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<E> |
MaximumWeightBipartiteMatching.computeMatching()
Deprecated.
Compute a matching for a given graph.
|
Modifier and Type | Class and Description |
---|---|
static class |
MatchingAlgorithm.MatchingImpl<E>
A default implementation of the matching interface.
|
Modifier and Type | Method and Description |
---|---|
MatchingAlgorithm.Matching<E> |
MatchingAlgorithm.computeMatching()
Compute a matching for a given graph.
|
Modifier and Type | Method and Description |
---|---|
MatchingAlgorithm.Matching<E> |
EdmondsBlossomShrinking.computeMatching()
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<E> |
PathGrowingWeightedMatching.computeMatching()
Get a matching that is a 1/2-approximation of the maximum weighted matching.
|
MatchingAlgorithm.Matching<E> |
HopcroftKarpBipartiteMatching.computeMatching()
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<E> |
GreedyWeightedMatching.computeMatching()
Get a matching that is a 1/2-approximation of the maximum weighted matching.
|
MatchingAlgorithm.Matching<E> |
KuhnMunkresMinimalWeightBipartitePerfectMatching.computeMatching()
Compute a matching for a given graph.
|
MatchingAlgorithm.Matching<E> |
MaximumWeightBipartiteMatching.computeMatching()
Compute a matching for a given graph.
|
Copyright © 2017. All rights reserved.