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?
![61_e55f5c68-1ab6-4e97-9d17-b15ec29becee.png](https://secure.tutorsglobe.com/CMSImages/61_e55f5c68-1ab6-4e97-9d17-b15ec29becee.png)