Cod sursa(job #2212498)
Utilizator | Avram Rares Stefan avramrares | Data | 14 iunie 2018 12:12:05 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
vector < int > G[100004];
int sel[100003];
int cc;
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y,n,m;
void df(int x)
{
int i;
sel[x] = true;
for(i=0 ; i<G[x].size() ; i++)
{
if( !sel[G[x][i]] )
df(G[x][i]);
}
}
int main()
{
int i;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!sel[i])
{
cc++;
df(i);
}
}
g<<cc<<'\n';
return 0;
}