问寻找指向最短路径的点的坐标

EN

int BFS(int mat[][COL], Point start, Point door)
{
    //Sprawdza start i wyjscie
    if (!mat[start.x][start.y] || !mat[door.x][door.y])
        return -1;

    bool visited[ROW][COL];
    memset(visited, false, sizeof visited);

    // Odwiedzone
    visited[start.x][start.y] = true;

    queue<queueNode> q;

    queueNode s = {start, 0};
    q.push(s);


    //
    while (!q.empty())
    {
        queueNode curr = q.front();
        Point pt = curr.pt;

        if (pt.x == door.x && pt.y == door.y)
            return curr.dist;
        q.pop();

        for (int i = 0; i < 4; i++)
        {
            int row = pt.x + rowNum[i];
            int col = pt.y + colNum[i];


            if (isValidCell(row, col) && mat[row][col] &&
                    !visited[row][col])
            {
                visited[row][col] = true;
                queueNode Adjcell = { {row, col},
                    curr.dist + 1
                };
                q.push(Adjcell);
            }
        }
    }


    return -1; //can't be reached
}

 cout<<row<<" "<<col;