MatchingAlgorithm

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Known Subinterfaces:

WeightedMatchingAlgorithm<V,E>

All Known Implementing Classes:

EdmondsBlossomShrinking, EdmondsBlossomShrinking, GreedyWeightedMatching, HopcroftKarpBipartiteMatching, HopcroftKarpBipartiteMatching, KuhnMunkresMinimalWeightBipartitePerfectMatching, KuhnMunkresMinimalWeightBipartitePerfectMatching, MaximumWeightBipartiteMatching, 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	Description
`static interface`	`MatchingAlgorithm.Matching<E>`	A graph matching.
`static class`	`MatchingAlgorithm.MatchingImpl<E>`	A default implementation of the matching interface.

Field Summary

Fields
Modifier and Type Field Description

static double DEFAULT_EPSILON
Default tolerance used by algorithms comparing floating point values.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods Deprecated Methods
Modifier and Type	Method	Description
`MatchingAlgorithm.Matching<E>`	`computeMatching()`	Compute a matching for a given graph.
`default java.util.Set<E>`	`getMatching()`	Deprecated. Use `computeMatching()` instead.

- 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
```
@Deprecated
default java.util.Set<E> getMatching()
```
    Deprecated.
    Use computeMatching() instead.
    
    Returns set of edges making up the matching
    
    Returns:
    
    a matching
  - computeMatching
```
MatchingAlgorithm.Matching<E> computeMatching()
```
    Compute a matching for a given graph.
    
    Returns:
    
    a matching