Pagini recente » Cod sursa (job #1340573) | Cod sursa (job #645920) | Cod sursa (job #2860977) | Cod sursa (job #1863071) | Cod sursa (job #1445841)
#include <fstream>
#include<vector>
#define MAX 100003
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> gr[MAX];
int n,m,viz[MAX],tata[MAX],nc;
void dfs(int nod)
{
viz[nod]=nc;
int i;
for(i=0;i<gr[nod].size();i++)
if(viz[gr[nod][i]]==0)
{
int fiu=gr[nod][i];
tata[fiu]=nod;
dfs(fiu);
}
}
int main()
{
f>>n>>m;
int i,x,y;
for(i=1;i<=m;i++)
{
f>>x>>y;
gr[x].push_back(y);
gr[y].push_back(x);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
{
nc++;
dfs(i);
}
g<<nc;
return 0;
}