Hamdy Taha

Ejercicio 6-3-4 Origen Destino Ruta

1 2 0
55-4
1 3 1
100-1
40-3 2 3 0
2 15 3 4 0
4
3 5 1
4 2 0
100 20 50 4 5 0
90-4
10 90-4 Z=

1 30 3 60 5

30-1

75-2
Distanc Nodo Flujo Signo Suministro
100 1 1 = 1
30 2 0 = 0
20 3 0 = 0
10 4 0 = 0
60 5 -1 = -1
15
50
90
Algoritmo de Dijkstra
Hamdy Taha
Figura 6-17
3-2

1-1 4
3
4-2 6-4
1 3
2-3
1
2 5
6
1 1

3
2 2 7

2 4
5 8

2-1 7-2

11-4
3-3
 9-4

5-5

5-3
Desde Hasta Ruta Dist. Nodos
6 1 2 0 2 1
1 3 1 1 2
2 3 0 1 3
2 2 4 0 5 4
2 5 0 2 5
3 4 0 2 6
5 8 3 5 0 1 7
3 6 1 4 8
7-6
4 5 0 3
6 16-7
4 6 0 6
4 7 0 8
7 5 6 0 3
5 7 0 7
6 7 0 5
9-5
6 8 1 2
11-4 10-6
7 8 0 6
Z= 7
Flujo Signo Suministro
1 = 1
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
-1 = -1