Cod sursa(job #3318427)
| Utilizator | Data | 28 octombrie 2025 12:34:28 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> G[100001];
bool viz[100001];
void dfs(int nod) {
viz[nod]=1;
for (int vecin:G[nod]) {
if (!viz[vecin])
dfs(vecin);
}
}
int main() {
int n,m;
f>>n>>m;
for (int i=0;i<m;++i) {
int x,y;
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
int ok=0;
for (int i=1;i<=n;++i) {
if (!viz[i]) {
++ok;
dfs(i);
}
}
g<<ok<<"\n";
return 0;
}
