The following is a Yes/No question. In an undirected unweighted graph $G$, a longest path between two given vertices $s$ and $t$ can be found using Depth-first search?
If it is possible to use DFS to find such a path, show the algorithm.
My thoughts: My answer is Yes. I would solve it by brute force using backtracking, my DFS. And the class of the graph doesn't really matter here. Am I right?