CS230 - Assignment 7

You are to implement Dijkstra’s shortest path algorithm in the language of your choice.

Your program should input a directed weighted graph, G, in some reasonable manner as well as the starting vertex s.  The output should be the shortest path from s to each of the other vertices.  In addition to producing the correct output, be sure your implementation time is O(|E|log|V|).

Test your program on the following graph and any others of your choosing.  For grading purposes you will need to demonstrate the operation of your algorithm to me and e-mail me your source code.  You will be graded on correctness, program efficiency, and clear and concise code.