Posted by Xero on July 28, 1999 at 22:43:10:
In Reply to: hw13 posted by Will on July 28, 1999 at 22:37:07:
: I was wondering if this is correct:
: 1. All that is required to turn in is the array of weights.
No, we're supposed to turn in the intire table we used to calculate the shortest paths according to Floyd's Algorithm. But thankfully, we are not required to graph.
: 2. The distance between a node and itself is 0.
Yes.
: 3. The distance between two unconnected nodes is infinite.
Yes. Originally, in the "INITIAL" state, the only actual values we'd have in the table would be for the vertices which are actually adjacent (have only one edge between them). Their values would just be the weights of those edges. For all the OTHERS, where there is more than one edge between vertices, it would start out with INFINITY. But eventually, all those INFINITY values will get replaced in the algorithm.