如何将此递归深度优先搜索转换为深度受限搜索？

Question

I've been trying to change this depth first search into a depth limited search but so far i haven't been able to figure out a way to do so. any ideas?

        // A function used by DFS 
void DFSUtil(int v,boolean visited[]) 
{ 
    // Mark the current node as visited and print it 
    visited[v] = true; 
    System.out.print(v+" "); 

    // Recur for all the vertices adjacent to this vertex 
    Iterator<Integer> i = adj[v].listIterator(); 
    while (i.hasNext()) 
    { 
        int n = i.next(); 
        if (!visited[n]) 
            DFSUtil(n, visited); 
    } 
} 

// The function to do DFS traversal. It uses recursive DFSUtil() 
void DFS(int v) 
{ 
    // Mark all the vertices as not visited(set as 
    // false by default in java) 
    boolean visited[] = new boolean[V]; 

    // Call the recursive helper function to print DFS traversal 
    DFSUtil(v, visited); 
} 

Answer 1

如果我DFSUtil正确，您想搜索到限制，那么您可以使用计数器并将DFSUtil函数中的限制与限制值进行比较。