networkx.algorithms.efficiency¶

networkx.algorithms.efficiency(G, u, v)[source]¶

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 [R664].

Parameters:	G : networkx.Graph An undirected graph for which to compute the average local efficiency. u, v : node Nodes in the graph G.
Returns:	float Multiplicative inverse of the shortest path distance between the nodes.

See also

local_efficiency, global_efficiency

Notes

Edge weights are ignored when computing the shortest path distances.

References

[R664]

(1, 2) Latora, Vito, and Massimo Marchiori. “Efficient behavior of small-world networks.” Physical Review Letters 87.19 (2001): 198701. <http://dx.doi.org/10.1103/PhysRevLett.87.198701>