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 530 / 544 800
Shortest path 471 / 482 800
Finding the path 415 / 425 800
Path on binary matrix 366 / 375 800
Garden 333 / 344 800
Operations on number 326 / 353 900
Bipartite graph 290 / 306 900
Tom and Jerry 308 / 322 900
Festival 1 286 / 291 1000
Bamboo Forest of the Lost 152 / 338 1200
Radar 179 / 196 1200
Festival 2 158 / 179 1300
Go 105 / 113 1300
Escape from... dolls 112 / 125 1500
Long leg 103 / 136 1600
Lexicographically smallest path 103 / 121 1800
Graph coloring 55 / 67 1800