# efficiency¶

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

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

Notes

Edge weights are ignored when computing the shortest path distances.

References

 [1] Latora, Vito, and Massimo Marchiori. “Efficient behavior of small-world networks.” Physical Review Letters 87.19 (2001): 198701.