Pagini recente » Cod sursa (job #3144643) | Cod sursa (job #370380) | Cod sursa (job #320570) | Borderou de evaluare (job #133062) | Cod sursa (job #1226167)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int viz[100001],zi,i,n,m,k,nr,x,y;
vector<int> v[100001];
void dfs(int k)
{
viz[k]=zi;
nr++;
for(i=0;i<v[x].size();i++)
{
if(!viz[v[x][i]])
dfs(v[x][i]);
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
while(nr<n)
{
for(i=1;i<=n;i++)
{
if(!viz[i])
{
dfs(i);
break;
}
}
zi++;
}
fout<<zi;
return 0;
}