Grafuri tratate matematic si informatic - Runceanu

More documents

Recommendations

Info

}adr = adr -> next;}}//afisez drumul pe care il parcurgi de la Start catre Finallong NPoz, Nod;if(Minim[ Final ] != INFI && Minim[ Final ]){printf("Costul minim al drumului este: %ld\n", Minim[ Final ]);printf("Drumul de cost minim este: ");Nod = Final;NPoz = 0;while(Father[ Nod ] != Final && Father[ Nod ] != 0){Complet[ ++NPoz ] = Nod;Nod = Father[ Nod ];}if(NPoz){printf("%ld -> ", Start);20
while(NPoz > 0){if(NPoz > 1) printf("%ld -> ", Complet[ NPoz ]);else printf("%ld\n", Complet[ NPoz ]);--NPoz;}}}elseprintf("Nu se poate ajunge de la nodul %ld la nodul %ld\n", Start,Final);}printf( "\n");int main(){/* Ecran de Start-UP*/VALID_UNU = 1;long St;int Optiune, OP;while(VALID_UNU){printf("\n\n\nPROIECT: Grafuri tratate matematic si informatic\n");printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\n");21
Page 1 and 2: Grafuri tratate matematicsi informa
Page 3 and 4: 1. Introducere in grafuri orientate
Page 5 and 6: Exemplu: Se consideră graful din f
Page 7: #include "stdafx.h"#include #includ
Page 10 and 11: };FILE *fin, *fout;long Heap[ NMAX
Page 12 and 13: void ReadSel2() //Citeste nodurile
Page 14 and 15: adr -> next = List[ X ];List[ X ] =
Page 16 and 17: void UpHeap(long p) ///urca un nod
Page 18 and 19: }void SolveFunction(long Start) //R
Page 22 and 23: printf("Alegeti una din optiunile d
Page 24: 6. Bibliografie1. Thomas H. Cormen,

Grafuri tratate matematic si informatic - Runceanu

Create successful ePaper yourself

Delete template?

Save as template?