Cod sursa(job #3183662)

Utilizator RiU0754Rares Ioan Ultimescu RiU0754 Data 12 decembrie 2023 17:41:19
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("BFS.in");
ofstream fout("BFS.out");
int n,m,z,i,j,a[100][100],viz[100],c[100],x,y;
void bfs(int x)
{
    int i,p,u,k;
    p=u=1;
    c[p]=x;
    viz[x]=1;
    while(p<=u)
    {
        k=c[p];
        for(i=1;i<=n;i++)
            if(viz[i]==0&&a[i][k]==1)
            {
                c[++u]=i;
                viz[i]=1;
            }
        p++;
    }
    for(i=1;i<=u;i++)
        fout<<c[i]<<" ";
}
int main()
{
    fin>>n>>m>>x;
    for(i=1;i<n;i++)
    {
        for(j=1;j<=n;j++)
        {
            a[i][j]=0;
        }
    }
    for(i=1;i<=m;i++)
    {
        fin>>z>>y;
        a[z][y]=1;
        a[y][z]=1;
    }
    bfs(x);
    return 0;
}