Cod sursa(job #2477968)
| Utilizator | Data | 21 octombrie 2019 13:39:55 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector < int > v[100000];
bool b[100000];
int x, y, n, m, cont;
void dfs(int nod){
b[nod]=1;
for(auto i:v[nod]){
if(!b[i]){
dfs(i);
}
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++){
in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++){
if(!b[i]){
cont++;
dfs(i);
}
}
out<<cont;
}
