文章标题

vector<Point> DFS(Point& s,Point& e,Point maze[][MaxSize],vector<Point> path,int bound)
{
    for(...)
    {
        for(...)
    }
    //初始结点放入OPEN表，判是否为解
    open.push (s);
    int flag=0,b=0;
    while(!open.empty ()&&(flag!=1))
    {
        //取当前队头
        //检查是否达到深度界限
        if(b>bound)break;
        //计算相邻结点
        for(int i=0;i<4;i++)
        {
            b++;
            neighbor=n+add[i];
            int t=isValid(n,neighbor);
            if(neighbor==e)
            {
                visited[neighbor.x][neighbor.y]=n;
                visited[neighbor.x][neighbor.y].op.p =t;
                flag=1;
                break;//找到解，跳出循环
            }
        //判断结点是否合法并且未访问过
        //判断是否合法即判断n能否到neighbor
            if(t!=-1&&visited[neighbor.x][neighbor.y]==Point())
            {
                open.push (maze[neighbor.x ][neighbor.y ]);
                visited[neighbor.x][neighbor.y]=n;
                visited[neighbor.x][neighbor.y].op.p =t;
            }
        }
    }
    //形成path
    ......
    return path;
}