h2(#asd). Algoritmi si Structuri de Date 'Arhiva Educationala':http://infoarena.ro/arhiva-educationala

|_. Problema|_. ==User(user = "the_snyper06")== |_. %{width: 40px} ==User(user = "mihaibogdan10")== %|
| 'Floyd-Warshall/Roy-Floyd':http://infoarena.ro/problema/royfloyd | !tema?task_solved.gif! | !tema?task_solved.gif! |

|_. Problema|_. ==User(user = "the_snyper06")== |_. ==User(user = "mihaibogdan10")==|
| 'Floyd-Warshall/Roy-Floyd':http://infoarena.ro/problema/royfloyd | !tema?task_solved.gif! | %{text-aline: center;} !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! |
| 'Parcurgere in latime':http://infoarena.ro/problema/bfs | !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! |