static int G_cnt; /* No. of -G arguments */
static int G_sz; /* Storage size for -G arguments */
static attr_t *G_args; /* Storage for -G arguments */
-static int doPack; /* Do packing if true */
+static bool doPack; /* Do packing if true */
static char* gname = "root";
#define NEWNODE(n) ((node_t*)ND_alg(n))
* libcommon. If fill is true, we use init_nop (neato -n) to
* read in attributes relevant to the layout.
*/
-static void init_graph(Agraph_t * g, boolean fill, GVC_t* gvc)
-{
+static void init_graph(Agraph_t *g, bool fill, GVC_t *gvc) {
int d;
node_t *n;
edge_t *e;
}
/* do common initialization. This will handle root's label. */
- init_graph(root, FALSE, gvc);
+ init_graph(root, false, gvc);
State = GVSPLINES;
gnames = dtopen(&pairdisc, Dtoset);