Applications of both search techniques

#1

please prateek bhaiya kindly tell me the applications and example probles of competitive platforms where these searches can be used as a major part.

#2

Application of BFS

Shortest path and minimum spaning tree for unweighted graph
Cycle detection in indirect graph
Ford-fulkerson algorithms

Application of DFS
Path finding
Topological sort
To test if graph is bipartite
Finding connected components

There are many problems
infact 90% questions include bfs and DFS directly or indirectly.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.