Ejercicio 2 - Dijkstra

Post on 12-Jan-2017

38 views 4 download

Transcript of Ejercicio 2 - Dijkstra

Leonardo Navarro23,903,871

ALGORITMO DE DIJKSTRA

A→B

A

F

E D

C

B

1

1

1

22

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)

A

F

E D

C

B

1

1

1

22

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)

A→C

A

F

E D

C

B

1

1

1

22

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)

A

F

E D

C

B

1

1

1

22

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)

A→D

A

F

E D

C

B

1

1

1

22

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)

A

F

E D

C

B

1

1

1

22

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)

A→E

El nodo ‘E’ no es accesible

A→F

A

F

E D

C

B

1

1

1

22

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)

A

F

E D

C

B

1

1

1

22

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)