Pagini recente » Cod sursa (job #1297233) | Cod sursa (job #798093) | Cod sursa (job #2040275) | Cod sursa (job #1851576) | Cod sursa (job #283405)
Cod sursa(job #283405)
#include<iostream.h>
#include<fstream.h>
int i,j,v[100][100],n,m,c,k,s[20],g,q=0;
void df(int nod){
int c;
s[nod]=1;
for(c=1;c<=n;c++)
if(v[nod][c]==1 && s[c]==0)
df(c);
}
int main(){
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
f>>n;
f>>m;
for(k=1;k<=n;k++)
for(g=1;g<=n;g++)
v[k][g]=0;
for(k=1;k<=m;k++){
f>>i;
f>>j;
v[i][j]=1;
v[j][i]=1;
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
cout<<v[i][j]<<" ";
cout<<endl;
}
df(1);
for(i=0;i<n;i++)
if(s[i]==0){
df(s[i]);
q++;
}
cout<<endl<<q;
return 0;
}