求图的广度遍历（C/C++ 程序）

#include<stdio.h>
#include<stdlib.h>
#define Max 10
#define FALSE 0
#define TRUE 1
#define Error printf
#define QueueSize 30

typedef struct
{
char vexs[Max];
int edges[Max][Max];
int n,e;
}MGraph;

int visited[Max];

typedef struct
{
int front;
int rear;
int count;
int data[QueueSize];
}CirQueue;

//初始化队列
void InitQueue(CirQueue *Q)
{
Q->front=Q->rear=0;
Q->count=0;
}

//队列空
int QueueEmpty(CirQueue *Q)
{
return Q->count=QueueSize;
}

//队列满
int QueueFull(CirQueue *Q)
{
return Q->count==QueueSize;
}

//进队
void EnQueue(CirQueue *Q,int x)
{
if(QueueFull(Q))
{
Error("Queue overflow");
}
else
{
Q->count++;