遍历所有节点的迭代延长伪代码

Question

使用迭代延长深度优先方法来遍历图中所有节点的算法，伪代码或实际代码是什么？

Answer 1

我给你第一次深度优先伪码图

DLS(node, goal, depth, visited) 
{ 
    if (depth >= 0) 
    { 
    if (node == goal) 
     return node 

    visited.insert(node) 

    for each child in expand(node) 
     if (child is not in visited) 
      DLS(child, goal, depth-1, visited) 
    } 
} 

和迭代DLS是

IDDFS(start, goal) 
{ 
    depth = 0 
    while(no solution) 
    { 
    visited = [] // <-- Empty List 
    solution = DLS(start, goal, depth,visited) 
    depth = depth + 1 
    } 
    return solution 
} 

你总是可以通过去除图形循环变换一个图形在树上一个访问列表。 :)