Grafuri tratate matematic si informatic - Runceanu

More documents

Recommendations

Info

adr -> next = List[ X ];List[ X ] = adr;}}void ReadSel4() //Citeste nodurile pentru cazul in care s-a alesoptiunea 4{char File[ 255 ];int MAXIM = 0;Graph *adr;long X, Y, Z;printf("Introdu numele fi<strong>si</strong>erului ce contine datele in formatulurmator:\nN M\nA1 B1 C1\nA2 B2 C2\n...\nAm Bm Cm\n\n");printf("unde N - numarul de noduri, M - numarul de muchii, A, B, C -exista o muchie de la A la B, avand costul C\n");printf("Numele: ");scanf("%s", &File);fin = fopen(File, "r");while(!fin){printf("Fi<strong>si</strong>erul introdus nu exista! Incercati din nou (%dincercari ramase) : ", 2 - MAXIM);scanf("%s", &File);++MAXIM;fin = fopen(File, "r");14
if(MAXIM == 3){VALID_UNU = 1;VALID_DOI = 1;};break;}fscanf(fin, "%ld", &N);fscanf(fin, "%ld", &M);for(long i = 1; i node = Y;adr -> cost = Z;adr -> next = List[ X ];List[ X ] = adr;}fclose(fin);}15
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 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

Create successful ePaper yourself

Delete template?

Save as template?