#define UP 0
#define DOWN 1
-static bool samedir(edge_t * e, edge_t * f)
+static boolean samedir(edge_t * e, edge_t * f)
{
edge_t *e0, *f0;
* (ND_rank(e0->tail) - ND_rank(e0->head)) > 0);
}
-static bool downcandidate(node_t * v)
+static boolean downcandidate(node_t * v)
{
return ((ND_node_type(v) == VIRTUAL) && (ND_in(v).size == 1)
&& (ND_out(v).size == 1) && (ND_label(v) == NULL));
}
-static bool bothdowncandidates(node_t * u, node_t * v)
+static boolean bothdowncandidates(node_t * u, node_t * v)
{
edge_t *e, *f;
e = ND_in(u).list[0];
return FALSE;
}
-static bool upcandidate(node_t * v)
+static boolean upcandidate(node_t * v)
{
return ((ND_node_type(v) == VIRTUAL) && (ND_out(v).size == 1)
&& (ND_in(v).size == 1) && (ND_label(v) == NULL));
}
-static bool bothupcandidates(node_t * u, node_t * v)
+static boolean bothupcandidates(node_t * u, node_t * v)
{
edge_t *e, *f;
e = ND_out(u).list[0];
#if defined(_BLD_dot) && defined(_DLL)
# define extern __EXPORT__
#endif
- extern void dot_nodesize(Agnode_t *, bool);
+ extern void dot_nodesize(Agnode_t *, boolean);
extern void dot_concentrate(Agraph_t *);
extern void dot_mincross(Agraph_t *);
extern void dot_position(Agraph_t *);
static void adjustregularpath(path *, int, int);
static Agedge_t *bot_bound(Agedge_t *, int);
-static bool pathscross(Agnode_t *, Agnode_t *, Agedge_t *, Agedge_t *);
+static boolean pathscross(Agnode_t *, Agnode_t *, Agedge_t *, Agedge_t *);
#ifdef OBSOLETE
static void chooseflatsides(pathend_t *, pathend_t *, int *, int *, int *,
int *, int *, int *);
#define GROWEDGES (edges = ALLOC (n_edges + CHUNK, edges, edge_t*))
-static bool spline_merge(node_t * n)
+static boolean spline_merge(node_t * n)
{
return ((ND_node_type(n) == VIRTUAL)
&& ((ND_in(n).size > 1) || (ND_out(n).size > 1)));
}
-static bool swap_ends_p(edge_t * e)
+static boolean swap_ends_p(edge_t * e)
{
while (ED_to_orig(e))
e = ED_to_orig(e);
*/
static void
makeFlatEnd (spline_info_t* sp, path* P, node_t* n, edge_t* e, pathend_t* endp,
- bool isBegin)
+ boolean isBegin)
{
box b;
graph_t* g = n->graph;
*/
static void
makeBottomFlatEnd (spline_info_t* sp, path* P, node_t* n, edge_t* e,
- pathend_t* endp, bool isBegin)
+ pathend_t* endp, boolean isBegin)
{
box b;
graph_t* g = n->graph;
return rv;
}
-static bool pathscross(n0, n1, ie1, oe1)
+static boolean pathscross(n0, n1, ie1, oe1)
node_t *n0, *n1;
edge_t *ie1, *oe1;
{