Cod sursa(job #436155)

Utilizator alexandru92alexandru alexandru92 Data 8 aprilie 2010 08:36:23
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
/* 
 * File:   main.cpp
 * Author: VirtualDemon
 *
 * Created on April 8, 2010, 8:27 AM
 */
#include <queue>
#include <cstdlib>
#include <fstream>
#include <iterator>

/*
 * 
 */
using namespace std;
queue< int > Q;
vector< int > d;
vector< vector< int > > G;
vector< int >::const_iterator it, iend;
int main(int argc, char** argv)
 {
    int N, M, S, x, y;
    ifstream in( "bfs.in" );
    in>>N>>M>>S;
    G.resize(N);
    for( ; M; --M )
    {
        in>>x>>y;
        --x,--y;
        G[x].push_back(y);
    }
    d.resize(N);
    d.assign( N, -1 );
    for( d[S-1]=0, Q.push(S-1); !Q.empty();  )
    {
        x=Q.front(); Q.pop();
        for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
            if( -1 == d[*it] )
            {
                d[*it]=d[x]+1;
                Q.push(*it);
            }
    }
    ofstream out( "bfs.out" );
    copy( d.begin(), d.end(), ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}