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 912 / 930 800
Shortest path 805 / 824 800
Finding the path 743 / 753 800
Path on binary matrix 651 / 671 800
Garden 591 / 610 800
Operations on number 583 / 626 900
Bipartite graph 510 / 536 900
Tom and Jerry 532 / 546 900
Festival 1 503 / 509 1000
Bamboo Forest of the Lost 328 / 564 1200
Radar 314 / 342 1200
Festival 2 287 / 314 1300
Go 212 / 226 1300
Escape from... dolls 227 / 242 1500
Long leg 192 / 236 1600
Lexicographically smallest path 174 / 204 1800
Graph coloring 109 / 143 1800