Cod sursa(job #2126037)
| Utilizator | Data | 8 februarie 2018 23:34:35 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,i,j,x,nr,y;
bool viz[100010];
vector<int> l[100010];
void DFS(int nod)
{
viz[nod]=1;
for(int i=0;i<l[nod].size();++i)
{
if(viz[ l[nod][i] ]==0)
{
DFS(l[nod][i]);
}
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;++i)
{
fin>>x>>y;
l[x].push_back(y);
l[y].push_back(x);
}
for(i=1;i<=n;++i)
{
if(viz[i]==0)
{
DFS(i);
++nr;
}
}
fout<<nr;
return 0;
}
