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 790 / 809 800
Shortest path 698 / 716 800
Finding the path 639 / 649 800
Path on binary matrix 574 / 590 800
Garden 514 / 528 800
Operations on number 509 / 545 900
Bipartite graph 442 / 464 900
Tom and Jerry 460 / 474 900
Festival 1 434 / 440 1000
Bamboo Forest of the Lost 279 / 491 1200
Radar 273 / 294 1200
Festival 2 257 / 284 1300
Go 185 / 198 1300
Escape from... dolls 194 / 209 1500
Long leg 172 / 212 1600
Lexicographically smallest path 161 / 186 1800
Graph coloring 93 / 119 1800