Answer Happy

Question 1. Consider the following network: [20 marks H 2 2 1 B A 4 13 2 4 G 9 6 N C D 3 3 2 3 3 2. E E The number on each link represents the cost of using this link. In your answer sheet, draw down the network. Using Dijkstra's algorithm, compute the shortest path from Node E to all network nodes. If there is a tie, break it in favor of leftmost column. List the shortest paths from Node E to all the other nodes and specify their costs. Let D(v): cost of the least-cost path from source to destination v. • P(v): previous node (neighbour of v) along the current least-cost path • N: v is in N if the least-cost path from source to v is known. N D(A),P(A) D(B),P(B) D(C),P(C) D(D),P(D) D(F),P(F) D(G),P(G) D(H),P(H)