Cod sursa(job #2620816)
| Utilizator | Data | 29 mai 2020 18:22:39 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include<fstream>
#include <vector>
#define maxi 100010
using namespace std;
vector<int>L[maxi];
int N,M,viz[maxi];
void dfs(int nod)
{
viz[nod]=1;
for(auto i: L[nod])
if(viz[i]==0)
dfs(i);
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y;
f>>N>>M;
for(int i=1;i<=M;i++)
{
f>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
int nr=0;
for(int i=1;i<=N;i++)
if(viz[i]==0)
{
dfs(i);
nr++;
}
g<<nr;
return 0;
}
