Assignment: Given any connected, weighted graph G, use Dijkstras algorithm to compute the shortest (or smallest weight) path from any vertex a to any other vertex b in the graph G. You may print the results of this algorithm to the screen or to a log file. Your solution should be complete in that it shows the shortest path from all starting vertices to all other vertices. Complete the exercises below, then submit your code files and your exercise worksheet, and all supporting documents to Canvas before beginning the written portion of the final exam. You may use an external source as a reference for Dijkstras shortest path algorithms, please cite accordingly.
All applicants go through a series of tests that check their level of English and knowledge of formatting styles. The applicant is also required to present a sample of writing to the Evaluation Department. If you wish to find out more about the procedure, check out the whole process.