|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public static interface BreadthFirst.Visitor
| Method Summary | |
|---|---|
void |
blackTarget(int edge)
Invoked (in addition to non_tree_edge()) if the target vertex is colored black at the time of examination. |
void |
discoverVertex(int vertex)
Invoked the first time the algorithm encounters vertex u . |
void |
examineEdge(int edge)
Invoked on every out-edge of each vertex immediately after the vertex is removed from the queue. |
void |
examineVertex(int vertex)
Invoked in each vertex as it is removed from the queue |
void |
finishVertex(int vertex)
Invoked after all of the out edges of u have been examined and all of the adjacent vertices have been discovered. |
void |
greyTarget(int edge)
Invoked (in addition to non_tree_edge()) if the target vertex is colored grey at the time of examination. |
void |
initializeVertex(int vertex)
Invoked on every vertex before the start of the search. |
void |
nonTreeEdge(int edge)
Invoked (in addition to examine_edge()) if the edge is not a tree edge. |
void |
startVertex(int vertex)
Invoked on every vertex before the start of the search. |
void |
treeEdge(int edge)
Invoked (in addition to examine_edge()) if the edge is a tree edge. |
| Method Detail |
|---|
void initializeVertex(int vertex)
vertex - the Vertexvoid startVertex(int vertex)
vertex - the Vertexvoid discoverVertex(int vertex)
vertex - the Vertexvoid examineVertex(int vertex)
vertex - the Vertexvoid examineEdge(int edge)
edge - the Edgevoid treeEdge(int edge)
edge - the Edgevoid nonTreeEdge(int edge)
edge - the Edgevoid greyTarget(int edge)
edge - the Edgevoid blackTarget(int edge)
edge - the Edgevoid finishVertex(int vertex)
vertex - the Vertex
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||