#include <iostream>
#include <queue>
using namespace std;
const int n = 6;
int i, j;
int GM[n][n] =
{
{0,1,1,0,0,0},
{1,0,1,1,0,0},
{1,1,0,1,1,1},
{0,1,1,0,1,0},
{0,0,1,1,0,1},
{0,0,1,0,1,0}
};

int main()
{
    setlocale(LC_ALL, "ukr");
    int len[n];
    int start,length;
    cout << "Старт >> "; 
    cin >> start;
    cout << "Відстань >> "; 
    cin >> length;
    cout << "Матриця суміжності графа: " << endl;

    for (i = 0; i < n; i++)
    {
        for (j = 0; j < n; j++)
            cout << " " << GM[i][j];
        cout << endl;
    }

    for (auto &it : len) 
    {
        it = -1;
    }

    len[start] = 0;
    queue<unsigned> q;
    q.push(start);

    while (!q.empty()) 
    {
        unsigned cur = q.front();
        q.pop();

        for (unsigned i = 0; i < n; i++) 
        {
            if ((GM[cur][i] == 1) && (len[i] == -1))
            {
                len[i] = len[cur] + 1;
                q.push(i);
            }
        }
    }

    cout << endl;
    for (int i = 0; i < n; i++)
    {
        cout << len[i] << " ";
    }

    cout << endl;
    for (unsigned i = 1; i <= n; i++) 
    {
        if (len[i] == length) 
        {
            cout << i << " ";
        }
    }
    cout << endl;
    return 0;
}