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 1471 / 1502 800
Shortest path 1301 / 1333 800
Finding the path 1197 / 1216 800
Path on binary matrix 1049 / 1077 800
Garden 944 / 972 800
Operations on number 947 / 991 900
Bipartite graph 822 / 859 900
Tom and Jerry 874 / 891 900
Festival 1 825 / 831 1000
Bamboo Forest of the Lost 607 / 880 1200
Radar 524 / 564 1200
Festival 2 490 / 520 1300
Go 383 / 400 1300
Escape from... dolls 401 / 417 1500
Long leg 347 / 400 1600
Lexicographically smallest path 293 / 336 1800
Graph coloring 231 / 283 1800