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 745 / 764 800
Shortest path 668 / 687 800
Finding the path 606 / 616 800
Path on binary matrix 539 / 554 800
Garden 489 / 503 800
Operations on number 488 / 524 900
Bipartite graph 422 / 445 900
Tom and Jerry 436 / 449 900
Festival 1 412 / 418 1000
Bamboo Forest of the Lost 266 / 468 1200
Radar 264 / 285 1200
Festival 2 247 / 271 1300
Go 172 / 182 1300
Escape from... dolls 182 / 197 1500
Long leg 164 / 204 1600
Lexicographically smallest path 154 / 179 1800
Graph coloring 89 / 115 1800