图

最新推荐文章于 2023-02-22 11:13:55 发布

原创最新推荐文章于 2023-02-22 11:13:55 发布 · 643 阅读

0 ·

CC 4.0 BY-SA版权

本文详细介绍了树的深度优先遍历和广度优先遍历的算法实现，通过C++代码展示了如何使用邻接矩阵来构建树，并实现深度优先搜索和广度优先搜索。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
using namespace std;




const int maxsize=100;


int visited[maxsize]={0};


class shu{
public:
shu(int a[],int n, int e);
~shu(){}
void deepread(int v);
void wideread(int v);
private:
int point[maxsize];
int side[maxsize][maxsize];
int pointnum,sidenum;
};




shu::shu(int a[],int n, int e){
int i,j,k;
pointnum=n;
sidenum=e;
for(i=0;i<pointnum;i++)
point[i]=a[i];
for(i=0;i<pointnum;i++)
for(j=0;j<pointnum;j++)
side[i][j]=0;
for(k=0;k<sidenum;k++){
cout<<"请输入边的两个顶点的序号：";
cin>>i>>j;
side[i][j]=1;
side[j][i]=1;
}
cout<<endl;
cout<<"矩阵如下："<<endl;
for(int w1=0;w1<e;w1++){
for(int w2=0;w2<e;w2++)
cout<<side[w1][w2]<<" ";
cout<<endl;
}
}


void shu::deepread(int v){
cout<<point[v]<<" ";
visited[v]=1;
for(int j=0;j<pointnum;j++)
if(side[v][j]==1&&visited[j]==0)
deepread(j);


}


void shu::wideread(int v){
int Q[maxsize];
int front=-1,rear=-1;


cout<<point[v]<<" ";
visited[v]=1;
Q[++rear]=v;
while(front!=rear){
v=Q[++front];
for(int j=0;j<pointnum;j++)
if(side[v][j]==1&&visited[j]==0){
cout<<point[j]<<" ";
visited[j]=1;
Q[++rear]=j;
}
}
}


int main(){
int ch[]={1,2,3,4,5};
int w,v;
cout<<"请依次输入树的结点数和弧数：";
cin>>w;
cin>>v;
shu shu0(ch,w,v);
for(int i=0;i<maxsize;i++)
visited[i]=0;
cout<<"深度优先遍历的序列是：";
shu0.deepread(0);
cout<<endl;
for(i=0;i<maxsize;i++)
visited[i]=0;
cout<<"广度优先遍历的序列是：";
shu0.wideread(0);
cout<<endl;
return 0;
}