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.
networkx.Graph) – An undirected graph for which to compute the average global efficiency.
The average global efficiency of the graph.
- Return type
Edge weights are ignored when computing the shortest path distances.