Cod sursa(job #2152838)
| Utilizator | Data | 5 martie 2018 20:29:54 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
int n,m,i,x,y,nr;
bool v[100010];
vector<int> a[100010];
void dfs (int nod) {
v[nod]=1;
for(int i=0;i<a[nod].size();i++)
if(v[a[nod][i]]==0)
dfs(a[nod][i]);
}
int main () {
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
if(v[i]==0)
nr++,dfs(i);
fout<<nr;
}
