Cod sursa(job #2167995)
Utilizator | Eduard Scaueru Eduard24 | Data | 14 martie 2018 09:02:10 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,viz[100005],i,nr,x,y;
vector <int> G[100005];
void DFS(int x, int nr)
{
viz[x]=nr;
for(int i=0;i<G[x].size();i++)
{
if(viz[G[x][i]]==0)
{
DFS(G[x][i],nr);
}
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
nr=1;
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
DFS(i,nr);
nr++;
}
}
fout<<nr-1;
return 0;
}