Grafuri tratate matematic si informatic - Runceanu

More documents

Recommendations

Info

};FILE *fin, *fout;long Heap[ NMAX ], NodHeap[ NMAX ], Poz[ NMAX ], Minim[ NMAX ],Father[ NMAX ], Complet[ NMAX ];long Nmax, N, M, Final;int VALID_UNU, VALID_DOI;Graph *List[ NMAX ];inline void swap(long &V1, long &V2) // Functie inline de inversare adoua valori in heap{}long t = V1;V1 = V2;V2 = t;void ReadSel1() //Citeste nodurile pentru cazul in care s-a alesgraful 1{fin = fopen("graf1.in", "r");long X, Y, Z;Graph *adr;10
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;adr -> cost = Z;adr -> next = List[ X ];List[ X ] = adr;}}}11
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 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 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?