

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
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.
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 
public void discoverGraph(Directed graph)
public void finishGraph(Directed graph)
public void discoverVertex(Vertex vertex)
public void finishVertex(Vertex vertex)
public void discoverEdge(Edge edge)
public void finishEdge(Edge edge)


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 