|
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.FlowNetwork<EdgeInfo[][]>
algs.model.network.FlowNetworkArray
algs.model.network.BipartiteMatchingMinCost
public class BipartiteMatchingMinCost
A graph represents provide nodes that are to be matched with an equal number of requirer nodes. Capacity for each edge is 1 and flow determines if match was selected. Enables the code to compute maxFlow/MinCost to operate immediately on Bipartite Matching problems.
| Field Summary |
|---|
| Fields inherited from class algs.model.network.FlowNetwork |
|---|
numVertices, sinkIndex, sourceIndex |
| Constructor Summary | |
|---|---|
BipartiteMatchingMinCost(DisjointPairs pr)
Construct a Bipartite Matching problem instance from the information contained within the DisjointPairs class. |
|
| Method Summary | |
|---|---|
void |
output()
Show the matching. |
| Methods inherited from class algs.model.network.FlowNetworkArray |
|---|
edge, getCost, getEdgeStructure, getFlow, getMinCut, populate, toString, validate |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public BipartiteMatchingMinCost(DisjointPairs pr)
pr - | Method Detail |
|---|
public void output()
|
Algorithm Development Kit 1.0 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||