Curs 8 - Drumuri de cost minim [pdf] - Andrei

Exemplu (3)
0
s
0
4
5
-1
1 2
0
1
4
10
13
0
3
-5
0
0
5
-4
Exemplu (4)
2/3
1
4
10
0/0
2
13
0
0/-4
3
0
2 0
0
5
2/-1
2
4
0/1
2/2
1
4
10
0/-1
2
13
0
0/-5
3
0
2 0
0
5
2/-2
2
4
0/0
2
2
0
4
0
0
Eliminam s
0/0
1
4
10
2/1
2
13
0
2/-3
3
0
Proiectarea Algoritmilor 2010
2
0
5
4
2
0/-4 2/4
Aplicam Dijkstra din fiecare nod (δ 1(u,v)).
Refacem distanțele:
d(u,v) = δ 1(u,v)+h(v)-h(u)
0 1 -3 4 -4
3 0 -4 1 -1
7 4 0 5 3
2 -1 -5 0 -2
8 5 1 6 0
Proiectarea Algoritmilor 2010
2/7
1
4
10
0/4
2
13
0
0/0
3
0
2 0
0
5
2/3
2
4
0/5
4/8
1
4
10
2/5
2
13
0
2/1
3
0
0
2 0
0
5
0/0
2
4
2/6
5/8/2010
22