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 1607 / 1638 800
Shortest path 1437 / 1467 800
Finding the path 1319 / 1338 800
Path on binary matrix 1161 / 1191 800
Garden 1046 / 1075 800
Operations on number 1053 / 1098 900
Bipartite graph 909 / 949 900
Tom and Jerry 977 / 995 900
Festival 1 927 / 933 1000
Bamboo Forest of the Lost 684 / 978 1200
Radar 595 / 635 1200
Festival 2 553 / 585 1300
Go 433 / 450 1300
Escape from... dolls 443 / 468 1500
Long leg 377 / 430 1600
Lexicographically smallest path 312 / 359 1800
Graph coloring 247 / 307 1800