Cod sursa(job #2487701)
Utilizator | Farcas Vlad Alin vlad198 | Data | 5 noiembrie 2019 18:05:11 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <vector>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
#define NMAX 100005
vector<int> v[NMAX];
bitset<NMAX>viz;
void dfs(int x)
{
viz[x]=1;
for(int i=0;i<v[x].size();i++)
if(!viz[v[x][i]])
dfs(v[x][i]);
}
int n,m,x,y,k;
int main()
{
fin>>n>>m;
for(int i=1; i<=m; i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!viz[i])
{
k++;
dfs(i);
}
fout<<k;
return 0;
}