数据结构实验六

源代码

#include<iostream>
using namespace std;


const int maxsize=10;
int visited[maxsize];


template<class T>
class MGraph
{
public:
MGraph(T a[],int n,int e);
~MGraph(){}
void dfs(int v);
void bfs(int v);
private:
T vertex[maxsize];
int arc[maxsize][maxsize];
int vertexnum,arcnum;
};


template<class T>
MGraph<T>::MGraph(T a[],int n,int e)
{
int i,j;
vertexnum=n;
arcnum=e;
for(i=0;i<vertexnum;i++)
vertex[i]=a[i];
for(i=0;i<vertexnum;i++)
for(j=0;j<arcnum;j++)
arc[i][j]=0;
for(int k=0;k<arcnum;k++)
{
cout<<"请输入边依附的两个顶点的序号:";
cin>>i>>j;
arc[i][j]=1;
arc[j][i]=1;
}
}


template<class T>
void MGraph<T>::dfs(int v)
{
int i,j;
cout<<vertex[v]<<" ";
visited[v]=1;
for(j=0;j<vertexnum;j++)
if(arc[v][j]==1 && visited[j]==0)
dfs(j);
}


template<class T>
void MGraph<T>::bfs(int v)
{
int Q[maxsize];
int front,rear;
front=rear=-1;
cout<<vertex[v]<<" ";
visited[v]=1;
Q[++rear]=v;
while(front!=rear)
{
v=Q[++front];
for(int j=0;j<vertexnum;j++)
if(arc[v][j]==1 && visited[j]==0)
{
cout<<vertex[j]<<" ";
visited[j]=1;
Q[++rear]=j;
}
}
}


int main()
{

int a[maxsize];
int n,e,i;

for(i=0;i<maxsize;i++)
visited[i]=0;
cout<<"请输入顶点数和边数:";
cin>>n>>e;
cout<<endl;


cout<<"请输入顶点:";
for(i=0;i<n;i++)
cin>>a[i];
cout<<endl;


MGraph<int>graph(a,n,e);
cout<<endl<<endl;

cout<<"深度优先遍历:";
graph.dfs(0);
cout<<endl<<endl;


for(i=0;i<maxsize;i++)
visited[i]=0;
cout<<"广度优先遍历:";
graph.bfs(0);

cout<<endl<<endl;

return 0;

}

运行结果