| org.quilt.graph.Visitor
All known Subclasses: org.quilt.cl.BytecodeCollector, org.quilt.cl.GraphTalker,
| Visitor | | public interface Visitor (Code) | | 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 |
| discoverEdge | | public void discoverEdge(Edge edge)(Code) | | Called when initially visiting edge.
|
| discoverGraph | | public void discoverGraph(Directed graph)(Code) | | Called at beginning of visiting a graph or subgraph.
|
| discoverVertex | | public void discoverVertex(Vertex vertex)(Code) | | 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.
|
| finishEdge | | public void finishEdge(Edge edge)(Code) | | Called at end of visit to edge.
|
| finishGraph | | public void finishGraph(Directed graph)(Code) | | Called at end of visiting a graph or subgraph.
|
| finishVertex | | public void finishVertex(Vertex vertex)(Code) | | 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.
|
|
|