Cod sursa(job #2972002)
Utilizator | Data | 28 ianuarie 2023 15:17:41 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int>alist[100004];
bool vizitat[100004];
void dfs(int s){
vizitat[s]=true;
for(int i=0;i<(int)alist[s].size();i++){
if(!vizitat[alist[s][i]]){
dfs(alist[s][i]);
}
}
}
int main(){
int n,m,x,y,cnt=0;
fin>>n>>m;
while(m--){
fin>>x>>y;
alist[x].push_back(y);
alist[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!vizitat[i])
dfs(i),cnt++;
fout<<cnt;
return 0;
}