Some flies in the ointment
Associate costs with the edges
- we’re trying to hit a moving target
-
For all pairs (j, k), attempt to identify the shortest path / route from j to k.
- nodes performing the computation are distributed
- nodes may have inconsistent information