|_. Problema|_. ==User(user = "the_snyper06")== |_. ==User(user = "mihaibogdan10")==|

| 'Floyd-Warshall/Roy-Floyd':http://infoarena.ro/problema/royfloyd !tema?task_solved.gif! |  |  |
| 'Algoritmul lui Dijkstra':http://infoarena.ro/problema/dijkstra ( N^2 si M log N cu heapuri sau arbori de intervale + cu stl ( 3 implementari) ) !tema?task_solved.gif! |  |  |
| 'Parcurgere in latime':http://infoarena.ro/problema/bfs !tema?task_solved.gif! |  |  |
| 'Parcurgere DFS - componente conexe':http://infoarena.ro/problema/dfs (recursiv si iterativ) !tema?task_solved.gif! |  |  |
| 'Paduri de multimi disjuncte':http://infoarena.ro/problema/disjoint |  |  |
| 'Componente biconexe':http://infoarena.ro/problema/biconex DF O(n) |  |  |
| 'Deque':http://infoarena.ro/problema/deque |  |  |
| 'Componente tare conexe':http://infoarena.ro/problema/ctc |  |  |
| 'Algoritmul Bellman-Ford':http://infoarena.ro/problema/bellmanford |  |  |
| 'Arbore partial de cost minim':http://infoarena.ro/problema/apm (Kruscal, Prim) |  |  |

| 'Floyd-Warshall/Roy-Floyd':http://infoarena.ro/problema/royfloyd | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Algoritmul lui Dijkstra':http://infoarena.ro/problema/dijkstra ( N^2 si M log N cu heapuri sau arbori de intervale + cu stl ( 3 implementari) ) !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Parcurgere in latime':http://infoarena.ro/problema/bfs !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Parcurgere DFS - componente conexe':http://infoarena.ro/problema/dfs (recursiv si iterativ) !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Paduri de multimi disjuncte':http://infoarena.ro/problema/disjoint | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Componente biconexe':http://infoarena.ro/problema/biconex DF O(n) | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Deque':http://infoarena.ro/problema/deque | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Componente tare conexe':http://infoarena.ro/problema/ctc | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Algoritmul Bellman-Ford':http://infoarena.ro/problema/bellmanford | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Arbore partial de cost minim':http://infoarena.ro/problema/apm (Kruscal, Prim) | !tema?task_solved.gif! | !tema?task_solved.gif! |