BFS vs DFS

When you want to find the shortest path in an unweighted graph When the graph has cycles and you want to avoid them When memory is extremely limited When you need to detect strongly connected components