This repo creates a graph with (possible) smallest average shortest path length (ASPL).
- networkx
$ python3 topo-aspl.py <nnodes> <degree> [-i <iteration>] #default iteration is 1,000- This is the main program.
The generated topology (edge file) and output information are stored in the output/ folder.