data-structures/pqueue_8h_source.html

#ifndef PQUEUE_H

#ifndef PQUEUE_SIZE

#define PQUEUE_SIZE 10

#endif


#define HEAP_EMPTY_CELL -1


struct PQueue {

    int heap[PQUEUE_SIZE];

    int size;

};


typedef struct PQueue PQueue;


PQueue* pqueue_create();


void pqueue_insert(PQueue *pq, int x);


int pqueue_extract_max(PQueue *pq);


void pqueue_increase_keys(PQueue *pq, int k, int v);


int pqueue_maximum(PQueue *pq);


void pqueue_free(PQueue *pq);


void pqueue_print(PQueue *pq);


void pqueue_println(PQueue *pq);


#endif

pqueue_create
PQueue * pqueue_create()
Creates an empty priority queue.

pqueue_print
void pqueue_print(PQueue *pq)
Prints the elements of a priority queue to the console.

pqueue_println
void pqueue_println(PQueue *pq)
Prints the elements of a priority queue to the console, followed by a newline character.

pqueue_maximum
int pqueue_maximum(PQueue *pq)
Returns the maximum element in the priority queue without extracting it.

pqueue_extract_max
int pqueue_extract_max(PQueue *pq)
Extracts the maximum element from the priority queue.

pqueue_insert
void pqueue_insert(PQueue *pq, int x)
Inserts an element into the priority queue.

pqueue_increase_keys
void pqueue_increase_keys(PQueue *pq, int k, int v)
Increases the key of an element in the priority queue.

pqueue_free
void pqueue_free(PQueue *pq)
Frees the memory allocated for a priority queue.

PQUEUE_SIZE
#define PQUEUE_SIZE
Definition pqueue.h:15

PQueue
A priority queue implementation using a binary heap.
Definition pqueue.h:23

PQueue::size
int size
Definition pqueue.h:25

PQueue::heap
int heap[PQUEUE_SIZE]
Definition pqueue.h:24