* Parcurgeri
** 'DFS':problema/dfs, 'BFS':problema/bfs
*** Probleme:

*** meet in the middle BFS

*** 'Meet in the middle BFS':http://hsin.hr/coci/archive/2009_2010/contest2_tasks.pdf

**** Probleme:

*** Lex BFS

** 'Ciclu eulerian':problema/ciclueuler
*** Probleme:

*** Teorema BEST

** 'Componente biconexe':problema/biconex
*** Probleme:
** 'Componente tare-conexe':problema/ctc

**** Probleme:
** 'Sortare topologica':problema/sortaret
*** Probleme:

** Dominator Tree

* Drumuri minime
** 'Dijkstra':problema/dijkstra
*** Probleme:

** 'Dijkstra cu costuri mici':http://www.ginfo.ro/revista/13_6/focus2.pdf
*** Probleme: 'car':problema/car
** A*
** 'Roy-Floyd':problema/royfloyd
*** Probleme:

*** Dial's method for small costs
*** 'Dijkstra cu costuri mici':http://www.ginfo.ro/revista/13_6/focus2.pdf
**** Probleme: 'car':problema/car

** 'Bellman-Ford':problema/bellmanford
*** Probleme:

** 'Roy-Floyd':problema/royfloyd
*** Probleme:
** SPFA

** Sistem de inegalitati
** 'Ciclu de cost mediu minim':ciclu-de-cost-mediu-minim

* Grafuri turneu/ciclu hamiltonian
** Probleme: 'plimbare':problema/plimbare

** Ciclu hamiltonian in grafuri cu conditia lui Ore
* Clica maxima
* Cactus graf
* Gomory-Hu Tree
* Pseudo-Forest

h3. Arbori
* 'Diametrul unui arbore':problema/darb
* 'Lowest Common Ancestor':problema/lca

** Probleme:
** Tarjan offline
** Schieber Vishkin
** Doubling

* 'Izomorfism de arbori':http://online-judge.uva.es/board/viewtopic.php?p=22754&highlight=#22754

** RNG Hash

* Smen 2 DFS-uri
** Probleme:
* 'Heavy path decomposition':problema/hpd

** Probleme:
* 'Taietura minima':taietura-minima
* 'Dinic':http://www.msri.org/about/computing/docs/magma/html/text1499.htm

* Push-relabel

* 'Flux maxim de cost minim':problema/fmcm
** Probleme:
* Flux cu capacitati inferioare

** Probleme:
* Suport minim
** Probleme:

* Jonker volgenant
* Algoritmul ungar
* Dilworth's theorem
* Konig's theorem
* Hall's marriage theorem
* Algoritmul lui Blossom
* Tutte Matrix

h3. 'APM':problema/apm

** Probleme:
* Al doilea APM
* APM in graf orientat

* Arborescenta
* APM de diametru minim
* APM cu grade restrictionate

* Kirchhoff's matrix tree theorem