Solve for question 1

Using Dijkstra's algorithm, find the shortest paths from node d to all other nodes in the transportation network shown below Consider the traffic network shown in Question . 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 Travel Demand (veh/h 100 50 Pair of Nodes 120 20 40 30 180 By using Floyd's algorithm find the shortest paths between all pairs of nodes in the transportation network shown below