Cod sursa(job #2193133)
| Utilizator | Data | 8 aprilie 2018 22:39:01 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int>v[100005];
int n,m;
int a[100005];
void Dfs(int x)
{
a[x]=1;
for(int i=0;i<v[x].size();i++)
{
if(a[v[x][i]]==0)
Dfs(v[x][i]);
}
}
int main()
{
int x,y,nr=0;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(a[i]==0)
{
Dfs(i);
nr++;
}
fout<<nr<<"\n";
return 0;
}
