Go to the source code of this file.
Functions | |
void | initQueue (struct Queue *queue) |
Initialize queue structure with NULL value. More... | |
int | isEmpty (struct Queue *queue) |
Check if queue structure is empty. More... | |
void | enqueue (struct Queue *queue, int data) |
Allocate new node and add to queue structure. More... | |
int | dequeue (struct Queue *queue) |
Take out the first added element. More... | |
======================================================================================================================
Queue data structure for computing Reverse Cuthill-McKee algorithm. Queue is a FIFO (First-In First-Out) data structure to access data in serial input order.
Definition in file queue.c.
int dequeue | ( | struct Queue * | queue | ) |
void enqueue | ( | struct Queue * | queue, |
int | data | ||
) |
void initQueue | ( | struct Queue * | queue | ) |