Module BFS / DFS

BFS / DFS

Frequency: 10/10

One of the most important algorithms in graph theory.

Resources

- [Youtube Abdul Bari: 5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search](https://www.youtube.com/watch?v=pcKY4hjDrxk) - [Wikipedia: Depth-first search](https://en.wikipedia.org/wiki/Depth-first_search) - [Wikipedia: Breadth-first search](https://en.wikipedia.org/wiki/Breadth-first_search)

Problems

Connected component 598 / 612 800
Shortest path 535 / 548 800
Finding the path 474 / 485 800
Path on binary matrix 421 / 436 800
Garden 381 / 393 800
Operations on number 379 / 407 900
Bipartite graph 334 / 352 900
Tom and Jerry 347 / 361 900
Festival 1 320 / 326 1000
Bamboo Forest of the Lost 180 / 370 1200
Radar 205 / 223 1200
Festival 2 184 / 203 1300
Go 129 / 137 1300
Escape from... dolls 128 / 146 1500
Long leg 116 / 150 1600
Lexicographically smallest path 118 / 139 1800
Graph coloring 62 / 80 1800