Cod sursa(job #2506593)
| Utilizator | Data | 8 decembrie 2019 14:42:01 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,i,x,y,nrg;
int viz[100005];
vector<int> v[100005];
void dfs(int nod)
{
for(int i=0;i<v[nod].size();i++)
{
if(!viz[v[nod][i]]==0)
{
viz[v[nod][i]]=1;
dfs(v[nod][i]);
}
}
}
int main()
{
fin>>n>>m;
for(i=0;i<m;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!viz[i])
{
viz[i]=1;
nrg++;
dfs(i);
}
}
fout<<nrg;
return 0;
}
