org.jgrapht.alg.interfaces

Interface MatchingAlgorithm<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Known Implementing Classes:

EdmondsBlossomShrinking, EdmondsMaximumCardinalityMatching, GreedyMaximumCardinalityMatching, GreedyWeightedMatching, HopcroftKarpBipartiteMatching, HopcroftKarpMaximumCardinalityBipartiteMatching, KuhnMunkresMinimalWeightBipartitePerfectMatching, MaximumWeightBipartiteMatching, PathGrowingWeightedMatching

public interface MatchingAlgorithm<V,E>

Allows to derive a matching of a given graph.

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static interface	MatchingAlgorithm.Matching<V,E> A graph matching.
static class	MatchingAlgorithm.MatchingImpl<V,E> A default implementation of the matching interface.

Field Summary

Fields

Modifier and Type	Field and Description
static double	DEFAULT_EPSILON Default tolerance used by algorithms comparing floating point values.

Method Summary

Modifier and Type	Method and Description
default MatchingAlgorithm.Matching<V,E>	computeMatching() Deprecated. This method has been renamed to getMatching()
MatchingAlgorithm.Matching<V,E>	getMatching() Compute a matching for a given graph.

Field Detail

DEFAULT_EPSILON

static final double DEFAULT_EPSILON

Default tolerance used by algorithms comparing floating point values.

See Also:

Constant Field Values

Method Detail

getMatching

MatchingAlgorithm.Matching<V,E> getMatching()

Compute a matching for a given graph.

Returns:

a matching

computeMatching

@Deprecated
default MatchingAlgorithm.Matching<V,E> computeMatching()

Deprecated. This method has been renamed to getMatching()

Compute a matching for a given graph.

Returns:

a matching