Cod sursa(job #2144159)
| Utilizator | Data | 26 februarie 2018 16:12:01 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <vector>
using namespace std;
vector <int> gr[100001];
bool a[100001];
ifstream f("dfs.in");
ofstream g("dfs.out");
void dfs(int u) {
a[u]=1;
for(size_t i=0; i<gr[u].size(); i++) {
if(a[gr[u][i]]==0) {
dfs(gr[u][i]);
}
}
}
int main() {
int n, m, nod1, nod2, cont=0;
f>>n>>m;
for(int i=1; i<=m; i++) {
f>>nod1>>nod2;
gr[nod1].push_back(nod2);
gr[nod2].push_back(nod1);
}
for(int i=1; i<=n; i++) {
if(a[i]==0) {
dfs(i);
cont++;
}
}
g<<cont;
return 0;
}
