org.quilt.graph
Interface Visitor

All Known Implementing Classes:

BytecodeCollector, GraphTalker

public interface Visitor

Methods for visiting a Quilt directed graph. Implementations can assume that a walk across the graph using Walker will touch every vertex and edge in the target graph and in every subgraph once and only once. Entry and exit points are in their graphs.

Author:

Jim Dixon

Method Summary

void	discoverEdge(Edge edge) Called when initially visiting edge.
void	discoverGraph(Directed graph) Called at beginning of visiting a graph or subgraph.
void	discoverVertex(Vertex vertex) Called when beginning visit to vertex.
void	finishEdge(Edge edge) Called at end of visit to edge.
void	finishGraph(Directed graph) Called at end of visiting a graph or subgraph.
void	finishVertex(Vertex vertex) Called at end of vertex visit.

Method Detail

discoverGraph

public void discoverGraph(Directed graph)

Called at beginning of visiting a graph or subgraph.

finishGraph

public void finishGraph(Directed graph)

Called at end of visiting a graph or subgraph.

discoverVertex

public void discoverVertex(Vertex vertex)

Called when beginning visit to vertex. If the vertex is the entry point for a subgraph, discoverGraph for that subgraph must be called during the visit.

finishVertex

public void finishVertex(Vertex vertex)

Called at end of vertex visit. If the vertex is an exit point for a subgraph, finishGraph for the subgraph must be called during the visit.

discoverEdge

public void discoverEdge(Edge edge)

Called when initially visiting edge.

finishEdge

public void finishEdge(Edge edge)

Called at end of visit to edge.