Cod sursa(job #2345799)
Utilizator | Data | 16 februarie 2019 18:03:41 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[100002];
int n,m,a,b,nr;
bool viz[100002];
void DFS(int c)
{
viz[c]=1;
int aux = v[c].size();
for(int i=0;i<aux;++i)
{
if(!viz[v[c][i]])DFS(v[c][i]);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;++i)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;++i)
{
if(!viz[i])nr++,DFS(i);
}
g<<nr<<'\n';
return 0;
}