Cod sursa(job #1611906)
| Utilizator | Data | 24 februarie 2016 16:07:38 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector <int> v[100002];
int n,viz[100000];
ifstream f("dfs.in");
ofstream g("dfs.out");
void citire()
{int m;
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
}
void DF(int nod)
{ viz[nod]=1;
for(int i=0; i < v[nod].size(); i++)
if(viz[v[nod][i]] == 0)
DF(v[nod][i]);
}
int main()
{int nr=0;
citire();
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
DF(i);
nr++;
}
}
g<<nr;
return 0;
}
