Grafuri tratate matematic si informatic - Runceanu

More documents

Recommendations

Info

void UpHeap(long p) ///urca un nod cu o valoare mai mica de lapozitia curenta p, catre varful heapului{while( p > 1){if(Heap[ p / 2 ] > Heap[ p ]){swap( Heap[ p / 2 ], Heap[ p ] );swap( NodHeap[ p / 2 ], NodHeap[ p ]);swap( Poz[ NodHeap[ p / 2 ] ], Poz[ NodHeap[ p ] ]);p /=2;}else return;}}void DownHeap(long p) //coboara nodul din pozitia p a heapului,daca valoarea lui este mai mare decat fii sai{long P;while(p
maximif(P + 1
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 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?