1. procedure FloydWarshall (highway map G): foreach circle u in G do foreach circle v in G do Cost[u,v]  c(u,v) BestRoute[u,v]=u,v if line from u to v NULL otherwise foreach circle w in G do foreach circle u in G do foreach circle v in G do If Cost[u,w]+Cost[w,v] < Cost[u,v] BestRoute(u,v)  BestRoute(u,w), BestRoute(w,v) Cost[u,v]  Cost[u,w]+Cost[w,v]) Else No Change in route Floyd-Warshall Algorithm (original algorithm on p. 451 of our Lewis & Denenberg text)

2. 23456789 2 3 4 5 6 7 8 9

3. Floyd Warshall Fill in the table according the the start condition for Distance, Best Route For each W=2..9, optimize the routes through W. Keep track of Distance, Best Route