#include <neatogen/neatoprocs.h>
#include <pathplan/vispath.h>
#include <pack/pack.h>
+#include <stdbool.h>
typedef struct {
int cnt;
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
if (PARENT(n) == g && n != tex && n != hex && !IS_CLUST_NODE(n)) {
- addObj(l, makeObstacle(n, pm, FALSE));
+ addObj(l, makeObstacle(n, pm, false));
}
}
for (i = 1; i <= GD_n_cluster(g); i++) {
NEATOPROCS_API void initial_positions(graph_t *, int);
NEATOPROCS_API void jitter3d(Agnode_t *, int);
NEATOPROCS_API void jitter_d(Agnode_t *, int, int);
- NEATOPROCS_API Ppoly_t *makeObstacle(node_t * n, expand_t*, boolean );
+ NEATOPROCS_API Ppoly_t *makeObstacle(node_t * n, expand_t*, bool);
NEATOPROCS_API void makeSelfArcs(edge_t * e, int stepx);
NEATOPROCS_API void makeSpline(edge_t *, Ppoly_t **, int, boolean);
NEATOPROCS_API void make_spring(graph_t *, Agnode_t *, Agnode_t *, double);
* The polygon has its vertices in CW order.
*
*/
-Ppoly_t *makeObstacle(node_t * n, expand_t* pmargin, boolean isOrtho)
+Ppoly_t *makeObstacle(node_t * n, expand_t* pmargin, bool isOrtho)
{
Ppoly_t *obs;
polygon_t *poly;