Data Structures Lerax 1.0.0
Essential Data Structures for C language
Loading...
Searching...
No Matches
pqueue.h
Go to the documentation of this file.
1
12
13#ifndef PQUEUE_H
14#ifndef PQUEUE_SIZE
15#define PQUEUE_SIZE 10
16#endif
17
18#define HEAP_EMPTY_CELL -1
19
26struct PQueue {
27 int heap[PQUEUE_SIZE];
28 int size;
29};
30
31
32typedef struct PQueue PQueue;
33
35
36void pqueue_insert(PQueue *pq, int x);
37
39
40void pqueue_increase_keys(PQueue *pq, int k, int v);
41
43
45
47
49
50#endif
PQueue * pqueue_create()
void pqueue_print(PQueue *pq)
void pqueue_println(PQueue *pq)
int pqueue_maximum(PQueue *pq)
int pqueue_extract_max(PQueue *pq)
void pqueue_insert(PQueue *pq, int x)
void pqueue_increase_keys(PQueue *pq, int k, int v)
void pqueue_free(PQueue *pq)
Priority Queue Data Structure. Like a normal queue about push/pop logic, but each individual now heav...
Definition pqueue.h:26
int size
Definition pqueue.h:28
int heap[PQUEUE_SIZE]
Definition pqueue.h:27