Grafuri tratate matematic si informatic - Runceanu

More documents

Recommendations

Info

void ReadSel2() //Citeste nodurile pentru cazul in care s-a alesgraful 2{fin = fopen("graf2.in", "r");long X, Y, Z;Graph *adr;if(!fin){printf("Fi<strong>si</strong>erul necesar nu exista! Program incheiat!\n");VALID_DOI = 0;VALID_UNU = 0;}else{fscanf(fin, "%ld", &N);fscanf(fin, "%ld", &M);for(long i = 1; i node = Y;12
adr -> cost = Z;adr -> next = List[ X ];List[ X ] = adr;}}}void ReadSel3() //Citeste nodurile pentru cazul in care s-a alesoptiunea 3{printf("Numarul de noduri: ");scanf("%ld", &N);printf("\nNumarul de muchii: ");scanf("%ld", &M);printf("\nIntroduceti muchiile in formatul A B C (A - nod de ie<strong>si</strong>re,B - nod de intrare, C - costul muchiei ) \n");long X, Y, Z;Graph *adr;for(long i = 1; i node = Y;adr -> cost = Z;13
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 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 20 and 21: }adr = adr -> next;}}//afisez drumu
Page 22 and 23: printf("Alegeti una din optiunile d
Page 24: 6. Bibliografie1. Thomas H. Cormen,

Grafuri tratate matematic si informatic - Runceanu

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?