The document demonstrates the Dijkstra's algorithm to find the shortest path between nodes in a graph. It runs the algorithm from node A to nodes B, C, D, E and F. It finds the shortest path from A to B, A to C, A to D and A to F. However, it shows that node E is not accessible from A. The document includes the graph with nodes and edges labeled with distances and updates made to the algorithm at each step.

1. Leonardo Navarro
23,903,871
ALGORITMO DE DIJKSTRA

2. A→B

3. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

4. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

5. A→C

6. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

7. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

8. A→D

9. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

10. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

11. A→E

12. El nodo ‘E’ no es accesible

13. A→F

14. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)

15. A
F
E D
C
B
1
1
1
2
2
3
3
35
[A,0](0)
[A,3](1)
[B,4](2)
[B,4](2)
[C,6](3)
[A,5](1)
[A,6](1)
[F,6](2)
[F,5](3)
6
[D,9](2)
[B,10](3)