red_polje.h

typedef int element;
 
struct qu {
       elementtype elements[10000];
       element front,rear;
};
typedef struct qu Queue;
 
int AddOne(int n) {
    return((n+1)%10000);
}
elementtype FrontQ(Queue *Q){
	if (AddOne(Q->rear) == Q->front) {
	   cout<<"\n Red je prazan ! \n";
       exit(0);
       }
    else 
       return (Q->elements[Q->front]);
}
void EnQueueQ(elementtype x, Queue *Q){
	if ((Q->front) == AddOne(AddOne(Q->rear))) {
	   cout<<"\n Red je pun ! \n";
       exit(0);
       }
	else {
       Q->rear = AddOne(Q->rear); 
	   Q->elements[Q->rear] = x;
	   }
}
void DeQueueQ(Queue *Q){ 
	if (AddOne(Q->rear) == Q->front) {
	   cout<<"\n Red je prazan ! \n";
       exit(0);
       }
	else 
       Q->front = AddOne(Q->front);
}
void InitQ(Queue *Q){
	Q->front=0;
	Q->rear=10000-1;
}
bool IsEmptyQ(Queue *Q){
	if (AddOne(Q->rear) == Q->front)
       return 1;
    else 
       return 0;
}