Mai intai trebuie sa te autentifici.
Diferente pentru ciorna intre reviziile #41 si #40
Nu exista diferente intre titluri.
Diferente intre continut:
h4. Parcurgeri
* 'DFS':problema/dfs, 'BFS':problema/bfs ** Probleme: 'grarb':problema/grarb, 'sate':problema/sate, 'cifre4':problema/cifre4, 'berarii2':problema/berarii2 ** 'Meet in the middle BFS':http://hsin.hr/coci/archive/2009_2010/contest2_tasks.pdf *** Probleme: 'cifre4':problema/cifre4, ** Lex BFS * 'Ciclu eulerian':problema/ciclueuler ** Probleme: 'cartite':problema/cartite, 'tester':problema/tester, 'domino':problema/domino ** 'Teorema BEST':https://en.wikipedia.org/wiki/BEST_theorem * 'Componente biconexe':problema/biconex ** Probleme: 'ro':problema/ro, 'santa':problema/santa, 'pamant':problema/pamant, 'clepsidra':problema/clepsidra * 'Componente tare-conexe':problema/ctc ** Probleme: 'retele':problema/retele, 'drum4':problema/drum4, 'plimbare':problema/plimbare, 'drumuri5':problema/drumuri5 ** '2-SAT':problema/2sat *** Probleme: 'aladdin':problema/aladdin * 'Sortare topologica':problema/sortaret ** Probleme: 'volum':problema/volum * Dominator Tree ** Probleme: 'colonii':problema/colonii
** 'DFS':problema/dfs, 'BFS':problema/bfs *** Probleme: 'grarb':problema/grarb, 'sate':problema/sate, 'cifre4':problema/cifre4, 'berarii2':problema/berarii2 *** 'Meet in the middle BFS':http://hsin.hr/coci/archive/2009_2010/contest2_tasks.pdf **** Probleme: 'cifre4':problema/cifre4, *** Lex BFS ** 'Ciclu eulerian':problema/ciclueuler *** Probleme: 'cartite':problema/cartite, 'tester':problema/tester, 'domino':problema/domino *** 'Teorema BEST':https://en.wikipedia.org/wiki/BEST_theorem ** 'Componente biconexe':problema/biconex *** Probleme: 'ro':problema/ro, 'santa':problema/santa, 'pamant':problema/pamant, 'clepsidra':problema/clepsidra ** 'Componente tare-conexe':problema/ctc *** Probleme: 'retele':problema/retele, 'drum4':problema/drum4, 'plimbare':problema/plimbare, 'drumuri5':problema/drumuri5 *** '2-SAT':problema/2sat **** Probleme: 'aladdin':problema/aladdin ** 'Sortare topologica':problema/sortaret *** Probleme: 'volum':problema/volum ** Dominator Tree *** Probleme: 'colonii':problema/colonii
h4. Drumuri minime
* 'Dijkstra':problema/dijkstra ** Probleme: 'distante':problema/distante, 'trilant':problema/trilant, 'camionas':problema/camionas ** 'Dijkstra cu costuri mici':https://l.facebook.com/l.php?u=https%3A%2F%2Focw.mit.edu%2Fcourses%2Fsloan-school-of-management%2F15-082j-network-optimization-fall-2010%2Fanimations%2FMIT15_082JF10_av07.pdf&h=ATM4v55YxO4dnrKbNOFkLksGWpk-W4n594-5r-IWRABFSdQJw9jtTrCoaiPSVc9ntWo5e58nQK8X_8Rw8fQy7rA8HRZwYcDOIHiFJJh_QvihqET4b_SOAgP59fR_Bjx5fcVtkUU *** Probleme: 'car':problema/car ** Meet in the middle Dijkstra *** Probleme: 'nolife':problema/nolife * 'Bellman-Ford':problema/bellmanford ** Probleme: 'zmeu2':problema/zmeu2, 'dmin':problema/dmin, 'lanterna':problema/lanterna, 'ciclu':problema/ciclu ** Sistem de inegalitati *** Probleme: 'import':problema/import * 'Roy-Floyd':problema/royfloyd ** Probleme: 'coach':problema/coach, 'rfinv':problema/rfinv 'rf':problema/rf * 'Ciclu de cost mediu minim':ciclu-de-cost-mediu-minim
** 'Dijkstra':problema/dijkstra *** Probleme: 'distante':problema/distante, 'trilant':problema/trilant, 'camionas':problema/camionas *** 'Dijkstra cu costuri mici':https://l.facebook.com/l.php?u=https%3A%2F%2Focw.mit.edu%2Fcourses%2Fsloan-school-of-management%2F15-082j-network-optimization-fall-2010%2Fanimations%2FMIT15_082JF10_av07.pdf&h=ATM4v55YxO4dnrKbNOFkLksGWpk-W4n594-5r-IWRABFSdQJw9jtTrCoaiPSVc9ntWo5e58nQK8X_8Rw8fQy7rA8HRZwYcDOIHiFJJh_QvihqET4b_SOAgP59fR_Bjx5fcVtkUU **** Probleme: 'car':problema/car *** Meet in the middle Dijkstra **** Probleme: 'nolife':problema/nolife ** 'Bellman-Ford':problema/bellmanford *** Probleme: 'zmeu2':problema/zmeu2, 'dmin':problema/dmin, 'lanterna':problema/lanterna, 'ciclu':problema/ciclu *** Sistem de inegalitati **** Probleme: 'import':problema/import ** 'Roy-Floyd':problema/royfloyd *** Probleme: 'coach':problema/coach, 'rfinv':problema/rfinv 'rf':problema/rf ** 'Ciclu de cost mediu minim':ciclu-de-cost-mediu-minim
* Colorare