Cod sursa(job #2529028)
Utilizator | Pop-Mihali Mauro darksp1der | Data | 22 ianuarie 2020 21:13:16 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int Nmax=100005;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector < int > Muchii[Nmax];
int N,M;
int nr=0;
bool vizitat[Nmax];
void Citire()
{
f>>N>>M;
for(int i=1;i<=M;++i)
{
int x,y;
f>>x>>y;
Muchii[x].push_back(y);
Muchii[y].push_back(x);
}
}
void DFS(int N)
{
if(!vizitat[N])
{
vizitat[N]=true;
nr++;
for(int vecin:Muchii[N])
if(!vizitat[vecin])
DFS(vecin);
}
}
int main()
{
Citire();
DFS(1);
g<<nr;
}