I am trying to find whether a path from starting node to ending node exists in a graph using DFS, and it's leading to a time-out. In my opinion, using DFS for this is not a good idea. Should this exercise be moved to the BFS section?