Pagini recente » Cod sursa (job #2826339) | Cod sursa (job #2735558) | Cod sursa (job #1760187) | Cod sursa (job #604583) | Cod sursa (job #2529618)
#include<fstream>
#include<vector>
#include<list>
using namespace std;
ifstream f("bfs.in");
ofstream o("bfs.out");
int vf, m, s, x, y, i;
list<int>*Adj;
void init(){
Adj=new list<int>[vf];
}
void addEdge(){
Adj[x-1].push_back(y-1);
}
void bfs(){
list<int>::iterator j;
int dist[vf];
for(i=0;i<vf;i++) dist[i]=-1;
list<int>q;
dist[s]=0;
q.push_back(s);
while(!q.empty()){
s=q.front();
q.pop_front();
for(j=Adj[s].begin();j!=Adj[s].end();j++){
if(dist[*j]==-1){
dist[*j]=dist[s]+1;
q.push_back(*j);
}
}
}
for(int i=0;i<vf;i++){
o<<dist[i]<<" ";
}
}
int main(){
f>>vf>>m>>s;
init();
for(i=0;i<m;i++){
f>>x>>y;
addEdge();
}
s--;
bfs();
}