Pagini recente » Cod sursa (job #2510970) | Cod sursa (job #497456) | Cod sursa (job #2527894) | Cod sursa (job #512039) | Cod sursa (job #2372825)
#include <iostream>
#include <vector>
using namespace std;
int viz[100];
vector <int> graph[100];
void dfs(int nod)
{
int Size=graph[nod].size();
viz[nod]=1;
for(int i=0; i<Size; i++)
{
int vecin = graph[nod][i];
if(!viz[vecin])
dfs(vecin);
}
}
int main()
{
int comp=0;
int N,M,x,y;
cout<<"nr noduri si muchii : ";
cin>>N>>M;
for(int i=0; i<M; i++)
{
cout<<"muchii: ";
cin>>x>>y;
graph[x].push_back(y);
graph[y].push_back(x);
}
for(int i=1; i<=N; i++)
if(!viz[i])
{
comp++;
dfs(i);
}
cout<<comp;
return 0;
}