Unformatted text preview: k value. Run it on the following directed weighted graph. (a, b, 3), (a, c, 8), (a, e, 4), (b, d, 1), (b, e, 7), (c, b, 4), (d, a, 2), (d, c, 5), (e, d, 6) Trace back the shortest path from the node a to the node d using the final Pi matrix (by hand). Run your program again on the graph: (a, b, 3), (a, c, 8), (a, e, 4), (b, d, 1), (b, e, 7), (c, b, 4), (d, a, 2), (d, c, 7), (e, d, 6) Can your program be modified to detect (1) that there exists a negative cycle, and (2) where is that negative cycle?...
View
Full
Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
 Spring '12
 Dmitra
 Algorithms, C Programming

Click to edit the document details