Cod sursa(job #3149365)
| Utilizator | Data | 7 septembrie 2023 18:52:43 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,a[101][101]={0},v[101]={0};
void dfs(int b){
v[b]=1;
int i;
for(i=1;i<=n;i++){
if(a[b][i]==1 && v[i]==0) dfs(i);
}
}
int main()
{
int m,i,x,y,j,c=0;
f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
a[x][y]=a[y][x]=1;
}
for(j=1;j<=n;j++){
if(v[j]==0){
c++;
dfs(j);
}
}
g<<c;
}