| |
Methods defined here:
- back_edge(self, edge, graph)
- Invoked on the back edges of the depth-first tree, i.e., edges
back to the ancestors of a node.
- discover_vertex(self, vertex, graph)
- Invoked on a vertex when it is first "discovered" by the algorithm.
- examine_edge(self, edge, graph)
- Invoked on an edge as it is being examined.
- examine_vertex(self, vertex, graph)
- Invoked on a vertex just before its outgoing edges will be
examined.
- finish_vertex(self, vertex, graph)
- Invoked on a vertex after all of its outgoing edges have been
examined.
- forward_or_cross_edge(self, edge, graph)
- Invoked on forward or cross edges in the depth-first tree,
i.e., edges to vertices in the graph that have already been
completely handled.
- initialize_vertex(self, vertex, graph)
- Invoked on each vertex in the graph when the algorithm initializes it.
- start_vertex(self, vertex, graph)
- Invoked on the starting vertex just before the search begins.
- tree_edge(self, edge, graph)
- Invoked on an edge when it is determined that it is an edge in
the depth-first search tree.
|