Pagini recente » Cod sursa (job #2031746) | Cod sursa (job #2634165) | Cod sursa (job #1291310) | Cod sursa (job #643847) | Cod sursa (job #1659985)
#include<iostream>
#include<fstream>
#include<vector>
#include<map>
using namespace std;
pair<int, int> P;
vector<pair<int, int> > v;
map<int, vector<int> > lista;
int n,m,a,b, viz[100];
void citire()
{
ifstream f("dfs.in");
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
lista[a].push_back(b);
lista[b].push_back(a);
}
}
void df(int nod)
{
viz[nod]=1;
for(int i=0;i<lista[nod].size();i++)
if(viz[lista[nod][i]]==0)
df(lista[nod][i]);
}
int comp_conex()
{
int k=0;
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
df(i);
k++;
}
}
return k;
}
int main()
{
ofstream g("dfs.out");
citire();
g<<comp_conex();
}