Pagini recente » Cod sursa (job #2547996) | Cod sursa (job #253961) | Cod sursa (job #2427496) | Cod sursa (job #467457) | Cod sursa (job #1622513)
#include<fstream>
#include<set>
#include<vector>
using namespace std;
int n,m,x[10002][10002],viz[10002],res,s;
ifstream f("bfs.in");
ofstream g ("bfs.out");
struct elem
{
int last;
set<int> inserted;
};
int mini(int x,int y)
{
if(x>y)
return y;
else return x;
}
int main()
{
f>>n>>m>>s;
int aux1,aux2;
for(int i=0;i<m;++i)
{
f>>aux1>>aux2;
x[aux1][aux2]=1;
x[aux2][aux1]=1;
}
vector<elem> coada1,coada2;
elem aux;
aux.last=s;
aux.inserted.insert(s);
coada1.push_back(aux);
for(int i=0;i<coada1.size();++i)
{
for(int j=1;j<=n;++j)
{
if(x[coada1[1].last][j])
{
aux1=coada2.size();
coada2.push_back(coada1[i]);
coada2[aux1].last=j;
coada2[aux1].inserted.insert(j);
if(viz[j]==0)
viz[j]=coada2[aux1].inserted.size()-1;
else
viz[j]=mini(viz[j],coada2[aux1].inserted.size()-1);
}
}
coada1=coada2;
coada2.clear();
}
for(int i=1;i<=n;++i)
{
g<<viz[i]<<" ";
}
return 0;
}