Cod sursa(job #2167400)

Utilizator pigwingsAntohi Vasile pigwings Data 13 martie 2018 21:31:35
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include<fstream>
#include<vector>
#include<stack>
#define nn 100005
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int>m[nn];
stack<int>st;
int n,m1,s,i,viz[nn];
void BF(int x)
{ int y;
    st.push(x);
    viz[x]=0;
   while(!st.empty())
   {
       y=st.top();
       st.pop();
       vector<int>::iterator it;
       for(it=m[y].begin();it!=m[y].end();it++)
       if(viz[*it]==-1){
        st.push(*it);
        viz[*it]=viz[y]+1;
       }

   }

}

int main()
{f>>n>>m1>>s;
for(i=1;i<=n;i++)
    viz[i]=-1;
int x,y;
for(i=1;i<=m1;i++)
{
    f>>x>>y;
    m[x].push_back(y);
}
    BF(s);
    for(i=1;i<=n;i++)
        g<<viz[i]<<" ";
}