Pagini recente » Cod sursa (job #503197) | Cod sursa (job #2780021) | Cod sursa (job #2123350) | Cod sursa (job #3002046) | Cod sursa (job #3271818)
//
// Created by riges on 1/27/2025.
//
#include <bits/stdc++.h>
using namespace std;
int C[100001][100001];
//Citire Matrice
void Citire(int &n, int &m, int &s, int d[], int c[][100001]) {
int u, v;
cin >> n >> m >> s;
for(int j = 0; j < m ; j++)
{
cin >> u >> v;
c[u][v] = 1;
}
for(int i = 1; i <= n; i++)
d[i] = -1;
}
void BFS(int x, int n, int viz[], int tata[], int d[], int c[][100001]) {
queue<int> coada;
viz[x] = 1;
tata[x] = -1;
d[x] = 0;
coada.push(x);
while(!coada.empty()) {
int curent = coada.front();
coada.pop();
for(int y = 0; y < n * n; y++)
if(c[curent][y] && !viz[y])
{
viz[y] = 1;
tata[y] = curent;
d[y] = d[curent] + 1;
coada.push(y);
}
}
}
//Afisare matrice
void Afisare(int n, int c[][100001]) {
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
cout << c[i][j] << " ";
cout << "\n";
}
}
int main() {
int viz[100001];
int tata[100001];
int d[100001];
int n, m, s;
Citire(n, m, s, d, C);
BFS(s, n, viz, tata, d, C);
for(int i = 1; i <= n ; i++)
cout << d[i] << " ";
}