Consider the shortest path problem shown in Figure 5. 13 (b) , except with C31 equal to 3. What is the least number of triple operations required in the Floyd-Warshall algorithm before the node pair distances dk[i,j] satisfy one of the negative cycle detection conditions?
