Doubt in algorithm

#1

In bfs all nodes at a particular level are visited first, so can’t we use bfs?

#2

Please specify your doubt more clearly. Where you cant use BFS. Bfs is used where we have to find the smallest or shortest thing in graph. and yes in BFS all nodes at a particular level are visited first.

#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.