Cod sursa(job #999166)

Utilizator emiemiEmi Necula emiemi Data 19 septembrie 2013 16:22:20
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int nr,n,i,m,x,y,uz[100001];
vector<int> a[100001];
void DFS(int x)
{
    int i;
    uz[x]=1;
    for(i=0;i<a[x].size();++i)
    if(!uz[a[x][i]])
    DFS(a[x][i]);
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;++i)
    {
        f>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    for(i=1;i<=n;++i)
    if(!uz[i])
    {
        ++nr;
        DFS(i);
    }
    g<<nr<<'\n';
    return 0;
}