问迭代深化搜索应该有那么慢吗？

EN

class Cell
{
public:
    struct CellLink 
    {
        Cell *cell;
        int weight;
    };
public:
    int row;
    int column;
    vector<CellLink> neighbors;
    State state;
    int totalCost = 0;
};

    void AI::IterativeDeepeningSearch(Cell* cell)
        {
            Cell* temp;
            int bound = 0;


        while (true)
        {
            naturalFailure = false;
            temp = IDShelper(cell, bound);

            if (IsExit(temp))
            {
                break;
            }
            bound++;
        }   
    }

Cell* AI::IDShelper(Cell* cell, int bound)
{
    Cell* temp = cell;

    SetEnvironment(cell, State::visited);
    PrintEnvironment();

    if (bound > 0)
    {
        for (int i = 0; i < cell->neighbors.size(); i++)
        {
            temp = IDShelper(cell->neighbors[i].cell, bound - 1);
            if (IsExit(temp))
            {
                naturalFailure = true;
                return temp;
            }
        }
    }
    else if (IsExit(cell))
    {
        return cell;
    }
    return temp;
}