CS12-LS#3-Term 2 - Week 5 - Day 4

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 1

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 2

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 3

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 4

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 4

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 5

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 4

• 2

• 3

• 5

• 8

• 9

Calculate the shortest distance between the base and each of the other towns in the diagram using Dijkstra’s algorithm. What is the Dijikstran Algorithm of Town 6

• 2

• 3

• 5

• 8

• 9