深度优先搜索算法

Question

I want to reach node Y of this tree but this code traversal whole tree. what changes should i do to achieve my goal? how to show traveled path at each step of traversal? I use depth first search. thanks for any help.

class Graph
{
int V;    // No. of vertices
list<int> *adj;    
void DFSUtil(int v, bool visited[]);  
public:
Graph(int V);   
void addEdge(int v, int w);  
void DFS(int v);  
};
Graph::Graph(int V)
{
this->V = V;
adj = new list<int>[V];
}
void Graph::addEdge(int v, int w)
{
adj[v].push_back(w); // Add w to v’s list.
}
 void Graph::DFSUtil(int v, bool visited[])
{
visited[v] = true;
cout << v << " ";
list<int>::iterator i;
for (i = adj[v].begin(); i != adj[v].end(); ++i)
    if (!visited[*i])
        DFSUtil(*i, visited);
}
void Graph::DFS(int v)
{
bool *visited = new bool[V];
for (int i = 0; i < V; i++)
    visited[i] = false;
DFSUtil(v, visited);
}
int main()
{
Graph g(25);
g.addEdge(0, 1);
g.addEdge(0, 2);
//...
return 0;
}

Answer 1

Graph :: DFSUtil应该返回一个“found”标志，以及到目前为止遍历的遍历节点列表，每次检测到“found == true”时都可以扩展。