Cod sursa(job #1998950)

Utilizator GeorgianBaditaBadita Marin-Georgian GeorgianBadita Data 9 iulie 2017 18:19:06
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <fstream>
using namespace std;
bool a[1000][1000];
int n ,viz[1000],v[1000];
int DF(int nod)
{
    int i;
    viz[nod]=1;
    for(i=1;i<=n;i++)
    if(a[nod][i]==1&&viz[i]==0)
    {
        v[i]=v[nod]+1;
        DF(i);
    }
}
int main()
{
    int i,m,s,l,c,ok,p,j;
    ifstream f ("bfs.in");
    ofstream g ("bfs.out");
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>l>>c;
        a[l][c]=1;
    }
    for(int i = 1; i<=n; i++)
        v[i] = -1;
    v[s] = 0;
    DF(s);

     for(i=1;i<=n;i++)
        g<<v[i]<<" ";

}