Cod sursa(job #1811788)

Utilizator Dragos1998Dragos Radu Dragos1998 Data 21 noiembrie 2016 16:35:50
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <fstream>
using namespace std;
ifstream f("bfs.in"); ofstream g("bfs.out");
int n,m,x,a[101][101],viz[101],q[101];
int main()
{
    f>>n>>m>>x;
    for(int i=1; i<=m; i++)
    {
        int x,y; f>>x>>y;
        a[x][y]=a[y][x]=1;
    }
    int st,dr,y;
    q[1]=x; viz[x]=1; st=dr=1;
    while(st<=dr)
    {
        y=q[st];
        for(int j=1; j<=n; j++)
            if(a[y][j] and !viz[j])
            {
                viz[j]=1;
                q[++dr]=j;
            }
        st++;
    }
    for(int i=1; i<=dr; i++)
        g<<q[i]<<' ';
    return 0;
}