******************************************/
#include <neatogen/bfs.h>
+#include <stdbool.h>
#include <stdlib.h>
void bfs(int vertex, vtx_data * graph, int n, DistType * dist, Queue * Q)
qp->end = 1;
}
-boolean deQueue(Queue * qp, int *vertex)
+bool deQueue(Queue * qp, int *vertex)
{
if (qp->start >= qp->end)
- return FALSE; /* underflow */
+ return false; /* underflow */
*vertex = qp->data[qp->start++];
- return TRUE;
+ return true;
}
-boolean enQueue(Queue * qp, int vertex)
+bool enQueue(Queue * qp, int vertex)
{
if (qp->end >= qp->queueSize)
- return FALSE; /* overflow */
+ return false; /* overflow */
qp->data[qp->end++] = vertex;
- return TRUE;
+ return true;
}
#pragma once
+#include <stdbool.h>
+
#ifdef __cplusplus
extern "C" {
#endif
extern void mkQueue(Queue *, int);
extern void freeQueue(Queue *);
extern void initQueue(Queue *, int startVertex);
- extern boolean deQueue(Queue *, int *);
- extern boolean enQueue(Queue *, int);
+ extern bool deQueue(Queue *, int *);
+ extern bool enQueue(Queue *, int);
extern void bfs(int, vtx_data *, int, DistType *, Queue *);
extern int bfs_bounded(int, vtx_data *, int, DistType *, Queue *, int,