Pagini recente » Cod sursa (job #1123495) | Cod sursa (job #755565) | Cod sursa (job #518791) | Cod sursa (job #875174) | Cod sursa (job #2296996)
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100007
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int viz[NMAX],n,m,s;
queue <int> q;
vector <int> v[NMAX];
void BFS(int s)
{
int x,y;
q.push(s);
viz[s]=1;
while(!q.empty())
{
x=q.front();
q.pop();
for(int i=0;i<v[x].size();i++)
{
y=v[x][i];
if(viz[y]==0)
{
q.push(y);
viz[y]=viz[x]+1;
}
}
}
}
int main()
{
int i,x,y;
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
BFS(s);
for(i=1;i<=n;i++)
{
g<<viz[i]-1<<" ";
}
return 0;
}