Путь в графе_0

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

void BFS(const vector<vector<int>>& array,const int& start,int& end, vector<int>& output)
{
    queue<int> Q;

    vector<int> distance(array.size(), -1);
    vector<int> parent(array.size(),-2);
    parent[start-1] = -1;
    distance[start-1] = 0;
    Q.push(start-1);
    int vr;
    while(Q.size()) {
        vr=Q.front();
        Q.pop();
        for (int i = 0; i < array.size(); i++)
        {
            if (array[vr][i] == 1)
            {
                if (distance[i] == -1)
                {
                    Q.push(i);
                    parent[i]=vr;
                    distance[i] = distance[vr] + 1;
                }
                if(i == end-1)
                {
                    if(distance[i] == 0)
                    {
                        cout << distance[i];
                        exit(0);
                    }
                        cout << distance[i] << endl;
                        int j = end-1;
                        while(j != -1)
                        {
                            output.push_back(j);
                            j=parent[j];
                        }
                        end = 0;
                        return;
                }
            }
        }

    }
}

int main(){
    int32_t         lenght;
    int32_t         start;
    int32_t         end;


    cin >> lenght;

    vector<vector<int>>  array(lenght);
    for(int i =0; i < lenght; i++) {
        array[i].resize(lenght);
        for (int j = 0; j < lenght; ++j) {
            cin >> array[i][j];
        }
    }
    cin >> start >> end;
    vector<int> output;

    BFS(array,start,end,output);
    if(end == 0)
    {
        for (int i = output.size(); i > 0; i--) {
            cout << output[i - 1]+1 << " ";
        }
    }
    else
    {
        cout << -1;
    }
}