red_pokazivac.h

#include <iostream>
using namespace std;
struct tred {
       int x, y;
       int i;
       short prioritet;
       };
 
struct qu {
       tred value;
       qu *next;
       };
 
struct que {
       qu *front, *rear;
       };
typedef struct que queue;
typedef struct qu element;
element *glava=new element;
bool IsEmptyQ(queue *Q) {
     if (Q->rear==Q->front) return true;
     else return false;
     }
tred FrontQ(queue *Q) {
     if (!IsEmptyQ(Q)) {
                       element *pom=Q->front;
                       pom=pom->next;
                       return pom->value;
                       }
     }
void DeQueueQ(queue *Q) {
     if (!IsEmptyQ(Q)) {
                       element *brisi=Q->front;
                       Q->front=brisi->next;
                       delete brisi;
                       }
     }
void EnQueueQ (tred x, queue *Q) {
     element *zadnji=Q->rear;
     element *novi=new element;
     novi->value=x;
     novi->next=NULL;
     zadnji->next=novi;
     Q->rear=novi;
     }
 
void InitQ (queue *Q) {
     Q->front=glava;
     Q->rear=glava;
     }