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 879 / 896 800
Shortest path 769 / 787 800
Finding the path 706 / 716 800
Path on binary matrix 625 / 643 800
Garden 567 / 583 800
Operations on number 555 / 592 900
Bipartite graph 486 / 512 900
Tom and Jerry 504 / 517 900
Festival 1 474 / 481 1000
Bamboo Forest of the Lost 303 / 535 1200
Radar 295 / 319 1200
Festival 2 275 / 302 1300
Go 201 / 214 1300
Escape from... dolls 213 / 228 1500
Long leg 185 / 227 1600
Lexicographically smallest path 167 / 197 1800
Graph coloring 101 / 133 1800