以C++的方式给我一个IDA*算法的伪代码

以下是一个简单的IDA*算法的伪代码：

function IDAstar(root, goal):
    bound = heuristic(root, goal)
    while true:
        t = search(root, 0, bound, goal)
        if t == FOUND:
            return FOUND
        if t == INF:
            return NOT_FOUND
        bound = t

function search(node, g, bound, goal):
    f = g + heuristic(node, goal)
    if f > bound:
        return f
    if node == goal:
        return FOUND
    mincost = INF
    foreach neighbor of node:
        t = search(neighbor, g + cost(node, neighbor), bound, goal)
        if t == FOUND:
            return FOUND
        if t < mincost:
            mincost = t
    return mincost

其中，`root`是起始节点，`goal`是目标节点，`heuristic`是启发式函数，`cost`是从一个节点到其相邻节点的代价。`FOUND`和`NOT_FOUND`是两个常量，分别表示找到目标节点和未找到目标节点。`INF`是一个无限大的值，用于表示无法到达目标节点。