Cod sursa(job #3156419)
| Utilizator | Data | 11 octombrie 2023 16:38:58 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream o("dfs.out");
const int nmax = 10000;
vector<int> G[nmax];
int vis[nmax+1];
void DFS(int x){
vis[x]=1;
for(auto next:G[x])
{
if(!vis[next])DFS(next);
}
}
int main()
{
int n,m;
f >> n >> m;
for (int i = 1; i<=m; i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
int cc = 0;
for(int i = 1; i<=n; i++){
if(!vis[i]){
cc++;
DFS(i);
}
}
o<<cc;
}
