This repository conteins my Python3 implementation of graph algorithm described in article "Simple and accurate analytical calculation of shortest path lengths" by S.Melnik and James P. Gleeson.
This work was an exercise project on the course CS-E5745 Mathematical Methods for Network Science in department of computer science at Aalto University, Finland. The code is available at Google Colaboratory and the project report.