Cod sursa(job #2525755)
| Utilizator | Data | 17 ianuarie 2020 19:32:34 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> L[100001];
int viz[100001], n, m, nr, x, y;
void dfs(int l)
{
viz[l]=1;
for(int i=0;i<L[l].size();i++)
if(viz[L[l][i]]==0)
dfs(L[l][i]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
dfs(i);
nr++;
}
g<<nr;
return 0;
}
