Pagini recente » Borderou de evaluare (job #1289041) | Borderou de evaluare (job #2054680) | Borderou de evaluare (job #1098439) | Borderou de evaluare (job #2682321) | Cod sursa (job #3245782)
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100100
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;
vector<int> G[NMAX];
queue<int> C;
int viz[NMAX];
void citire();
void BFS(int start);
int main()
{
int i;
citire();
BFS(s);
for(i=1; i<=n; i++)
fout<<viz[i]-1<<' ';
return 0;
}
void citire()
{
int i,x,y;
fin>>n>>m>>s;
for(i=1; i<=m; i++)
{
fin>>x>>y;
G[x].push_back(y);
}
}
void BFS(int start)
{
int i,u;
viz[start]=1;
C.push(start);
while(!C.empty())
{
u=C.front();
C.pop();
for(i=0; i<G[u].size(); i++)
if(!viz[G[u][i]])
{
viz[G[u][i]]=viz[u]+1;
C.push(G[u][i]);
}
}
}