Cod sursa(job #2068324)
Utilizator | Panaete Adrian proflaurian | Data | 17 noiembrie 2017 16:33:16 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
const int N = 100010;
vector<int> v[N];
int n,m,x,y,i,c,viz[N];
void dfs(int);
int main()
{
f>>n>>m;
for(; m; m--)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1; i<=n; i++)
if(!viz[i])
{
c++;
dfs(i);
}
g<<c<<'\n';
return 0;
}
void dfs(int nod)
{
viz[nod]=1;
for(auto vec:v[nod])
if(!viz[vec])
dfs(vec);
}