Pagini recente » Cod sursa (job #1752017) | Cod sursa (job #1253311) | Cod sursa (job #1237316) | Cod sursa (job #2159421) | Cod sursa (job #1214318)
#include<iostream>
#include<cstdio>
#include<fstream>
#include<vector>
using namespace std;
int viz[100001],n,cc,m,i,j;
vector <int> vec[100001];
ifstream f("dfs.in");
FILE * g=fopen("dfs.out","w");
void DFS(int nod)
{
viz[nod]=1;
for(int i=1;i<=n;i++)
if(vec[nod][i]==1 && viz[i]==0)
DFS(i);
}
int main()
{
f>>n>>m;
for(int k=1;k<=m;k++)
{
f>>i>>j;
vec[i].push_back(j);
vec[j].push_back(i);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
DFS(i);
cc++;
}
}
fprintf(g,"%d ",cc);
}