CST-370 Week 8

 Dijkstra's Algorithm: Solves the problems of finding the shortest path from a single source. It is a Greedy algorithm. It dertermines the shortest path from a single source vertex to each of the other vertices.

Has wide applications such as:

    - Internet routing

    - GPS navigation

    - Transportation planning