Solution

• Topological Sort → Can be done using DFS (by finishing times). ✅

• Strongly Connected Components (SCCs) → Kosaraju’s and Tarjan’s algorithms use DFS. ✅

• Solving Maze Problem → DFS is a valid approach to explore paths in a maze. ✅

• Finding minimum distance in an unweighted graph → This requires Breadth First Search (BFS), not DFS, because BFS ensures the shortest path in an unweighted graph. ❌