Question: The network below shows 11 towns, A , B K . The number on each edge shows the time, in minutes, to travel between pair

The network below shows 11 towns, A , B K . The

The network below shows 11 towns, A, B K. The number on each edge shows the time, in minutes, to travel between pair of towns.

  1. Re-draw the network below, and using the Dijkstras algorithm, find the minimum time to travel from A to K. You need to show your working clearly on the diagram.
  2. On a different day, all roads connected to I are closed due to flooding. Find the minimum time to travel from A to K. State the route corresponding to this minimum time.

Subject:Data Structure & Alograthim

19 21 JE 20 G 16 19 21 JE 20 G 16

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!