Pagini recente » Cod sursa (job #1666965) | Cod sursa (job #2464059) | Cod sursa (job #2677827) | Cod sursa (job #1281961) | Cod sursa (job #775139)
Cod sursa(job #775139)
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
#define NMAX 100010
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> a[NMAX];
int n,m,s,viz[NMAX];
void cit()
{
f>>n>>m>>s;
for(int i=1;i<=m;++i)
{
int x,y;
f>>x>>y;
a[x].push_back(y);
}
}
void afis()
{
vector<int> :: iterator it;
for(int i=1;i<=n;i++)
{
for(it=a[i].begin();it!=a[i].end();++it)
g<<*it<<' ';
g<<'\n';
}
}
void bfs(int s)
{
queue <int> q;
vector<int> :: iterator it;
q.push(s);viz[s]=1;
while(!q.empty())
{
int x=q.front();
q.pop();
for(it=a[x].begin();a[x].end()!=it;++it)
if(viz[*it]==0)
{
viz[*it]=viz[x]+1;
q.push(*it);
}
}
}
int main()
{
cit();
//afis();
bfs(2);
for(int i=1;i<=n;i++)
g<<viz[i]-1<<' ';
return 0;
}