Cod sursa(job #2888338)

Utilizator dulap16Berechet Tudor dulap16 Data 10 aprilie 2022 23:05:59
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include <iostream>
#include <fstream>
#include <vector>

#define NLIM 100005

using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");

int vizitat[NLIM];
vector<int> muchii[NLIM];

void dfs(int nod)
{
    vizitat[nod] = 1;

    for(unsigned int i = 0; i < muchii[nod].size(); i++)
        if(!vizitat[muchii[nod][i]])
            dfs(muchii[nod][i]);
}

int main()
{
    int n, m, a, b;
    f>>n>>m;
    for(int i = 0; i < m; i++)
    {
        f>>a>>b;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }

    unsigned int k = 0;
    for(int i = 1; i <= n; i++)
    {
        if(!vizitat[i])
        {
            k++;
            dfs(i);
        }
    }

    g<<k;
}