|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
The interface that can receive single vertex shortest path events. The processing in an algorithm can be monitored by implementing this interface and calling setListener().
SingleVertexSumCostI| Method Summary | |
void |
beginPathTree(VertexI root,
boolean isToRoot)
Called before each path tree generation. |
void |
endPathTree(int pathCnt)
Called after each path tree generation. |
void |
initialize(GraphI graph,
SingleVertexI algorithm)
Called before any path generation. |
void |
updateVertexCost(VertexI from,
EdgeI edge,
VertexI to,
EdgeValueI values)
Called by the algorithm when a vertex is assigned a new cost. |
| Method Detail |
public void initialize(GraphI graph,
SingleVertexI algorithm)
public void beginPathTree(VertexI root,
boolean isToRoot)
public void updateVertexCost(VertexI from,
EdgeI edge,
VertexI to,
EdgeValueI values)
public void endPathTree(int pathCnt)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||