pathqueue.c

Go to the documentation of this file.

#include "pathqueue.h"

int queueIsEmpty(NodeQueue *q){
        if ((q->first==NULL) && (q->last==NULL))        return 1;
        else return 0;
}

void pushNode(NodeQueue * q, int x, int y){
        Node *n= malloc(sizeof(Node));
        if (n == NULL) {
                /* Memory could not be allocated, so print an error and exit. */
                fprintf(stderr, "Couldn't allocate memory\n");
                exit(EXIT_FAILURE);
        }

        n->x=x;
        n->y=y;
        n->next=NULL;

        if (queueIsEmpty(q)) {
                q->first=n;
                q->last=n;
        } else {
                (q->last)->next=n;
                q->last=n;
        }
}

void pushNodeLast(NodeQueue * q, int x, int y){
        Node *n= malloc(sizeof(Node));
        if (n == NULL) {
                /* Memory could not be allocated, so print an error and exit. */
                fprintf(stderr, "Couldn't allocate memory\n");
                exit(EXIT_FAILURE);
        }

        n->x=x;
        n->y=y;
        
        if (queueIsEmpty(q)) {
                q->first=n;
                q->last=n;
                n->next = NULL;
        } else {
                n->next=q->first;
                q->first=n;
        }
}

int popNode(NodeQueue * q, Node * n){
        Node * tmp;
        if (!queueIsEmpty(q)){
                n->x = (q->first)->x;
                n->y = (q->first)->y;
                tmp = (q->first)->next;
                free((q->first));
                q->first = tmp;
                if ( (q->first) == NULL) q->last = NULL;
                return 1;
        } else return 0;
}

void printQueue(NodeQueue * q){
        Node * n = q->first;

        while(n!=NULL){
                printf("(%d,%d)\n", n->x, n->y);
                n=n->next;
        }
        printf("No more Nodes in the queue!\n");

}

 NodeQueue * newQueue(void){
        NodeQueue * q;
        q = malloc(sizeof(NodeQueue));
        q->first=NULL;
        q->last=NULL;
        return q;
}
int delQueue(NodeQueue * q){
        if (queueIsEmpty(q)) {
                free(q);
                return 1;
        } else return 0;
}

int isInQueue(NodeQueue * q, int x, int y){
                Node * tmp;
                
                tmp=q->first;
                while (tmp!=NULL){
                        if((tmp->x==x)&&(tmp->y==y)) return 1;
                        tmp=tmp->next;
                }
                return 0;
}

void drainQueue(NodeQueue * q){
    Node n;
        while(popNode(q, &n));
}

---