Pagini recente » Cod sursa (job #1487873) | Cod sursa (job #1705962) | Cod sursa (job #1705683) | tema | Cod sursa (job #2242477)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int NMAX = 100005;
int n, m, x, y, cc;
int viz[NMAX];
vector <int> muchii[NMAX];
void DFS(int nod, int cc)
{
viz[nod] = cc;
for(int i=0; i<muchii[nod].size(); i++)
{
int vecin = muchii[nod][i];
if(!viz[vecin])
DFS(vecin, cc);
}
}
void citire()
{
fin>>n>>m;
for(int i=1; i<=m; i++)
{
fin>>x>>y;
muchii[x].push_back(y);
muchii[y].push_back(x);
}
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
cc++;
DFS(i, cc);
}
}
}
int main()
{
citire();
fout<<cc;
return 0;
}