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 1198 / 1223 800
Shortest path 1053 / 1078 800
Finding the path 967 / 982 800
Path on binary matrix 842 / 867 800
Garden 760 / 782 800
Operations on number 775 / 818 900
Bipartite graph 667 / 699 900
Tom and Jerry 711 / 726 900
Festival 1 678 / 684 1000
Bamboo Forest of the Lost 478 / 729 1200
Radar 435 / 467 1200
Festival 2 402 / 430 1300
Go 304 / 317 1300
Escape from... dolls 320 / 335 1500
Long leg 275 / 323 1600
Lexicographically smallest path 240 / 276 1800
Graph coloring 171 / 219 1800