Pagini recente » Cod sursa (job #78143) | Cod sursa (job #2398149) | Teoria jocurilor | Cod sursa (job #3166304) | Cod sursa (job #1704200)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int>v[10001];
char viz[10001];
int maxim;
void DFS(int i)
{
int n=v[i].size();
int k,j;
for(j=n-1;j>=0;j--)
{
k=v[i][j];
if(viz[k]==0)
{
viz[k]=1;
DFS(k);
}
}
}
int main()
{
int n,m,i,x,y;
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(viz[i]==0)
{
DFS(i);
maxim++;
}
}
fout<<maxim;
return 0;
}