Shortest path problem. Given the following directed weighted graph, use Dijkstra algorithm find the shortest path from node a to every other node.

Draw the shortest path tree from the node a

Calculate the weight on every shortest path to node b, c, d, e, f

List all nodes in the order their path being discovered (the order they are included into the set S)

13