This documents the development version of NetworkX. Documentation for the current release can be found here.
efficiency(G, u, v)¶
Returns the efficiency of a pair of nodes in a graph.
The efficiency of a pair of nodes is the multiplicative inverse of the shortest path distance between the nodes . Returns 0 if no path between nodes.
An undirected graph for which to compute the average local efficiency.
- u, vnode
Nodes in the graph
Multiplicative inverse of the shortest path distance between the nodes.
Edge weights are ignored when computing the shortest path distances.