Cod sursa(job #2564347)
Utilizator | Minciunescu Tudor TUdOr73 | Data | 1 martie 2020 20:22:54 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 45 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int a[1000][1000],T[100];
void df(int x,int n){
for(int i =1;i<= n;i++){
if(T[i] == 0 && a[x][i] == 1){
T[i] = 1;
df(i,n);
}
}
}
int main()
{ int n,m;
f>>n>>m;
int x,y;
for(int i = 1;i<= m;i++){
f>>x>>y;
a[x][y] = 1;
a[y][x] = 1;
}
int nr = 0;
for(int i = 1;i<= n;i++){
if(T[i] == 0){
T[i] = 1;
df(i,n);
nr++;
}
}
g << nr;
return 0;
}