priority_queue Struct Reference

Data structure for an automatically resizing dynamically allocated priority queue. More...

#include <util.h>

Data Fields
void **	arr
	Array contining the data.
int	count
	Number of elements.
int	size
	Length of array.
int(*	compare )(void *e1, void *e2)
	Comparison function.

---

Detailed Description

Data structure for an automatically resizing dynamically allocated priority queue.

A priority queue allows quick retrieval of the smallest element of a set (This implementation uses O(log n) time). This implementation uses a heap for storing the queue.

---

The documentation for this struct was generated from the following file:

• util.h

---