Cod sursa(job #2072932)
| Utilizator | Data | 22 noiembrie 2017 14:43:23 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> adj[100001];
int viz[100001];
void dfs(int nod){
viz[nod] = 1;
for(int i = 0; i<adj[nod].size();i++){
if(!viz[adj[nod][i]])dfs(adj[nod][i]);
}
}
int main()
{
int N,M,i,x,y;
int total=0;
fin>>N>>M;
for(i = 0; i < M; i++){
fin>>x>>y;
adj[x].push_back(y);
adj[y].push_back(x);
}
for(i = 1; i <= N; i++){
if(viz[i] == 0){ dfs(i); ++total;}
}
fout<<total;
}
