Cod sursa(job #2393892)
Utilizator | Alexandru AlexNeagu | Data | 1 aprilie 2019 10:30:16 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <vector>
using namespace std;
const int NMAX=100005;
vector < int > Muchii[NMAX];
bool Vizitat[NMAX];
int N,M,NR=0;
DFS(int Nod)
{
Vizitat[Nod]=true;
for (unsigned int i=0; i<Muchii[Nod].size(); i++)
{
int Vecin=Muchii[Nod][i];
if(!Vizitat[Vecin])
DFS(Vecin);
}
}
int main()
{
cin>>N>>M;
for (int i=1; i<=M; i++)
{
int x,y;
cin>>x>>y;
Muchii[x].push_back(y);
Muchii[y].push_back(x);
}
for (int i=1; i<=N; i++)
if (!Vizitat[i])
{
DFS(i);
NR++;
}
cout<<NR<<"\n";
}