org.jacop.util

Class BipartiteGraphMatching

java.lang.Object

org.jacop.util.BipartiteGraphMatching

public class BipartiteGraphMatching
extends Object

Constructor Summary

Constructors

Constructor and Description
BipartiteGraphMatching(int[][] adj, int m, int n) Constructs data structure for Hopcroft Karp algorithm for maximum matching.
BipartiteGraphMatching(int m, int n) Constructs empty data structure for Hopcroft Karp algorithm for maximum matching edges can be added by addEdge method.

Method Summary

Modifier and Type	Method and Description
int	hopcroftKarp()

Methods inherited from class java.lang.Object

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

Constructor Detail

BipartiteGraphMatching

public BipartiteGraphMatching(int m,
                              int n)

Constructs empty data structure for Hopcroft Karp algorithm for maximum matching edges can be added by addEdge method.

Parameters:

m - m is number of vertices on left side (u)

n - n is a maximum number of vertices on right side (v)

BipartiteGraphMatching

public BipartiteGraphMatching(int[][] adj,
                              int m,
                              int n)

Constructs data structure for Hopcroft Karp algorithm for maximum matching.

Parameters:

adj - adjency matrix; adj stores adjacents vertices of vertex 'u'

m - m is number of vertices on left side (u)

n - n is a maximum number of vertices on right side (v)

Method Detail

hopcroftKarp

public int hopcroftKarp()