org.jgrapht.alg
Class EdmondsBlossomShrinking<V,E>
- java.lang.Object
-
- org.jgrapht.alg.EdmondsBlossomShrinking<V,E>
-
- Type Parameters:
V- the graph vertex typeE- the graph edge type
- All Implemented Interfaces:
- MatchingAlgorithm<V,E>
Deprecated.UseEdmondsBlossomShrinkinginstead.
@Deprecated public class EdmondsBlossomShrinking<V,E> extends java.lang.Object implements MatchingAlgorithm<V,E>
An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs. The algorithm runs in time O(V^4).- Since:
- Jan 24, 2012
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.MatchingAlgorithm
MatchingAlgorithm.Matching<E>, MatchingAlgorithm.MatchingImpl<E>
-
-
Field Summary
-
Fields inherited from interface org.jgrapht.alg.interfaces.MatchingAlgorithm
DEFAULT_EPSILON
-
-
Constructor Summary
Constructors Constructor and Description EdmondsBlossomShrinking(UndirectedGraph<V,E> G)Deprecated.Construct an instance of the Edmonds blossom shrinking algorithm.
-
Method Summary
All Methods Instance Methods Concrete Methods Deprecated Methods Modifier and Type Method and Description MatchingAlgorithm.Matching<E>computeMatching()Deprecated.Compute a matching for a given graph.java.util.Set<E>getMatching()Deprecated.Returns set of edges making up the matching
-
-
-
Constructor Detail
-
EdmondsBlossomShrinking
public EdmondsBlossomShrinking(UndirectedGraph<V,E> G)
Deprecated.Construct an instance of the Edmonds blossom shrinking algorithm.- Parameters:
G- the input graph
-
-
Method Detail
-
getMatching
public java.util.Set<E> getMatching()
Deprecated.Returns set of edges making up the matching- Specified by:
getMatchingin interfaceMatchingAlgorithm<V,E>- Returns:
- a matching
-
computeMatching
public MatchingAlgorithm.Matching<E> computeMatching()
Deprecated.Compute a matching for a given graph.- Specified by:
computeMatchingin interfaceMatchingAlgorithm<V,E>- Returns:
- a matching
-
-
DataMelt 3.0 © DataMelt by jWork.ORG