Pagini recente » Cod sursa (job #284338) | Cod sursa (job #582195) | Cod sursa (job #2038600) | Cod sursa (job #708303) | Cod sursa (job #2827759)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int>v[100001];
queue<int>q;
int viz[100001];
int n,m,start;
void apel(int st)
{
viz[st]=1;
q.push(st);
while(!q.empty())
{
int k=q.front();
q.pop();
for(vector<int>::iterator it=v[k].begin();it<v[k].end();it++)
{
if(!viz[*it])
{
q.push(*it);
viz[*it]=viz[k]+1;
}
}
}
for(int i=1;i<=n;i++)
{
g<<viz[i]-1<<" ";
}
}
int main(){
f>>n>>m>>start;
int i,j;
for(int k=1;k<=m;k++)
{
f>>i>>j;
v[i].push_back(j);
}
apel(start);
}