Pagini recente » Istoria paginii runda/ciocolata/clasament | Cod sursa (job #1049237) | Cod sursa (job #393164) | Cod sursa (job #795445) | Cod sursa (job #2967262)
#include <fstream>
#include <vector>
#define NMAX 100002
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,nrc,m;
vector<int> G[NMAX];
int uz[NMAX];
int d[NMAX];
void citire();
void dfs(int x);
void afisare();
int main()
{
int i;
citire();
for(i=1; i<=n; i++)
if(!uz[i])
{
nrc++;
dfs(i);
}
afisare();
return 0;
}
void citire()
{
int x,y,i;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
G[y].push_back(x);
G[x].push_back(y);
}
}
void dfs(int x)
{
int i;
uz[x]=nrc;
for(i=0; i<G[x].size(); i++)
if(!uz[G[x][i]])
dfs(G[x][i]);
}
void afisare()
{
fout<<nrc;
}