Description: cities are N, No. 0,1 ... N-1, every city path length between the two kept in a group median, if a [i] [j] i said cities and urban j length of the path. For a city to the other cities in the shortest path.
To Search:
File list (Check if you may need any files):
Download