global_efficiency(G)
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 .
Edge weights are ignored when computing the shortest path distances.
An undirected graph for which to compute the average global efficiency.
The average global efficiency of the graph.
Returns the average global efficiency of the graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.efficiency_measures.local_efficiency
networkx.algorithms.efficiency_measures.efficiency
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them