Pagini recente » Cod sursa (job #2417561) | Cod sursa (job #2417562) | Cod sursa (job #3317371) | Cod sursa (job #1885580) | Cod sursa (job #2417560)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector <int> graf[100005];
int viz[100005];
void DFS(int x)
{
int lim;
viz[x]=1;
int i;
lim=graf[x].size();
for(i=0;i<lim;i++)
{
if(viz[graf[x][i]]==0)
DFS(graf[x][i]);
}
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
int N,M,i,x,y,k=0;
f>>N>>M;
for(i=1;i<=M;i++)
{
f>>x>>y;
graf[x].push_back(y);
graf[y].push_back(x);
}
for(i=1;i<=N;i++)
{
if(viz[i]==0)
{
DFS(i);
k++;
}
}
g<<k;
return 0;
}