https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k 1. Ce este un graf? 2. Dați exemplu de graf. 3. Ce metode de reprezentare pentru grafuri cunoașteti? 4. Ce este un graf complet? 5. Cum pot fi parcurse grafurile? en-us 2021-01-11 20:38:42 UTC 2024-01-07 18:02:48 UTC hello@padlet.com sebastianbolohan97 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099754668 Un graf neorientat este o pereche ordonată de mulțimi (X,U) unde: 
X-este o multime finita si nevida de elemente numite noduri sau varfuri
U-este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:05:09 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099754668 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099755541 Un graf neorientat e o pereche ordonată de mulțimi (Y,V) unde 
Y e o multime finita si nevida de elemente numite noduri sau varfuri
V e o multime de perechi neordonate din Y numite muchii.]]> 2021-01-19 06:05:38 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099755541 denisaolaru277 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099755721 Un graf reprezintă o structură care corespunde unui grup de obiecte]]> 2021-01-19 06:05:44 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099755721 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099755758 2021-01-19 06:05:45 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099755758 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099756795 2021-01-19 06:06:16 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099756795 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099756943 Un graf neorientat este o pereche ordonata de multimi (X,U) unde:X-este o multime finita si nevida de elemente numite noduri sau varfuri
U-este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 06:06:21 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099756943 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099757637 2021-01-19 06:06:43 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099757637 nistoredu55 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099757651 Un graf neorientat este o pereche ordonată de mulțimi (X,U) unde: 
X-este o multime finita si nevida de elemente numite noduri sau varfuri
U-este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:06:43 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099757651 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099758143 Un graf neorientat este o pereche ordonată de mulțimi (X,U) unde: X-este o multime finita si nevida de elemente numite noduri sau varfuriU-este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:06:59 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099758143 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099758917 Un graf neorientate este o pereche ordonata de mulțimi (X, U), în care X este mulțimea nodurilor, iar U este mulțimea muchiilor. ]]> 2021-01-19 06:07:21 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099758917 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099759537 2021-01-19 06:07:38 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099759537 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099759558 Un graf este o structura ce contine noduri varfuri si muchii]]> 2021-01-19 06:07:38 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099759558 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099760582 2021-01-19 06:08:08 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099760582 dianapatricialorent https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099760695 2021-01-19 06:08:11 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099760695 andreeaionela2078 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761341 Un graf neorientat este o pereche ordonata de multimi (X,U) unde x-este o multime finita si nevida de elemente numite noduri sau varfuri ,u-este o multime de perechi neordonate din x numite muchii.]]> 2021-01-19 06:08:29 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761341 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761500 Un graf neorientat este o pereche ordonata de multimi(X,U) unde:X-este o multime finita si nevida de elemente numite noduri sau varfuri
U-este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 06:08:34 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761500 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761587 un graf neorientat este o pereche ordonata de multimi (X,U) unde X este o multime finita si nevida de elemente numite noduri sau varfuri U este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:08:37 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761587 bulai23091977iulian https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761853 Un graf neorientat este o pereche ordonata de multimi(X,U) unde:X este o multime nevida de elemente numite noduri sau varfuri
U este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 06:08:45 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761853 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761880 Se numește graf o pereche ordonată de mulțimi G=(X,U), unde:

• X este o mulțime finită și nevidă de elemente numite varfuri sau noduri;
• U este o mulțime finită de submulțimi cu două elemente din X, numite muchii.

]]> 2021-01-19 06:08:45 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099761880 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099762075 Un graf neorientat este o pereche ordonată de mulțimi (X,U) unde: 
X-este o multime finita si nevida de elemente numite noduri sau varfuri
U-este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:08:51 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099762075 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099763152 2021-01-19 06:09:22 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099763152 sebastianbolohan97 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099763243 2021-01-19 06:09:24 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099763243 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099763973 Un graf neorientat este o pereche ordonata de multimi (X,U) unde X este o multime finita si nevida de elemente numita noduri sau varfuri, U este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 06:09:47 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099763973 anaungureanu2003 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099764333 Un graf neorientat este o pereche ordonată de mulțimi (X,U) unde: X-este o multime finita si nevida de elemente numite noduri sau varfuri, U- este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:09:57 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099764333 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099764599 2021-01-19 06:10:06 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099764599 dianapatricialorent https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099764931 2021-01-19 06:10:15 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099764931 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765086 2021-01-19 06:10:19 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765086 denisaolaru277 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765226 Un graf neorientat este o pereche ordonata de multimi (X,U) unde X este o multime finita si nevida de elemente numita noduri sau varfuri, U este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 06:10:24 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765226 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765355 2021-01-19 06:10:28 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765355 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765571 Un graf neorientat este o pereche ordonata de multimi (x, u) in care x este multimea nodurilor, iar u este multimea muchiilor ]]> 2021-01-19 06:10:34 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765571 anaungureanu2003 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765718 2021-01-19 06:10:39 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099765718 sandu20321 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099766477 2021-01-19 06:11:00 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099766477 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099766896 Un graf neorientat este o pereche ordonata de multimi (X,U) unde X-este o multime finita si nevida de elemente numite noduri sau varfuri U-este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 06:11:13 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099766896 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099767068 2021-01-19 06:11:18 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099767068 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099767223 2021-01-19 06:11:23 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099767223 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099767922 2021-01-19 06:11:44 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099767922 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099768043 2021-01-19 06:11:48 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099768043 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099768302 2021-01-19 06:11:54 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099768302 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099771019 Un grad neorientat este o pereche ordonată de mulțimi (X,U) unde:  ●X este o mulțime finită si nevida de elemente numite noduri sau varfuri;● U este o mulțime de perechi neordonate din X numite muchii. ]]> 2021-01-19 06:13:13 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099771019 sandu20321 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099773714 2021-01-19 06:14:35 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099773714 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099774250 vectorul muchie
matricia list vecinilor]]> 2021-01-19 06:14:52 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099774250 sebastianbolohan97 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099774347 Matricea de adiacență
Matricea listele vecinilor
Vectorul de muchii]]> 2021-01-19 06:14:55 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099774347 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099774551 Un graf poate fi reprezentat prin:matricea de adiacenta,listele vecinilor,vectorul de muchii.]]> 2021-01-19 06:15:02 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099774551 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099775220 2021-01-19 06:15:22 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099775220 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099775558 2021-01-19 06:15:32 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099775558 denisaolaru277 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099776017 2021-01-19 06:15:46 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099776017 bulai23091977iulian https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099776544 2021-01-19 06:16:03 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099776544 dianapatricialorent https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099776947 2021-01-19 06:16:15 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099776947 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777299 Matricea de adiacenta
Matricea Listele vecinilor 
Vectorul muchie]]> 2021-01-19 06:16:26 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777299 anaungureanu2003 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777329 Matrice de adiacenta
Listele vecinilor 
Vectorul muchie ]]> 2021-01-19 06:16:27 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777329 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777336 Matricea de adiacenta
Vectorul muchie
Tabelul vecinilor]]> 2021-01-19 06:16:27 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777336 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777613 matricea de adiacenta
vectorul muchie
matricea listele vecinilor]]> 2021-01-19 06:16:35 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777613 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777622 Matricea de adiacență
Matricea listele vecinilor
Vectorul muchie]]> 2021-01-19 06:16:35 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099777622 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778325 Vectorul muchie
Matricea de adiacenta
Matricea listei vecinilor]]> 2021-01-19 06:16:54 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778325 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778435 Matricea de adiacenta
Vectorul muchie
Listele vecinilor]]> 2021-01-19 06:16:57 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778435 andreeaionela2078 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778436 2021-01-19 06:16:57 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778436 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778520 2021-01-19 06:16:59 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778520 bulai23091977iulian https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778617 Matricea de adiacenta
Listele vecinilor
Vectorul muchii]]> 2021-01-19 06:17:02 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778617 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778665 2021-01-19 06:17:03 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778665 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778725 2021-01-19 06:17:05 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099778725 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099779013 2021-01-19 06:17:13 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099779013 denisaolaru277 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099779290 Matricea de adiacență, listele vecinilor, vectorul muchie]]> 2021-01-19 06:17:22 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099779290 andreeaionela2078 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099779938 listele vecinilor 
vectorul muchie]]> 2021-01-19 06:17:40 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099779938 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099780375 Un graf neorientat este o pereche ordonată de mulțimi (X,U) unde: X-este o multime finita si nevida de elemente numite noduri sau varfuriU-este o multime de perechi neordonate din X numite muchii.]]> 2021-01-19 06:17:52 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099780375 nistoredu55 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099780562 Matricea de adiacenta
Vectorul muchie
Tabelul vecinilor]]> 2021-01-19 06:17:57 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099780562 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099780793 Matricea de adiacentă , listele vecinilor și vectorul muchie ]]> 2021-01-19 06:18:04 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099780793 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099781634 Un grad poate fi reprezentat de:matricea de adiacența, listele vecinilor,vectorul muchie.]]> 2021-01-19 06:18:29 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099781634 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099782250 2021-01-19 06:18:46 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099782250 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099782908 2021-01-19 06:19:05 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099782908 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783233 Graful neorientat este o pereche ordonată de mulțimi G=(X,U), unde X este o mulțime finită și nevidă de elemente numite vârfuri sau noduri, iar U este o mulțime finită de submulțimi cu două elemente din X, numite muchii.]]> 2021-01-19 06:19:14 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783233 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783247 2021-01-19 06:19:15 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783247 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783523 2021-01-19 06:19:23 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783523 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783949 Matricea de adiacenta 
Matricea listele vecinilor
Vectorul de muchii]]> 2021-01-19 06:19:35 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099783949 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099784350 vectorul muchie , matricia list vecinilor]]> 2021-01-19 06:19:45 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099784350 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099784589 2021-01-19 06:19:53 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099784589 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099784792 Matricea de adiacență
Matricea listele vecinilor
Vectorul de muchii

]]> 2021-01-19 06:19:59 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099784792 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099785369 Matricea de adiacență
Matricea listele vecinilor
Vectorul de muchii]]> 2021-01-19 06:20:15 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099785369 sandu20321 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099785933 2021-01-19 06:20:32 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099785933 andreeaionela2078 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786264 Un graf cu n noduri pentru care oricare doua noduri sunt adiacente si numeste graf complet cu n noduri si se noteaza Kn.]]> 2021-01-19 06:20:43 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786264 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786467 2021-01-19 06:20:50 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786467 bulai23091977iulian https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786626 Un graf complet este un graf neorientat simplu in care fiecare pereche de noduri distincte este conectata printr-o muchie unica]]> 2021-01-19 06:20:54 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786626 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786762 Un graf cu n noduri în care oricare 2 noduri sunt adiacente se numește graf complet ]]> 2021-01-19 06:20:58 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786762 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786776 2021-01-19 06:20:59 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099786776 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099787194 2021-01-19 06:21:12 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099787194 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099787535 2021-01-19 06:21:18 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099787535 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099787595 Un graf complet cu n noduri pt care oricare 2 noduri sunt adiacente=graf conplrt cu n noduri si se noteaxa K de n]]> 2021-01-19 06:21:20 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099787595 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788087 2021-01-19 06:21:32 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788087 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788187 2021-01-19 06:21:35 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788187 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788339 un graf complet este un graf neorientat simplu în care fiecare pereche de noduri distincte este conectată printr-o muchie unică.]]> 2021-01-19 06:21:40 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788339 sebastianbolohan97 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788383 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numeste graf complet cu n noduri si se noteaza Kn .]]> 2021-01-19 06:21:42 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788383 denisaolaru277 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788450 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numește graf complet]]> 2021-01-19 06:21:44 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788450 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788794 2021-01-19 06:21:53 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788794 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788830 Un graf cu n noduri pentru care oricare doua noduri sunt adiacente se numeste graf complet cu n noduri si se noteaza Kn]]> 2021-01-19 06:21:55 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788830 anaungureanu2003 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788987 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numeşte graf complet cu n noduri și se notează k.]]> 2021-01-19 06:21:59 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099788987 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789572 2021-01-19 06:22:16 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789572 dianapatricialorent https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789827 2021-01-19 06:22:23 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789827 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789978 un graf complet este un graf neorientat simplu in care fiecare pereche de noduri distincte este conectata printr-o muchie unica]]> 2021-01-19 06:22:28 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789978 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789984 2021-01-19 06:22:28 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099789984 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790062 2021-01-19 06:22:30 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790062 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790150 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numeste graf complet cu n noduri si se noteaza Kn .]]> 2021-01-19 06:22:33 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790150 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790341 Un graf complet este un graf neorientat in care oricare doua noduri sunt adiacente.]]> 2021-01-19 06:22:37 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790341 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790741 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numeste graf complet cu n noduri si se noteaza Kn .]]> 2021-01-19 06:22:46 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099790741 nistoredu55 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099791037 2021-01-19 06:22:55 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099791037 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099791758 Un graf poate fi parcurs în lățime (BF) și în adâncime(DF) ]]> 2021-01-19 06:23:17 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099791758 sandu20321 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792154 2021-01-19 06:23:26 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792154 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792258 2021-01-19 06:23:29 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792258 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792280 Un graf complet este un graf in care oricare doua noduri sunt adiacente]]> 2021-01-19 06:23:30 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792280 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792490 Parcurgerea in latime sau in adancime]]> 2021-01-19 06:23:36 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792490 anaungureanu2003 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792503 Parcurgere în lățime și adâncime ]]> 2021-01-19 06:23:36 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792503 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792736 2021-01-19 06:23:43 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792736 dianapatricialorent https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792863 2021-01-19 06:23:45 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099792863 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793053 2021-01-19 06:23:50 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793053 denisaolaru277 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793174 În lățime și în adâncime =)]]> 2021-01-19 06:23:53 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793174 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793324 Graful G(graf neorientat) se numește graf complet, daca oricare oricare doua vârfuri distincte ale sale sunt adiacente.]]> 2021-01-19 06:23:58 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793324 sebastianbolohan97 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793383 Grafurile pot fi parcurse în două moduri:
-Parcurgerea în lățime (BF)
-Parcurgerea în adâncime (DF)]]> 2021-01-19 06:23:59 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793383 andreeaionela2078 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793446 2021-01-19 06:24:02 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793446 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793590 2021-01-19 06:24:07 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793590 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793604 poate fi parcurs in latime si adancime]]> 2021-01-19 06:24:07 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793604 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793685 2021-01-19 06:24:09 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793685 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793883 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numeste graf complet cu n noduri si se noteaza Kn.

]]> 2021-01-19 06:24:15 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099793883 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794096 Un graf poate fi parcurs in latime (BF) si in adancime (DF)]]> 2021-01-19 06:24:21 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794096 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794204 Un graf poate fi parcurs in adancime(DF) si in latime(BF).]]> 2021-01-19 06:24:24 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794204 nistoredu55 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794608 2021-01-19 06:24:33 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794608 bulai23091977iulian https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794771 Parcurgerea in adancime
Parcurgerea in latime]]> 2021-01-19 06:24:35 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099794771 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099795199 Parcurgerea in latime(BF)
Parcurgerea in adancime (DF)]]> 2021-01-19 06:24:43 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099795199 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099795543 Un graf poate fi parcurs in latime sau adancime]]> 2021-01-19 06:24:53 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099795543 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099795709 Graf complet- graf in care  fiecare noduri sunt adiacente.]]> 2021-01-19 06:24:56 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099795709 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099796583 Parcurgere in lățime , adâncime ]]> 2021-01-19 06:25:17 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099796583 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099797478 2021-01-19 06:25:41 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099797478 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099797569 Parcurgerea în latime si adâncime.]]> 2021-01-19 06:25:44 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099797569 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099798313 Parcurgerea in lungime si in adancime]]> 2021-01-19 06:26:05 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099798313 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099798613 2021-01-19 06:26:11 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099798613 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099800136 Matricea de adiacenţă
Matricea listele vecinilor 
Vectorul de muchii]]> 2021-01-19 06:26:52 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099800136 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099805494 Un graf poate fi parcurs în adâncime(DF) și in lățime(BF) ]]> 2021-01-19 06:29:19 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099805494 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099824086 Un graf poate fi parcurs în lățime (BF) și în adâncime(DF)]]> 2021-01-19 06:37:33 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099824086 gold3nboy15 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099879988 Un graf neorientat este o pereche ordonata de multimi (X,U) unde:X-este o multime finita si nevida de elemente numite noduri sau varfuri
U-este o multime de perechi neordonate din X numite muchii]]> 2021-01-19 07:00:48 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099879988 gold3nboy15 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099889475 2021-01-19 07:04:41 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099889475 gold3nboy15 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099892605 Matricea de adiacență
Matricea listele vecinilor
Vectorul de muchii]]> 2021-01-19 07:05:46 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099892605 gold3nboy15 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099893765 Un graf cu n noduri pentru care oricare două noduri sunt adiacente se numeste graf complet cu n noduri si se noteaza Kn .]]> 2021-01-19 07:06:14 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099893765 gold3nboy15 https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099895643 Grafurile pot fi parcurse în două moduri
Parcurgerea în lățime (BF)
Parcurgerea în adâncime (DF)]]> 2021-01-19 07:06:58 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1099895643 emiliafeliciacosnita https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1100149795 2021-01-19 08:29:08 UTC https://padlet.com/emiliafeliciacosnita/r64b07rl2z8zx56k/wish/1100149795