Pagini recente » Cod sursa (job #1919874) | Cod sursa (job #1940936) | Cod sursa (job #1938559) | Cod sursa (job #1616769) | Cod sursa (job #1277473)
#include <fstream>
#include <vector>
using namespace std;
vector <int> v[100100];
bool prez[100009];
int n,m,x,i,y,nr;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
void bfs(int x)
{
int st,dr,q[100100],p;
for(st=1,dr=1,q[1]=x,prez[x]=true;st<=dr;st++)
{
for(p=0;p<v[q[st]].size();p++)
{
if(prez[v[q[st]][p]]==false)
{
dr++;
q[dr]=v[q[st]][p];
prez[v[q[st]][p]]=true;
}
}
}
}
int main()
{
fin>>n>>m;
for (i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)if(prez[i]==false){nr++;bfs(i);}
fout<<nr;
return 0;
}