poljr-red

struct trojka {
  int xi, yi, zi;
  int d;
};
 
struct Queue {
  int front, rear;
  trojka polje[10000];
};
 
void DeQueueQ (Queue *red) {
  ((*red).front)++;
  (*red).front = (*red).front % 10000;
}
 
void EnQueueQ (trojka x, Queue *red) {
  red->polje[((*red).rear+1) % 10000] = x;
  red->rear = (red->rear + 1) % 10000;
}
 
bool IsEmptyQ (Queue *red) {
  if ((red->rear + 1) % 10000 == red->front) {
    return true;
  }
  else  {
    return false;
  }
}
 
trojka FrontQ (Queue *red) {
  if (!IsEmptyQ(red))
    return red->polje[red->front];
}
 
void InitQ (Queue *red) {
  (*red).rear = 9999;
  (*red).front = 0;
}