1 / 8

TDA graf Implementare

TDA graf Implementare. Structuri de date şi algoritmi 2 -laborator- asist . drd. ing. Ciprian-Bogdan Chiril ă Universitatea “Ioan Slavici” Timi ş oara 2008-2009. Cuprins. Definitii Exemple Implementari matrice de adiacenta structuri de adiacenta. Definitii (1).

africa
Télécharger la présentation

TDA graf Implementare

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. TDA grafImplementare Structuri de date şi algoritmi 2 -laborator- asist. drd. ing. Ciprian-Bogdan Chirilă Universitatea “Ioan Slavici” Timişoara 2008-2009

  2. Cuprins • Definitii • Exemple • Implementari • matrice de adiacenta • structuri de adiacenta

  3. Definitii (1) • Graful este o colectie de arce si noduri. • Gradul unui nod este numarul de adiacente al acelui nod. • Gradul grafului este gradul maxim al nodurilor acelui graf.

  4. Definitii (2) • Drum de la nodul x la nodul y e o succesiune de noduri conectate prin arce : x, n1, n2, n3,..., y • Lungimea drumului fiind data de numarul de arce. • Ciclu e un drum cu acelasi nod initial si final.

  5. Defintii (3) • Graf conex daca toate perechile sale de noduri sunt conectate. • Graf complet de ordinul n contine arcuri î ntre toate perechile ce se pot forma cu cele n noduri (n*(n-1)/2 arce ). • Graf rar daca are relativ putine arce. • Graf dens daca e aproape complet. • Graf orientat daca arcele au sens precizat. • Graf ponderat daca arcelor sale li se asociaza câte o valoare.

  6. f e a b g c d Exemplu de graf

  7. f e a b g c d Implementare cu matrice de adiacenta

  8. f e a b g c d Implementare cu structuri de adiacenta

More Related