Functions used to manage a queue used by A* Algorithm. More...
#include "pathqueue.h"
Functions | |
Queue functions | |
| int | queueIsEmpty (NodeQueue *q) |
| Tests if a queue is empty. | |
| void | pushNode (NodeQueue *q, int x, int y) |
| Push a node into the queue in a FIFO mode. | |
| void | pushNodeLast (NodeQueue *q, int x, int y) |
| Push a node into the queue in a LIFO mode. | |
| int | popNode (NodeQueue *q, Node *n) |
| Pop the first node of the queue. | |
| void | printQueue (NodeQueue *q) |
| Print the queue. | |
| NodeQueue * | newQueue (void) |
| Init queue values. | |
| int | delQueue (NodeQueue *q) |
| Free queue memory. | |
| int | isInQueue (NodeQueue *q, int x, int y) |
| Finds out if the node (X,Y) is in the queue. | |
| void | drainQueue (NodeQueue *q) |
| Free memory allocated in the queue. | |
Functions used to manage a queue used by A* Algorithm.
1.7.1