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 662 / 678 800
Shortest path 596 / 610 800
Finding the path 535 / 545 800
Path on binary matrix 476 / 491 800
Garden 428 / 442 800
Operations on number 432 / 464 900
Bipartite graph 379 / 398 900
Tom and Jerry 388 / 402 900
Festival 1 361 / 367 1000
Bamboo Forest of the Lost 223 / 418 1200
Radar 225 / 247 1200
Festival 2 210 / 230 1300
Go 150 / 159 1300
Escape from... dolls 151 / 166 1500
Long leg 136 / 172 1600
Lexicographically smallest path 127 / 149 1800
Graph coloring 66 / 91 1800