如何从递归算法转换为迭代算法

Question

如何将以下recursive算法转换为iterative

DFS-Visit(U)
    color[u] = GREY 
    d[u]  =time
    time = time + 1
    for each v = Adj[u] do 
        if color[v] = WHITE
            then p[v] = u
                DFS-Visit(v)
    color[u] = BLACK
    f[u] = time
    time = time + 1

Answer 1

USE堆栈保存状态而不是递归调用它

这可能会对您有所帮助：http://www.cs.mcgill.ca/~pnguyen/251F09/DFS.pdf