Cod sursa(job #3372000)

Utilizator ifrimdragosIfrim Dragos ifrimdragos Data 2 noiembrie 2026 06:57:53
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");


void dfs (int node , vector<vector<int>>nodesneighbors , vector<bool>& seen , int &conexcount)
{
    seen[node] = 1;
    int len = nodesneighbors[node].size();
    for(int i = 0 ; i < len;i++)
    {
        int neighbor = nodesneighbors[node][i];
        if(seen[neighbor] == 0)
        {
            dfs(neighbor , nodesneighbors , seen , conexcount);
        }
    }


}

int main()
{
    int n , m , conexcount = 0;
    fin >> n >> m;
    vector<vector<int>>nodesneighbors(n + 1);
    vector<bool>seen(n + 1);
    for(int i = 1; i <= m;i++)
    {
        int node , neighbor;
        fin >> node >> neighbor;
        nodesneighbors[node].push_back(neighbor);
        nodesneighbors[neighbor].push_back(node);

    }
    for(int i = 1 ; i <= n ;i++)
    {
        if (seen[i] == 0)
        {
        conexcount++;

        dfs(i , nodesneighbors , seen , conexcount);
        }


    }

    fout << conexcount;


    return 0;
}