Pagini recente » Cod sursa (job #866112) | Cod sursa (job #1884091) | Cod sursa (job #3140191) | Cod sursa (job #2517849) | Cod sursa (job #1229405)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int x,y,n,m,i,OK,zi,viz[10000];
vector<int>v[10001];
void dfs(int k)
{
int i=0;
viz[k]=zi;
for(i=0;i<v[k].size();i++)
if(!viz[v[k][i]])
{
dfs(v[k][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);
}
zi=1;
dfs(1);
OK=1;
while(OK)
{
OK=0;
for(i=1;i<=n;i++)
if(!viz[i])
{
OK=1;
zi++;
dfs(i);
break;
}
}
fout<<zi;
}