遍歷所有節點的迭代延長僞代碼

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 
} 

你總是可以通過去除圖形循環變換一個圖形在樹上一個訪問列表。 :)