Preorder visitor
Builds a list of nodes in preorder of search.
Returns a list of lists if the graph is not connected.
| Method Summary |
| |
__init__(self,
G,
queue,
**kwds)
|
| |
end_tree(self,
v)
Visitor function called at the search end
of each connected component. |
| |
firstseen_vertex(self,
v)
Visitor function called the first time a vertex is encountered. |
| |
start_tree(self,
v)
Visitor function called at the search start
of each connected component. |
Inherited from Search:
firstseen_edge,
lastseen_edge,
lastseen_vertex,
search
Inherited from object:
__delattr__,
__getattribute__,
__hash__,
__new__,
__reduce__,
__reduce_ex__,
__repr__,
__setattr__,
__str__
|