#2822295 | Ioana Velniceru ioana2008v | Parcurgere DFS - componente conexe | Arhiva educationala | 66.29 kb | 23 dec 21 19:48:03 | Evaluare completa: 100 puncte |
#2822275 | Ioana Velniceru ioana2008v | Ciclu hamiltonian de cost minim | Arhiva educationala | 66.29 kb | 23 dec 21 19:33:32 | Evaluare completa: 100 puncte |
#2822269 | Ioana Velniceru ioana2008v | Floyd-Warshall/Roy-Floyd | Arhiva educationala | 66.29 kb | 23 dec 21 19:26:36 | Evaluare completa: 100 puncte |
#2822232 | Ioana Velniceru ioana2008v | Algoritmul lui Dijkstra | Arhiva educationala | 65.85 kb | 23 dec 21 18:44:48 | Evaluare completa: 90 puncte |
#2822190 | Ioana Velniceru ioana2008v | Ciclu Eulerian | Arhiva educationala | 65.75 kb | 23 dec 21 18:07:19 | Evaluare completa: 50 puncte |
#2817030 | Ioana Velniceru ioana2008v | Cuplaj maxim in graf bipartit | Arhiva educationala | 67.68 kb | 12 dec 21 18:33:36 | Evaluare completa: 100 puncte |
#2817026 | Ioana Velniceru ioana2008v | Ciclu hamiltonian de cost minim | Arhiva educationala | 67.68 kb | 12 dec 21 18:30:16 | Evaluare completa: 20 puncte |
#2817023 | Ioana Velniceru ioana2008v | Ciclu Eulerian | Arhiva educationala | 67.68 kb | 12 dec 21 18:27:58 | Evaluare completa: 30 puncte |
#2817020 | Ioana Velniceru ioana2008v | Diametrul unui arbore | Arhiva educationala | 67.68 kb | 12 dec 21 18:25:14 | Evaluare completa: 100 puncte |
#2817016 | Ioana Velniceru ioana2008v | Floyd-Warshall/Roy-Floyd | Arhiva educationala | 67.68 kb | 12 dec 21 18:22:15 | Evaluare completa: 50 puncte |
#2817007 | Ioana Velniceru ioana2008v | Flux maxim | Arhiva educationala | 67.68 kb | 12 dec 21 18:17:43 | Evaluare completa: 50 puncte |
#2807480 | Ioana Velniceru ioana2008v | Algoritmul Bellman-Ford | Arhiva educationala | 37.10 kb | 23 nov 21 20:47:09 | Evaluare completa: 15 puncte |
#2807474 | Ioana Velniceru ioana2008v | Algoritmul Bellman-Ford | Arhiva educationala | 36.89 kb | 23 nov 21 20:40:41 | Evaluare completa: 5 puncte |
#2807378 | Ioana Velniceru ioana2008v | Algoritmul Bellman-Ford | Arhiva educationala | 36.06 kb | 23 nov 21 18:43:29 | Evaluare completa: 35 puncte |
#2807371 | Ioana Velniceru ioana2008v | Algoritmul lui Dijkstra | Arhiva educationala | 36.06 kb | 23 nov 21 18:40:18 | Evaluare completa: 20 puncte |
#2807368 | Ioana Velniceru ioana2008v | Sortare topologica | Arhiva educationala | 36.06 kb | 23 nov 21 18:37:43 | Evaluare completa: 100 puncte |
#2806704 | Ioana Velniceru ioana2008v | Algoritmul Bellman-Ford | Arhiva educationala | 37.67 kb | 22 nov 21 21:59:14 | Evaluare completa: 40 puncte |
#2806697 | Ioana Velniceru ioana2008v | Algoritmul lui Dijkstra | Arhiva educationala | 37.67 kb | 22 nov 21 21:56:10 | Evaluare completa: 0 puncte |
#2806696 | Ioana Velniceru ioana2008v | Paduri de multimi disjuncte | Arhiva educationala | 37.68 kb | 22 nov 21 21:54:33 | Evaluare completa: 100 puncte |
#2806695 | Ioana Velniceru ioana2008v | Arbore partial de cost minim | Arhiva educationala | 37.67 kb | 22 nov 21 21:52:10 | Evaluare completa: 100 puncte |
#2806689 | Ioana Velniceru ioana2008v | Sortare topologica | Arhiva educationala | 37.67 kb | 22 nov 21 21:49:36 | Evaluare completa: 30 puncte |
#2806687 | Ioana Velniceru ioana2008v | Componente tare conexe | Arhiva educationala | 37.67 kb | 22 nov 21 21:47:33 | Evaluare completa: 100 puncte |
#2806683 | Ioana Velniceru ioana2008v | Componente biconexe | Arhiva educationala | 37.67 kb | 22 nov 21 21:45:57 | Evaluare completa: 100 puncte |
#2806680 | Ioana Velniceru ioana2008v | Parcurgere DFS - componente conexe | Arhiva educationala | 37.67 kb | 22 nov 21 21:44:22 | Evaluare completa: 100 puncte |
#2806675 | Ioana Velniceru ioana2008v | BFS - Parcurgere in latime | Arhiva educationala | 37.67 kb | 22 nov 21 21:41:52 | Evaluare completa: 100 puncte |