Mai intai trebuie sa te autentifici.
Cod sursa(job #3030837)
| Utilizator | Data | 17 martie 2023 22:11:11 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
const int N=100005;
int n,m,insule;
bool vizitat[N];
vector<int> muchii[N];
/*
1:2 4
2:1
3:5
4:1
5:3
6:-
*/
void dfs(int nod)
{
vizitat[nod]=true;
for(unsigned int i=0;i<muchii[nod].size();i++)
{
int vecin=muchii[nod][i];
if(!vizitat[vecin])//vizitat==0/false
dfs(vecin);
}
}
int main()
{
f>>n>>m;
for(int i=n;i<=m;i++)
{
int x,y;
f>>x>>y;
muchii[x].push_back(y);
muchii[y].push_back(x);
}
for(int i=1;i<=m;i++)
{
if(!vizitat[i]){
insule++;
dfs(i);
}
}
g<<insule;
return 0;
}
