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


Edge weights are ignored when computing the shortest path distances.


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