Pagini recente » Cod sursa (job #1656628) | Cod sursa (job #1689586) | Cod sursa (job #982153) | Cod sursa (job #1556808) | Cod sursa (job #2470893)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m, viz[100000];
vector<int> v[100000];
void DFS(int nod)
{
viz[nod]=1;
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
for(int j=0;j<v[nod].size();++j)
{
if(v[nod][j]==i)DFS(i);
}
}
}
}
int main()
{
fin>>n>>m;//n ii nr de noduri, m ii nr de muchii
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int rez=0;
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
DFS(i);
rez++;
}
}
fout<<rez;
return 0;
}