Pagini recente » Cod sursa (job #3228219) | Cod sursa (job #2879134) | Cod sursa (job #2403037) | Cod sursa (job #2386365) | Cod sursa (job #3146414)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
struct per
{
vector <int> dir;
}v[100001];
bool prez[100001];
void dfs(int a)
{
for(int i=1;i<=v[a].dir[0];i++)
{
if(prez[v[a].dir[i]]==0)
{
prez[v[a].dir[i]]=1;
dfs(v[a].dir[i]);
}
}
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<=n;i++)
{
v[i].dir.push_back(0);
}
for(int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
v[x].dir[0]++;
v[x].dir.push_back(y);
v[y].dir[0]++;
v[y].dir.push_back(x);
}
int cnt=0;
for(int i=1;i<=n;i++)
{
if(prez[i]==0)
{
cnt++;
dfs(i);
}
}
cout<<cnt;
return 0;
}