Cod sursa(job #676699)
Utilizator | Data | 9 februarie 2012 15:35:11 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n,m,a[100][100],v[100],cc=0;
void citire(){
int x,y,i;
in>>n>>m;
for(i=1; i<=m; i++){
in>>x>>y;
a[x][y]=a[y][x]=1;
}
}
void bf(int start){
v[start]=cc;
for(int i=1; i<=n; i++)
if(a[start][i] and !v[i])
bf(i);
}
int main(){
citire();
for(int i=1; i<=n; i++)
if(!v[i]){
cc++;
bf(i);
}
out<<cc;
return 0;
}