Cod sursa(job #2117415)
Utilizator | Data | 28 ianuarie 2018 20:49:41 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m, i, x, y, nrcomp, viz[100005];
vector <int> g[100005];
void dfs(int nod)
{
viz[nod]=1;
for(auto it:g[nod])
if(!viz[it])
dfs(it);
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{
dfs(i);
nrcomp++;
}
fout<<nrcomp;
return 0;
}