Cod sursa(job #2111543)
| Utilizator | Data | 22 ianuarie 2018 11:49:05 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
#define Nmax 100010
using namespace std;
ifstream reed("dfs.in");
ofstream shaw("dfs.out");
vector <int> v[Nmax];
int a,b,n,m,viz[Nmax],c=0;
void DFS(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();i=i+1){
if(!viz[v[nod][i]]){
DFS(v[nod][i]);
}
}
}
int main()
{
reed>>n>>m;
for(int i=1;i<=m;i=i+1){
reed>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;i=i+1){
if(!viz[i]){
DFS(i);
c++;
}
}
shaw<<c;
return 0;
}
