Cod sursa(job #2656532)
Utilizator | Andries Vlad Andrei vladad | Data | 7 octombrie 2020 22:05:36 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int>v[100001];
bool viz[100001];
int n, m, ans;
void dfs(int nod)
{
viz[nod]=1;
for(int i=0; i<v[nod].size(); i++)
if(!viz[v[nod][i]]) dfs(v[nod][i]);
}
int main()
{
f>>n>>m;
for(int i=1; i<=m; i++)
{
int x, y;
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; i++)
{
if(!viz[i])
dfs(i), ans++;
}
g<<ans;
return 0;
}