Enter the number of nodes (should be a power of 2)
of the graph and the probability
of an edge. RANDOM GRAPH generates a random graph with
random floating point weights in range [0, 1]
and displays it. INITIAL GRAPH displays the initial graph as a matrix.
APSP computes the the all pair shortest paths (standard algorithm), it
is possible to select two nodes (they
become black) to get the plot of shortest path (in red) with weights
between these nodes. It is interesting to try the CHECKER before and after
computing the shortest paths. PRECISION is used to input the
error tolerance for the checker.
source file.