Question

Ekle Tasarım Te Duzen 1. Determine the shortest route from node 1 (origin) to node 12 (destination) for the following network Distances are given along the network branches: 5 2 10 8 6 6 3 2 2 12 3 3 4 3 7 9 8 9 7 6 10

Answer 1

Answer:

In order to solve this problem using the Dijkstra algorithm, must follow some steps.

Step One:

Inserting data on the Dijkstra table according to edges and vertexes.

Step two:

Inserting labels according to the problem.

Step three:
On observing the table.

Finding the shortest path and distance from point A or 0 to J or 11Step Four:

D J 1 g 00, RoundA B C E F G H IK 10.-100,- . - , -, - 0.-09.-100, 00, 00,- 00,- 00,- 2 7. A2, A3, A00,- 100,- 4, A60, 00,- 00, 00, 00,- 3 6.CL 3. A 10.000,- 4.A00,- 14.000,- 4 6, C 10. C|0,- 4.A 14, D14, C|10.D.,- 15 16, CL 10. C|9G 10. G||14, C|10,D 0,- 16 8.B 9.G 10. G||14, C|10,D 0,- 7 9. G 10. G|14, C10, D60, - 18. E 10. G||14, C10,D 0, - 15. F 9 14, C|10.D, 15.F | 10 14. C 19. K 15. F 11 19. K15. F 18.J 00.- colla 12

Shortest path length is 18: 026-5-9-11 12 10 6 9 6 15 2 19 (11) 112 18 2 02 13 5 3 6 8 10) 3 11 110 7

It is clear that the shortest path is

Since point zero this table = point 1 of the problem and so on.

Then, 0⇒6⇒5⇒9⇒11 (according to the table)

Result:

Shortest Path= 1⇒7⇒6⇒10⇒12

Total distance is=18