Package networkx :: Module search_class :: Class Predecessor

Class Predecessor

object --+    
         |    
    Search --+
             |
            Predecessor

Predeceessor visitor Builds a dict of nodes with sucessor vertex list as data. path method returns path lengths from source to target.

Instance Methods

[hide private]

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

source code

firstseen_vertex(self, v)
Visitor function called the first time a vertex is encountered.

source code

lastseen_edge(self, e)
Visitor function called the last time an edge is encountered.

source code

path(self, target)
Gets one shortest path to target out of predecessor hash.

source code

Inherited from Search: end_tree, firstseen_edge, lastseen_vertex, search, start_tree

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__

firstseen_vertex(self, v)

source code

Visitor function called the first time a vertex is encountered.

Overrides: Search.firstseen_vertex

lastseen_edge(self, e)

source code

Visitor function called the last time an edge is encountered.

Overrides: Search.lastseen_edge

path(self, target)

source code

Gets one shortest path to target out of predecessor hash. There might be more than one

Class Predecessor

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

firstseen_vertex(self, v)

lastseen_edge(self, e)

path(self, target)

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