Рет қаралды 30,779
Content Link: github.com/mos...
Content:
What is BFS? Basic Code
Trick for simpler code
Finding shortest path
Testing bipartiteness
Handling Many-1, Many-Many versions
Edge Split and Vertex Split tricks
Problems: UVA(571), CF242-D2-C, SPOJ(CHASE1, POUR1, CHMAZE, PPATH, ANARC08A, CATM, TOE1, TOE2, QUEEN, CERC07K, CLEANRBT, MLASERP)