Pagini recente » Cod sursa (job #2273234) | Cod sursa (job #1721817) | Cod sursa (job #2571008) | Cod sursa (job #2174725) | Cod sursa (job #2425141)
#include <fstream>
#include <vector>
#include <set>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int main()
{
int n,m,x;
in>>n>>m>>x;
vector<vector<int>>G(n+1);
vector<int> viz(n+1,-1);
viz[x]=0;
for(int i=1;i<=m;i++)
{
int a,b;
in>>a>>b;
G[a].push_back(b);
}
for(int i=1;i<=n;i++)
{
for(auto j:G[i])
{
if(viz[j]==-1)
{
viz[j]=viz[i]+1;
}
}
}
for(int i=1;i<=n;i++)
{
out<<viz[i]<<" ";
}
}