Cod sursa(job #2529607)

Utilizator EltMenimTirisi Claudiu EltMenim Data 23 ianuarie 2020 18:12:25
Problema BFS - Parcurgere in latime Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include<fstream>
#include<vector>
#include<list>
using namespace std;
ifstream f("bfs.in");
ofstream o("bfs.out");

int vf, m, s;
list<int>*Adj;

void init(){
Adj=new list<int>[vf];
}

void addEdge(int x, int y){
Adj[x-1].push_back(y-1);
}

void bfs(int s){

list<int>::iterator i;
vector<int>dist(vf, -1);

list<int>q;
dist[s]=0;
q.push_back(s);

while(!q.empty()){
s=q.front();
q.pop_front();

for(i=Adj[s].begin();i!=Adj[s].end();i++){
if(dist[*i]==-1){
dist[*i]=dist[s]+1;
q.push_back(*i);
}
}

}

for(int i=0;i<vf;i++){
o<<dist[i]<<" ";
}

}

int main(){
int x, y;
f>>vf>>m>>s;

init();

for(int i=0;i<m;i++){
f>>x>>y;
addEdge(x, y);
}

bfs(s-1);

}