|
Algorithm Development Kit 1.0 |
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectalgs.model.network.DisjointPairs<A,B>
A - Type of object in set AB - Type of object in set Bpublic class DisjointPairs<A,B>
Helper class to record pairing information for the Maximum Matching problem.
Ensures that sets A and B are disjoint while they are being created.
Once the network is generated, no more pairings can be added.
| Constructor Summary | |
|---|---|
DisjointPairs()
|
|
| Method Summary | |
|---|---|
boolean |
add(A a,
B b)
Add a pairing (a,b) to the set. |
java.util.Iterator<EdgeInfo> |
getEdges()
Return an array-based implementation of FlowNetwork based upon information contained within the bipartite graph. |
int |
numVertices()
|
void |
output()
|
int |
sinkIndex()
|
int |
sourceIndex()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public DisjointPairs()
| Method Detail |
|---|
public boolean add(A a,
B b)
If element a is an element of B or b is an element of A then this throws an IllegalArgumnetException.
Attempts to add the same pairing (which already exists) have no effect and false is returned when such an attempt is detected.
a - b - public java.util.Iterator<EdgeInfo> getEdges()
public int sourceIndex()
public int sinkIndex()
public int numVertices()
public void output()
|
Algorithm Development Kit 1.0 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||