All-pairs Shortest Path (ASP).

This program computes the shortest path between any two nodes of a given graph.

The program takes one argument: the number of rows (and columns) in the
distance table.

The argument has to be a number, which can be devided by the number of nodes.