1. Suppose that a network G contains no negative cycle. Let dn + I(i, j) denote the node pair distances at the end of the Floyd-Warshall algorithm. Show that min{dn+l[i, i] : 1 ≤ I ≤ n} is the minimum length of a directed cycle in G.
2. In this exercise we discuss another dynamic programming algorithm for solving the all
