why we can’t use dfs to find shortest path in unweighted graph?
Problem related with dfs traversal
By using bfs , you’ll find the shortest path in minimum time.
If you use dfs, then you’ll have to explore all paths and that would be a kind of bruteforce.