Cod sursa(job #1837291)
| Utilizator | Data | 29 decembrie 2016 14:26:21 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,i,x,y,c;
bool used[100005];
vector <int> v[100005];
void DFS(int k)
{
used[k]=1;
for(auto & it : v[k])
{
if(!used[it])
{
DFS(it);
}
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!used[i])
{
c++;
DFS(i);
}
}
g<<c;
return 0;
}
