Mai intai trebuie sa te autentifici.
Cod sursa(job #3198783)
| Utilizator | Data | 30 ianuarie 2024 15:33:28 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.in");
const int N = 100005;
vector<vector<int>> graf;
bool viz[N];
struct nod{
int n1, n2;
}e;
void dfs(int nod)
{
viz[nod] = true;
for (int i: graf[nod]){
if(!viz[i])
dfs(i);
}
}
int main() {
int n, m;
cin >> n >> m;
graf.resize(N);
for(int i = 0; i < m; i++){
cin >> e.n1 >> e.n2;
graf[e.n1].push_back(e.n2);
graf[e.n2].push_back(e.n1);
}
int nr = 0;
for(int i = 1; i <= n; i++){
if(!viz[i]){
nr++;
dfs(i);
}
}
cout << nr;
return 0;
}
