Cod sursa(job #2002907)
Utilizator | Tenea Mihai rexlcd | Data | 21 iulie 2017 10:47:06 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector < int > v[100002];
int chk[100002];
void dfs(int node)
{
chk[node]=1;
for(int i=0;i<v[node].size();i++)
if(chk[v[node][i]]==0)
dfs(v[node][i]);
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m;
f>>n>>m;
for(int i=1;i<=n;i++)
{
int x,y; f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int k=0;
for(int i=1;i<=n;i++)
if(chk[i]==0)
{
dfs(i);
k++;
}
g<<k<<'\n';
f.close();
g.close();
return 0;
}