Consider the shortest path problem given in Figure 5.10(a) with the modification that the length of arc (4, 5) is -15 instead of - 5. Verify that the network contains a negative cycle. Apply the dequeue implementation of the label-correcting algorithm; after every three distance updates, check whether the predecessor graph contains a directed cycle. How many distance updates did you perform before detecting a negative cycle?
