Cod sursa(job #2288978)
Utilizator | Data | 24 noiembrie 2018 10:01:48 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f1("dfs.in");
ofstream f2("dfs.out");
vector<int> G[100005];
int a[100005];
int nrConex;
void dfs(int nod){
if(a[nod]==1)
return;
a[nod]=1;
for(int i : G[nod]) {
dfs(i);
}
}
int n,m;
int main() {
f1>>n>>m;
int x,y;
for(int i=0;i<m;i++){
f1>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1;i<=n;i++){
if(a[i]==0){
dfs(i);
nrConex++;
}
}
f2<<nrConex;
return 0;
}