Cod sursa(job #2679809)
Utilizator | Data | 1 decembrie 2020 16:46:37 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,x,y,nr;
int viz[100005];
vector <int> lg[100005];
ifstream f ("dfs.in");
ofstream g ("dfs.out");
void dfs(int nod) {
viz[nod] = true;
for(int j=0; j<lg[nod].size(); j++)
if(!viz[lg[nod][j]])
dfs(lg[nod][j]);
}
int main() {
f >> n >> m;
for(int i=1; i<=m; i++) {
f >> x >> y;
lg[x].push_back(y);
lg[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!viz[i]) {
nr++;
dfs(i);
}
g << nr;
return 0;
}