module documentation
Undocumented
Function  _degree 
Calculates the degree distribution of the graph. 
Function  _indegree 
Returns the indegrees in a list. 
Function  _outdegree 
Returns the outdegrees in a list. 
Function  _pagerank 
Calculates the PageRank values of a graph. 
Function  _shortest 
Deprecated alias to Graph.distances() . 
def _degree_distribution(graph, bin_width=1, *args, **kwds):
Calculates the degree distribution of the graph.
Unknown keyword arguments are directly passed to GraphBase.degree
.
Parameters  
graph  Undocumented 
bin  the bin width of the histogram 
*args  Undocumented 
**kwds  Undocumented 
Returns  
a histogram representing the degree distribution of the graph. 
def _indegree(graph, *args, **kwds):
Returns the indegrees in a list.
See GraphBase.degree
for possible arguments.
def _outdegree(graph, *args, **kwds):
Returns the outdegrees in a list.
See GraphBase.degree
for possible arguments.
def _pagerank(graph, vertices=None, directed=True, damping=0.85, weights=None, arpack_options=None, implementation='prpack'):
Calculates the PageRank values of a graph.
Parameters  
graph  Undocumented 
vertices  the indices of the vertices being queried. None means all of the vertices. 
directed  whether to consider directed paths. 
damping  the damping factor. 1 − damping is the PageRank value for nodes with no incoming links. It is also the probability of resetting the random walk to a uniform distribution in each step. 
weights  edge weights to be used. Can be a sequence or iterable or even an edge attribute name. 
arpack  an ARPACKOptions object used to finetune the ARPACK eigenvector calculation. If omitted, the modulelevel variable called arpack_options is used. This argument is ignored if not the ARPACK implementation is used, see the implementation argument. 
implementation  which implementation to use to solve the PageRank eigenproblem. Possible values are:

Returns  
a list with the PageRank values of the specified vertices. 