Question

Consider the network shown below. Use Dijkstra's algorithm to find the shortest paths from node a to all other nodes. Enter your answers in the a shortest path answers in the following format: node-node-node. For example, if the ssignment link. Enter the shortest path from a to c is through node b, you would enter the answer as: a-b-c 3 5 6 6

Answer 1

A - b a - d a - d - c a - d - c - f a - d - g - i a - d - g -i- e a - d - g - i - e - h a - d - g - i - e - h - i