Package networkx :: Module search_class :: Class Postorder

Class Postorder

object --+    
         |    
    Search --+
             |
            Postorder

Postorder visitor Builds a list of nodes in postorder of search. Returns a list of lists if the graph is not connected.

Instance Methods

[hide private]

__init__(self, G, queue=<class 'networkx.queues.DFS'>, **kwds)

source code

start_tree(self, v)
Visitor function called at the search start of each connected component.

source code

lastseen_vertex(self, v)
Visitor function called the last time a vertex is encountered.

source code

end_tree(self, v)
Visitor function called at the search end of each connected component.

source code

Inherited from Search: firstseen_edge, firstseen_vertex, lastseen_edge, search

Inherited from object: __delattr__, __getattribute__, __hash__, __new__, __reduce__, __reduce_ex__, __repr__, __setattr__, __str__

Properties

[hide private]

Inherited from object: __class__

Method Details

[hide private]

init(self, G, queue=<class 'networkx.queues.DFS'>, **kwds)
(Constructor)

source code

Overrides: Search.__init__

start_tree(self, v)

source code

Visitor function called at the search start of each connected component.

Overrides: Search.start_tree

lastseen_vertex(self, v)

source code

Visitor function called the last time a vertex is encountered.

Overrides: Search.lastseen_vertex

end_tree(self, v)

source code

Visitor function called at the search end of each connected component.

Overrides: Search.end_tree

Class Postorder

__init__(self, G, queue=<class 'networkx.queues.DFS'>, **kwds) (Constructor)

start_tree(self, v)

lastseen_vertex(self, v)

end_tree(self, v)

init(self, G, queue=<class 'networkx.queues.DFS'>, **kwds)
(Constructor)