#include<iostream.h>
#include<malloc.h>
#define Max 20
typedef struct Node
{
int num;
struct Node *next;
}Node;
Node G[Max];
int visited[Max];
int Q[Max];
int front=0,rear=0;
bool emptyQueue(int Q[])
{
if(rear ==front )
return true;
else return false;
}
void EnQueue(int Q[], int e)
{
Q[rear] = e;
rear = rear + 1;
}
void DeQueue(int Q[], int *e)
{
*e = Q[front];
front = front + 1;
}
void Creategraph(int n,Node G[])
{
int i,e,j;
Node *p,*q;
for(i=0;i<n;i++)
{
G[i].num=i;
G[i].next=NULL;
}
for(i=0;i<n;i++)
{
cout<<"请输入第"<<i+1<<"个顶点相邻结点信息:(输入0表示没有结点相邻)"<<endl;
cin>>e;
e=e-1;
j=0;
while(e!=-1&&j<n)
{
p=(Node*)malloc(sizeof(Node));
p->next=NULL;
p->num=e;
j++;
if(G[i].next==NULL)
G[i].next=p;
else q->next=p;
q=p;
cout<<"请输入第"<<i+1<<"个顶点相邻结点信息:(输入0表示没有结点相邻)"<<endl;
cin>>e;
e=e-1;
}
}
}
int First(Node G[],int v)
{
if(G[v].next!=NULL)
return G[v].next->num;
return -1;
}
int Next(Node G[],int v)
{
Node *p;
p=G[v].next;
while(p!=NULL)
{
if(visited[p->num])
p=p->next;
else
return p->num;
}
return -1;
}
void BFS(Node G[],int v)
{
int w,u;
cout<<v+1<<" ";
visited[v]=1;
EnQueue(Q,v);
while(!emptyQueue(Q))
{
DeQueue(Q,&u);
w=First(G,u);
while(w!=-1)
{
if(visited[w]==0)
{
cout<<w+1<<" ";
visited[w]=1;
EnQueue(Q, w);
}
w=Next(G,u);
}
}
}
void main()
{
int i,n;
cout<<"请输入图的顶点个数(不大于20):"<<endl;
cin>>n;
Creategraph(n,G);
for(i=0;i<n;i++)
visited[i]=0;
cout<<"广度遍历的顺序为:"<<endl;
for(i=0;i<n;i++)
if(visited[i]==0)
BFS(G,i);
cout<<endl;
}