#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.algorithms.efficiency_measures.global_efficiency

global_efficiency(G)

Returns the average global efficiency of the graph.

The efficiency of a pair of nodes in a graph is the multiplicative inverse of the shortest path distance between the nodes. The average global efficiency of a graph is the average efficiency of all pairs of nodes 1.

Parameters

G (networkx.Graph) – An undirected graph for which to compute the average global efficiency.

Returns

The average global efficiency of the graph.

Return type

float

Notes

Edge weights are ignored when computing the shortest path distances.

See also

local_efficiency()

References

1

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