Cod sursa(job #2091716)
| Utilizator | Data | 20 decembrie 2017 09:13:22 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include<vector>
#include<fstream>
using namespace std;
vector<int>v[100005];
int viz[100005];
int a,b,n,m,cnt;
ifstream f("dfs.in");
ofstream g("dfs.out");
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();++i)
if(!viz[v[nod][i]])dfs(v[nod][i]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;i++)
if(viz[i]==0){dfs(i);
cnt++;
}
g<<cnt;
return 0;
}
