Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
Average Path Length
Clone this wiki locally
The average graph-distance between all pairs of nodes.
Connected nodes have graph distance 1. The diameter is the longest graph distance between any two nodes in the network. (i.e. How far apart are the two most distant nodes). Two measures derive from the distance: Betweenness Centrality and Closeness Centrality.
This code was implemented by Patrick McSweeney.
Ulrik Brandes (2001). A faster algorithm for betweenness centrality
- Albert, R., and Barabasi, A.-L. (2002) Statistical mechanics of complex networks. Review of Modern Physics 74:47-97. PDF
- Newman, M.E.J. (2003) The structure and function of complex networks. SIAM Review 45:167-256. PDF