Pagini recente » Cod sursa (job #580549) | Cod sursa (job #3214615) | Cod sursa (job #2068833) | Cod sursa (job #770779) | Cod sursa (job #2712070)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int>graf[100005];
bool viz[100005];
int n,m;
void read()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
graf[x].push_back(y);
graf[y].push_back(x);
}
}
void dfs(int k)
{
viz[k]=1;
for(int i=0;i<graf[k].size();i++)
{
int nod=graf[k][i];
if(viz[nod]==0)
{
dfs(nod);
}
}
}
int main()
{
read();
int c=0;
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
c++;
}
}
fout<<c;
fin.close();
fout.close();
return 0;
}