Cod sursa(job #2209383)

Utilizator ElektrykT E S L A P E F E L I E Elektryk Data 3 iunie 2018 11:02:38
Problema Parcurgere DFS - componente conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream in("dfs.in");
ofstream out("dfs.out");

int n, m, nod1, nod2, componenteConexe;
bool checked[100001];
vector <int> v[100001];

void dfs(int nod)
{
    checked[nod]=true;
    for(register int i=0; i<v[nod].size(); ++i)
        if( checked[v[nod][i]] == false )
            dfs(v[nod][i]);
}

int main()
{
    in>>n>>m;
    for(register int i=1; i<=m; ++i)
    {
        in>>nod1>>nod2;
        v[nod1].push_back(nod2);
        v[nod2].push_back(nod1);
    }
    for(register int i=1; i<=n; ++i)
        if( checked[i] == false )
            {
                dfs(i);
                componenteConexe++;
            }
    out<<componenteConexe;
    return 0;
}