Pagini recente » Cod sursa (job #968847) | Cod sursa (job #2210860) | Cod sursa (job #1850858) | Cod sursa (job #1332745) | Cod sursa (job #1462366)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int m,n,contor,viz[100001],x,y;
vector<int> a[100001];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<a[nod].size();i++)
{
if(viz[a[nod][i]]==0)
{
// viz[a[nod][i]] = 1;
dfs(a[nod][i]);
}
}
}
int main()
{
ifstream in("dfs.in");
ofstream out("dfs.out");
in >> n >> m;
for(int i=0;i<m;i++)
{
in >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!viz[i])
{
cout << i << " ";
contor++;
dfs(i);
}
out << contor;
return 0;
}