org.jgrapht.alg

Class EdmondsBlossomShrinking<V,E>

java.lang.Object

org.jgrapht.alg.EdmondsBlossomShrinking<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Implemented Interfaces:

MatchingAlgorithm<V,E>

public class EdmondsBlossomShrinking<V,E>
extends 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

Author:

Alejandro R. Lopez del Huerto

Constructor Summary

Constructors

Constructor and Description
EdmondsBlossomShrinking() Deprecated.
EdmondsBlossomShrinking(UndirectedGraph<V,E> G) Construct an instance of the Edmonds blossom shrinking algorithm.

Method Summary

Modifier and Type	Method and Description
Set<E>	findMatch(UndirectedGraph<V,E> g) Deprecated. See getMatching() as preferred alternative to this one.
Set<E>	getMatching() Returns set of edges making up the matching

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

EdmondsBlossomShrinking

@Deprecated
public EdmondsBlossomShrinking()

Deprecated.

Construct an instance of the Edmonds blossom shrinking algorithm.

EdmondsBlossomShrinking

public EdmondsBlossomShrinking(UndirectedGraph<V,E> G)

Construct an instance of the Edmonds blossom shrinking algorithm.

Parameters:

G - the input graph

Method Detail

findMatch

@Deprecated
public Set<E> findMatch(UndirectedGraph<V,E> g)

Deprecated. See getMatching() as preferred alternative to this one.

Find the matching.

Parameters:

g - the input graph

Returns:

a matching

getMatching

public Set<E> getMatching()

Returns set of edges making up the matching

Specified by:

getMatching in interface MatchingAlgorithm<V,E>

Returns:

a matching