algorithm - 遍历所有节点的迭代加长伪代码

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
}

您始终可以通过使用已访问列表 删除图循环来转换树中的图。 :)