Uses of Interface
org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
Packages that use MatchingAlgorithm.Matching
Package
Description
Algorithms for computing decompositions.
Algorithm related interfaces.
Algorithms for the computation of matchings.
Package for Kolmogorov's Blossom V algorithm
-
Uses of MatchingAlgorithm.Matching in org.jgrapht.alg.decomposition
Methods in org.jgrapht.alg.decomposition with parameters of type MatchingAlgorithm.MatchingModifier and TypeMethodDescriptionprivate Graph
<E, DefaultEdge> DulmageMendelsohnDecomposition.asDirectedEdgeGraph
(MatchingAlgorithm.Matching<V, E> matching, Set<V> subset) private Graph
<V, DefaultEdge> DulmageMendelsohnDecomposition.asDirectedGraph
(MatchingAlgorithm.Matching<V, E> matching) DulmageMendelsohnDecomposition.decompose
(MatchingAlgorithm.Matching<V, E> matching, boolean fine) Perform the decomposition, using a pre-calculated bipartite matchingprivate void
DulmageMendelsohnDecomposition.getUnmatched
(MatchingAlgorithm.Matching<V, E> matching, Set<V> unmatched1, Set<V> unmatched2) -
Uses of MatchingAlgorithm.Matching in org.jgrapht.alg.interfaces
Classes in org.jgrapht.alg.interfaces that implement MatchingAlgorithm.MatchingModifier and TypeClassDescriptionstatic class
A default implementation of the matching interface.Methods in org.jgrapht.alg.interfaces that return MatchingAlgorithm.MatchingModifier and TypeMethodDescriptionMatchingAlgorithm.getMatching()
Compute a matching for a given graph. -
Uses of MatchingAlgorithm.Matching in org.jgrapht.alg.matching
Fields in org.jgrapht.alg.matching declared as MatchingAlgorithm.MatchingModifier and TypeFieldDescriptionprivate MatchingAlgorithm.Matching
<V, E> SparseEdmondsMaximumCardinalityMatching.result
Methods in org.jgrapht.alg.matching that return MatchingAlgorithm.MatchingModifier and TypeMethodDescriptionDenseEdmondsMaximumCardinalityMatching.getMatching()
Returns a matching of maximum cardinality.GreedyMaximumCardinalityMatching.getMatching()
Get a matching that is a $\frac{1}{2}$-approximation of the maximum cardinality matching.GreedyWeightedMatching.getMatching()
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.HopcroftKarpMaximumCardinalityBipartiteMatching.getMatching()
KuhnMunkresMinimalWeightBipartitePerfectMatching.getMatching()
Compute a matching for a given graph.MaximumWeightBipartiteMatching.getMatching()
Compute a matching for a given graph.PathGrowingWeightedMatching.getMatching()
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.SparseEdmondsMaximumCardinalityMatching.getMatching()
private MatchingAlgorithm.Matching
<V, E> PathGrowingWeightedMatching.run()
private MatchingAlgorithm.Matching
<V, E> PathGrowingWeightedMatching.runWithHeuristics()
Methods in org.jgrapht.alg.matching with parameters of type MatchingAlgorithm.MatchingModifier and TypeMethodDescriptionboolean
DenseEdmondsMaximumCardinalityMatching.isMaximumMatching
(MatchingAlgorithm.Matching<V, E> matching) Checks whether the given matching is of maximum cardinality. -
Uses of MatchingAlgorithm.Matching in org.jgrapht.alg.matching.blossom.v5
Fields in org.jgrapht.alg.matching.blossom.v5 declared as MatchingAlgorithm.MatchingModifier and TypeFieldDescriptionprivate MatchingAlgorithm.Matching
<V, E> KolmogorovWeightedMatching.matching
The computed matching of thegraph
private MatchingAlgorithm.Matching
<V, E> KolmogorovWeightedPerfectMatching.matching
The computed matching of thegraph
Methods in org.jgrapht.alg.matching.blossom.v5 that return MatchingAlgorithm.MatchingModifier and TypeMethodDescriptionKolmogorovWeightedMatching.getMatching()
Computes and returns a matching of maximum or minimum weight in theinitialGraph
depending on the goal of the algorithm.KolmogorovWeightedPerfectMatching.getMatching()
Computes and returns a weighted perfect matching in thegraph
.