Cod sursa(job #2107470)
Utilizator | Turcas David Emil DologX | Data | 17 ianuarie 2018 11:47:32 |
---|---|---|---|
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,x,y,nr;
vector<int> v[100005];
bool seen[100005];
void dfs(int k)
{
seen[k]=1;
for(int j=0;j<v[k].size();j++)
{
if(!seen[v[k][j]]) dfs(v[k][j]);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!seen[i])
{
nr++;
dfs(i);
}
}
g<<nr;
return 0;
}