Cod sursa(job #2091728)
Utilizator | Data | 20 decembrie 2017 09:34:37 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector <int> v[100005];
int n,m;
int a,b,cnt;
int viz[100005];
void dfs(int nod)
{
viz[nod]=1;
for(auto i :v[nod])
if(!viz[i])
dfs(i);
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;++i)
{
in>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;++i)
if(!viz[i])
{
dfs(i);
++cnt;
}
out<<cnt;
return 0;
}