Solve for question 2

Using Dijkstra's algorithm, find the shortest paths from node d to all other nodes in the transportation network shown below 2 5 Question 2 Consider the traffic network shown in Question 1. The travel demands between node d and all other nodes are given in Table below. Assume the travelers always travel along shortest paths only. Calculate the link flow in each link in the network Pair of Nodes db Travel Demand (veh/h 100 120 130 50 60 180