Cod sursa(job #2547169)
Utilizator | Alex Ilasi alexilasi | Data | 15 februarie 2020 09:01:15 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int nMax = 100010;
vector <int> v[nMax], prez;
void dfs(int nod)
{
prez[nod] = 1;
for(auto it : v[nod])
if(!prez[it])
dfs(it);
}
int main()
{
int n, m, ans = 0; fin >> n >> m;
prez.assign(n, 0);
for(int i=0; i<m; i++)
{
int x, y; fin >> x >> y; x--; y--;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=0; i<n; i++)
if(!prez[i])
{
ans++;
dfs(i);
}
fout << ans << '\n';
return 0;
}