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 1481 / 1512 800
Shortest path 1308 / 1340 800
Finding the path 1204 / 1223 800
Path on binary matrix 1054 / 1081 800
Garden 950 / 979 800
Operations on number 954 / 999 900
Bipartite graph 827 / 864 900
Tom and Jerry 880 / 898 900
Festival 1 831 / 837 1000
Bamboo Forest of the Lost 610 / 885 1200
Radar 525 / 566 1200
Festival 2 491 / 521 1300
Go 385 / 402 1300
Escape from... dolls 402 / 418 1500
Long leg 349 / 402 1600
Lexicographically smallest path 294 / 337 1800
Graph coloring 231 / 283 1800