org.jgrapht.alg.matching

Class MaximumWeightBipartiteMatching<V,E>

java.lang.Object

org.jgrapht.alg.matching.MaximumWeightBipartiteMatching<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Implemented Interfaces:

MatchingAlgorithm<V,E>

public class MaximumWeightBipartiteMatching<V,E>
extends Object
implements MatchingAlgorithm<V,E>

This class finds a maximum weight matching of a simple undirected weighted bipartite graph. The algorithm runs in O(V|E|^2). The algorithm is described in The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999. https://people.mpi-inf.mpg.de/~mehlhorn/LEDAbook.html Note: the input graph must be bipartite with positive integer edge weights

Author:

Graeme Ahokas

Nested Class Summary

Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.MatchingAlgorithm

MatchingAlgorithm.Matching<V,E>, MatchingAlgorithm.MatchingImpl<V,E>

Field Summary

Fields inherited from interface org.jgrapht.alg.interfaces.MatchingAlgorithm

DEFAULT_EPSILON

Constructor Summary

Constructors

Constructor and Description
MaximumWeightBipartiteMatching(Graph<V,E> graph, Set<V> partition1, Set<V> partition2) Construct a new instance of the algorithm.

Method Summary

Modifier and Type	Method and Description
MatchingAlgorithm.Matching<V,E>	getMatching() Compute a matching for a given graph.

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.jgrapht.alg.interfaces.MatchingAlgorithm

computeMatching

Constructor Detail

MaximumWeightBipartiteMatching

public MaximumWeightBipartiteMatching(Graph<V,E> graph,
                                      Set<V> partition1,
                                      Set<V> partition2)

Construct a new instance of the algorithm. Supported graphs are simple undirected weighted bipartite with positive integer edge weights.

Parameters:

graph - the input graph

partition1 - the first partition of the vertex set

partition2 - the second partition of the vertex set

Throws:

IllegalArgumentException - if the graph is not undirected

Method Detail

getMatching

public MatchingAlgorithm.Matching<V,E> getMatching()

Compute a matching for a given graph.

Specified by:

getMatching in interface MatchingAlgorithm<V,E>

Returns:

a matching