infovis.graph.algorithm
Interface DepthFirst.Visitor

All Known Implementing Classes:

DFSVisitor

Enclosing class:

DepthFirst

public static interface DepthFirst.Visitor

Method Summary

void	backEdge(int edge) Invoked on the back edges in the graph.
void	discoverVertex(int vertex) Invoked when a vertex is encountered for the first time.
void	examineEdge(int edge) Invoked on every out-edge of each vertex after it is discovered.
void	finishVertex(int vertex) Invoked on a vertex after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their out-edges have been examined).
void	forwardOrCrossEdge(int edge) Invoked on forward or cross edges in the graph.
void	initializeVertex(int vertex) invoked on every vertex of the graph before the start of the graph search.
void	startVertex(int vertex) invoked on the source vertex once before the start of the search.
void	treeEdge(int edge) Invoked on each edge as it becomes a member of the edges that form the search tree.

Method Detail

initializeVertex

void initializeVertex(int vertex)

invoked on every vertex of the graph before the start of the graph search.

Parameters:

vertex - the Vertex

startVertex

void startVertex(int vertex)

invoked on the source vertex once before the start of the search.

Parameters:

vertex - the Vertex

discoverVertex

void discoverVertex(int vertex)

Invoked when a vertex is encountered for the first time.

Parameters:

vertex - the Vertex

examineEdge

void examineEdge(int edge)

Invoked on every out-edge of each vertex after it is discovered.

Parameters:

edge - the Edge

treeEdge

void treeEdge(int edge)

Invoked on each edge as it becomes a member of the edges that form the search tree. If you wish to record predecessors, do so at this event point.

Parameters:

edge - the Edge

backEdge

void backEdge(int edge)

Invoked on the back edges in the graph.

Parameters:

edge - the Edge

forwardOrCrossEdge

void forwardOrCrossEdge(int edge)

Invoked on forward or cross edges in the graph. In an undirected graph this method is never called.

Parameters:

edge - the Edge

finishVertex

void finishVertex(int vertex)

Invoked on a vertex after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their out-edges have been examined).

Parameters:

vertex - the Vertex