Cod sursa(job #2074157)
| Utilizator | Data | 24 noiembrie 2017 09:51:01 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int N=100010;
vector <int> v[N];
int n,m,x,y,i,c,viz[N];
void dfs(int i);
int main()
{
fin>>n>>m;
for(;m;m--)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{
c++;
dfs(i);
}
fout<<c<<'\n';
return 0;
}
void dfs(int i)
{
viz[i]=1;
for(int j=0;j<v[i].size();j++)
if(!viz[v[i][j]]) dfs(v[i][j]);
}
