Cod sursa(job #2548486)
| Utilizator | Data | 16 februarie 2020 18:45:11 | |
|---|---|---|---|
| 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>
using namespace std;
vector<int>G[100004];
int viz[100003],n,m;
ifstream f("dfs.in");
ofstream g("dfs.out");
void dfs(int s){
viz[s]=1;
for(auto &v:G[s]){
if(!viz[v])
dfs(v);
}
}
void citire(){
f>>n>>m;
int x,y;
for(int i=0; i<m; i++){
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void rezolvare(){
int nr=0;
for(int i=1; i<=n; i++){
if(!viz[i]){
dfs(i);
nr++;
}
}
g<<nr;
}
int main() {
citire();
rezolvare();
return 0;
}
