Cod sursa(job #2348152)
| Utilizator | Data | 19 februarie 2019 13:51:05 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <vector>
using namespace std;
vector <int> graph[100];
int viz[100];
void DFS(int node)
{
viz[node]=1;
int lim=graph[node].size();
int vecin;
for(int i=0;i<lim;i++)
{
vecin=graph[node][i];
if(!viz[vecin])
DFS(vecin);
}
}
int main()
{
int n,m;
cin>>n>>m;
int i;
int a,b;
for(i=0;i<m;i++)
{
cin>>a>>b;
graph[a].push_back(b);
graph[b].push_back(a);
}
int ans=0;
for(i=0;i<n;i++)
{
if(!viz[i])
{
DFS(i);
ans++;
}
}
cout<<ans;
return 0;
}
