Sppose that a network g contains no negative cycle let dn

Question

1. Suppose that a network G contains no negative cycle. Let d^{n + I}(i, j) denote the node pair distances at the end of the Floyd-Warshall algorithm. Show that min{d^n+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