Pagini recente » Cod sursa (job #236301) | Cod sursa (job #1987758) | Cod sursa (job #1939385) | Cod sursa (job #924708) | Cod sursa (job #2603096)
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
struct nodd
{
bool vizitat;
vector <int> vecini;
} nod[NMAX];
int n,m,compconexe;
stack <int> stiva;
int main()
{
int i,j,a,b,aux;
fin>>n>>m;
for(i=1; i<=n; i++)
{
fin>>a>>b;
nod[a].vecini.push_back(b);
nod[b].vecini.push_back(a);
}
for(i=1 ; i<=n ; i++)
if(!nod[i].vizitat)
{
compconexe++;
nod[i].vizitat=1;
stiva.push(i);
while(!stiva.empty())
{
aux=stiva.top();
stiva.pop();
for(j=0 ; j!=nod[aux].vecini.size() ; j++)
if(!nod[nod[aux].vecini[j]].vizitat)
{
nod[nod[aux].vecini[j]].vizitat=1;
stiva.push(nod[aux].vecini[j]);
}
}
}
fout<<compconexe;
return 0;
}