queue.cpp

数据结构作业图的一些集合 上面有优先遍历 和用链表和堆栈来实现的算法

#include"iostream"
#include"stdlib.h"
#include"Queue.h"
using namespace std;
Queue::Queue():front(0),rear(0),count(0){}
/*Queue::~Queue()
{
   cout<<"The queue has been deleted!"<<endl;
}
*/
void Queue::QInsert(const int & item)
{
	if(QFull())
	{
		cout<<"The queue has been full!"<<endl;
        exit(1);	
	}
	queue[rear]=item;
	count++;
	rear=(rear+1)%MaxQSize;
}
int Queue::QDelete()
{
	if(QEmpty())
	{
		cout<<"The queue has been empty!"<<endl;
		exit(1);
	}
	count--;
	int temp=front;
	front=(front+1)%MaxQSize;
	return  queue[temp]; 
}
int Queue::QFront()const
{
	if(QEmpty())
	{
		cout<<"The queue is empty!"<<endl;
		return -1;
	}
    else
		return queue[front];
}
int Queue::QLength()const
{
	return count;
}
bool Queue::QEmpty()const
{
	return count==0;
}
bool Queue::QFull()const
{
	return count==MaxQSize;
}
void  Queue::QClear()
{
	rear=front;
	count=0;
}