|
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.Search
algs.model.network.ShortestPathArray
public class ShortestPathArray
Encapsulate algorithm by which the augmenting path for a Minimal Cost, Maximal Flow network is found.
Use priority queue.
Field Summary |
---|
Fields inherited from class algs.model.network.Search |
---|
BACKWARD, FORWARD, numVertices |
Constructor Summary | |
---|---|
ShortestPathArray(FlowNetwork<EdgeInfo[][]> network)
|
Method Summary | |
---|---|
boolean |
findAugmentingPath(VertexInfo[] vertices)
Determine whether an augmenting path was found. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ShortestPathArray(FlowNetwork<EdgeInfo[][]> network)
Search.Search(FlowNetwork)
Method Detail |
---|
public boolean findAugmentingPath(VertexInfo[] vertices)
findAugmentingPath
in class Search
vertices
- initially an empty array of Vertex Info; afterwards, contains the
path which can be determined by traversing backwards from the sink index.
Search.findAugmentingPath(VertexInfo[])
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |