In 2011, I devised together with colleague Walter Kosters a new algorithm to efficiently compute the diameter (and radius, core and periphery) of small world networks. It has been available for reuse for a few years as part of the teexGraph package, and I am happy to see that this algorithm is now also part of the master branch of the latest version of NetworkX, an extensive and frequently used Python package for network analysis. Happy computing!