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 1235 / 1261 800
Shortest path 1088 / 1114 800
Finding the path 1001 / 1016 800
Path on binary matrix 870 / 895 800
Garden 783 / 807 800
Operations on number 806 / 849 900
Bipartite graph 694 / 728 900
Tom and Jerry 739 / 754 900
Festival 1 705 / 711 1000
Bamboo Forest of the Lost 500 / 754 1200
Radar 452 / 485 1200
Festival 2 422 / 450 1300
Go 322 / 335 1300
Escape from... dolls 341 / 356 1500
Long leg 292 / 341 1600
Lexicographically smallest path 254 / 291 1800
Graph coloring 182 / 232 1800