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 1618 / 1649 800
Shortest path 1447 / 1477 800
Finding the path 1328 / 1348 800
Path on binary matrix 1168 / 1199 800
Garden 1050 / 1080 800
Operations on number 1057 / 1102 900
Bipartite graph 917 / 955 900
Tom and Jerry 985 / 1003 900
Festival 1 934 / 940 1000
Bamboo Forest of the Lost 688 / 985 1200
Radar 598 / 637 1200
Festival 2 558 / 590 1300
Go 439 / 455 1300
Escape from... dolls 447 / 472 1500
Long leg 380 / 433 1600
Lexicographically smallest path 314 / 363 1800
Graph coloring 250 / 310 1800