Cod sursa(job #1443018)
Utilizator | Gabriel Tuculina GabyGaby | Data | 26 mai 2015 17:46:10 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m, v[100005], x, y, nr, i;
vector <int> L[100002];
void dfs(int nod){
v[nod]=1;
for(int i=0; i<L[nod].size(); i++){
int vecin=L[nod][i];
if(v[vecin]==0)
dfs(vecin);
}
}
int main(){
fin>>n>>m;
for(i=1; i<=m; i++){
fin>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
for(i=1; i<=n; i++)
if(v[i]==0){
nr++;
dfs(i);
}
fout<<nr;
return 0;
}