if(Q.front==Q.rear){

cerr<<"队列已空，无法读取！"<<endl; exit(1);

}

return Q.queue[(Q.front+1)%Q.MaxSize]; }

bool EmptyQueue(Queue &Q)

{

return Q.front==Q.rear;

}

void ClearQueue(Queue &Q)

{

if(Q.queue!=NULL)

delete []Q.queue;

Q.front=Q.rear =0;

Q.queue=NULL;

Q.MaxSize=0;

}