queue.cpp

一个能求图中任两顶点之间的最短距离的程序

#include"Queue.h"
#include<iostream.h>

void InitQueue(Queue &Q)
{
	Q.front=Q.rear=new QNode;
	Q.front->next=0;
}


void EnQueue(Queue &Q,QElemType e)
{
	QNode *p=new QNode;
	p->next=0;
	p->data=e;
	Q.rear->next=p;
	Q.rear=Q.rear->next;
}

void DeQueue(Queue &Q,QElemType &e)
{
	if(Q.front==Q.rear)
	{
		cout<<"Queue error!"<<endl;
		return;
	}
	QNode *p=Q.front->next;
	e=p->data;
	Q.front->next=p->next;
	if(Q.rear==p)
		Q.rear=Q.front;
	delete p;
}

bool QueueEmpty(Queue &Q)
{
	return Q.front==Q.rear;
}

void DestroyQueue(Queue &Q)
{
	QNode *p=Q.front;
	while(p)
	{
		Q.front=Q.front->next;
		delete p;
		p=Q.front;
	}
}