This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Programming assignment 2.2:  Implement the Floyd-Warshall All-pairs-shortest path algorithm for directed weighted graph that may have negative weights. Run it for the following three input graphs: All positive weights: (a, b, 3), (a, c, 8), (a, e, 4), (b, d, 1), (b, e, 7), (c, b, 4), (d, c, 5), (d, a, 2), (e, d, 6) Some negative weights but no negative cycle: (a, b, 3), (a, c, 8), (a, e, -4), (b, d, 1), (b, e, 7), (c, b, 4), (d, c, -5), (d, a, 2), (e, d, 6) Negative cycle may exist: (a, b, 3), (a, c, 8), (a, e, -4), (b, d, 1), (b, e, 7), (c, b, -4), (d, c, -5), (d, a, 2), (e, d, 6) Submission in hard copy: the commented source code, intermediate distance matrices for each run, and a short report. Complexity analysis is not necessary. Programming assignment 2.3:  Improve the algorithm to output a negative cycle for the third case if it exists. You may embed your code and report within that from the previous assignment....
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