Cod sursa(job #2678456)
Utilizator | Miroiu Rares rareshinnho | Data | 28 noiembrie 2020 12:59:32 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[100005];
int n,m,s,x,y;
bool viz[100005];
void dfs(int nod)
{
int i;
viz[nod]=1;
for(i=0; i<v[nod].size(); i++)
{
if(!viz[v[nod][i]])
dfs(v[nod][i]);
}
}
int main()
{
int i;
f>>n>>m;
for(i=1; i<=m; i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int cnt=0;
for(i=1; i<=n; i++)
{
if(!viz[i])
{
cnt++;
dfs(i);
}
}
g<<cnt;
return 0;
}