seqqueue.h

数据结构中图的设计。这是图的邻接矩阵的存储结构。

#ifndef SEQQUEUE_H
#define SEQQUEUE_H

#include "iostream.h"
#include "stdlib.h"
const int MaxQueueSize=100;
typedef int DataType;
class SeqQueue{
    private:
        DataType data[MaxQueueSize];
        int front;
        int rear;
        int count;
    public:
	    DataType QFront(void) const;
        SeqQueue(void){front=rear=count=0;};
        
        int QEmpty(void) const {return front==rear;};
        void QInsert(const DataType& item);
        void ClearQ(void){front=rear=count=0;};
        DataType QDelete(void);
        int GetSize(void)const {return count;}
                  
};

void SeqQueue::QInsert(const DataType& item){
    if(count>=MaxQueueSize){
        cerr<<"队列已满"<<endl;
        exit(1);
    }
    
    data[rear]=item;
	rear=(rear+1) % MaxQueueSize;
	count++;
}

DataType SeqQueue::QDelete(void){
	DataType temp;

	if(count==0){
		cerr<<"队列已空"<<endl;
        exit(1);
	}

	temp=data[front];

	front=(front+1)% MaxQueueSize;
	count--;

	return temp;
}


DataType SeqQueue::QFront() const
{
		if(count==0){
			cerr<<"队列已空"<<endl;
			exit(1);
		}

		return data[front];
}

#endif