Cod sursa(job #1650955)
Utilizator | Minzat Robert RobertM | Data | 11 martie 2016 22:08:00 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 60 |
Compilator | cpp | 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> a[100002];
int viz[100002],n,m,nr;
void cit(){
f>>n>>m;
int x,y;
for(int i=1;i<=n;i++){
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);}
}
void dfs(int x){
viz[x]=1;
for(int i=0;i<a[x].size();++i)
if(!viz[a[x][i]])
dfs(a[x][i]);
}
int main()
{
cit();
for(int i=1;i<=n;i++)
if(!viz[i]){
nr++;
dfs(i);}
g<<nr;
return 0;
}