Documente Academic
Documente Profesional
Documente Cultură
Proiect Complemente
Matematice
Neghina George-Daniel
Marin Madalin-Claudiu
SEA 1
Contents
1.Scurt istoric...............................................................................................................................................3
2.Introducere...............................................................................................................................................4
2.1 Graf orientat......................................................................................................................................5
2.2 Graf neorientat..................................................................................................................................5
3.Notiuni teoretice......................................................................................................................................7
3.2 Etape Algoritm Ford...........................................................................................................................8
4.Exemplu practic......................................................................................................................................10
4.1 Cerinta.............................................................................................................................................10
1.Scurt istoric
ARC:-simplu orientat x y
-dublu orientat x y
-bucla
1) Iteratia I0
ℷi={0,i=S
{infinit,i≠S
Astfel daca:
-ℷj-ℷi > f(xi,xj)---valoarea ℷj se va inlocui cu ℷj=ℷi+ f(xi,xj)
2) Iteratia Ik(k≥1)
-- ℷj-ℷi=∞-∞
3) Testul de optimalitate
ℷj=ℷi+ f(xi,xj)=>STOP
4.1 Cerinta