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 1093 / 1116 800
Shortest path 956 / 981 800
Finding the path 884 / 897 800
Path on binary matrix 775 / 797 800
Garden 692 / 714 800
Operations on number 706 / 749 900
Bipartite graph 608 / 637 900
Tom and Jerry 645 / 658 900
Festival 1 615 / 621 1000
Bamboo Forest of the Lost 423 / 666 1200
Radar 392 / 422 1200
Festival 2 365 / 392 1300
Go 277 / 290 1300
Escape from... dolls 292 / 305 1500
Long leg 245 / 293 1600
Lexicographically smallest path 219 / 252 1800
Graph coloring 150 / 198 1800