Cod sursa(job #1806070)
| Utilizator | Data | 14 noiembrie 2016 20:02:09 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> v[100010];
int n,i,m,sol,x,y,viz[100010];
void df(int);
int main()
{
f>>n>>m;
for(m;m--;)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{
sol++;
df(i);
}
g<<sol;
return 0;
}
void df(int i)
{
viz[i]=1;
for(auto it:v[i])
if(!viz[it])
df(it);
}
