Home | Trees | Index | Help |
|
---|
Package NX :: Module paths |
|
Shortest path length, diameter, radius, eccentricity, and related methods.
Function Summary | |
---|---|
Center of graph. | |
Diameter of graph. | |
Eccentricity of node v. | |
Periphery of graph. | |
Radius of graph Minimum of all pairs shortest path. | |
Returns list of nodes in a shortest path between source and target (there might be more than one). | |
Shortest path length from source to target. |
Variable Summary | |
---|---|
str |
__author__ = 'Aric Hagberg (hagberg@lanl.gov)\nDan Schul...
|
str |
__credits__ = ''
|
str |
__date__ = '$Date: 2005/03/30 23:56:28 $'
|
str |
__revision__ = '$Revision: 1.29 $'
|
Function Details |
---|
center(G, e=None)Center of graph. Nodes with eccentricity equal to radius. |
diameter(G, e=None)Diameter of graph. Maximum of all pairs shortest path. |
eccentricity(G, v=None, sp=None, **kwds)Eccentricity of node v. Maximum of shortest paths to all other nodes. If kwds with_labels=True return dict of eccentricities keyed by vertex. |
periphery(G, e=None)Periphery of graph. Nodes with eccentricity equal to diameter. |
radius(G, e=None)Radius of graph Minimum of all pairs shortest path. |
shortest_path(G, source, target=None, cutoff=None)Returns list of nodes in a shortest path between source and target (there might be more than one). If no target is specified, returns dict of lists of paths from source to all nodes. Cutoff is a limit on the number of hops traversed. |
shortest_path_length(G, source, target=None)Shortest path length from source to target. |
Variable Details |
---|
__author__
|
__credits__
|
__date__
|
__revision__
|
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Mon Apr 11 10:59:20 2005 | http://epydoc.sf.net |