queue.h

该程序实现了 无向图的建立和广度优先搜索及输出

//循环队列

#define MAX_VERTEX_NUM 20

typedef int elemtype;

typedef struct
{
	elemtype *base;

	int front;
	int rear;

	int queuesize;
}Queue;

int InitQueue(Queue &Q)
{
	Q.base=(elemtype *)malloc((MAX_VERTEX_NUM+1)*sizeof(elemtype));

	if (Q.base)
	{
		Q.front=Q.rear=0;

		Q.queuesize=MAX_VERTEX_NUM+1;

		return 1;
	}
	else
		return 0;
}

int DeQueue(Queue &Q,elemtype &e)
{
	if(Q.front!=Q.rear)
	{
		e=Q.base[Q.front];

		Q.front=(Q.front+1)%Q.queuesize;
	
		return 1;
	}
	else
		return 0;
}

int EnQueue(Queue &Q,elemtype e)
{
	if((Q.rear+1)%Q.queuesize!=Q.front)
	{
		Q.base[Q.rear]=e;

		Q.rear=(Q.rear+1)%Q.queuesize;	

		return 1;
	}
	else
		return 0;
}