passed to gvLayout again with core dumping.
circular_cleanup_node(n);
}
free(GD_neato_nlist(g));
+ memset(&(g->u), 0, sizeof(Agraphinfo_t));
}
for (c = 1; c <= GD_n_cluster(g); c++) {
clust = GD_clust(g)[c];
+ GD_cluster_was_collapsed(clust) = FALSE;
dot_cleanup(clust);
}
free(GD_rank(g)[i].v);
free(GD_rank(g));
}
+ memset(&(g->u), 0, sizeof(Agraphinfo_t));
}
/* delete the layout (but retain the underlying graph) */
cleanup_subgs(g);
free(GD_neato_nlist(g));
free(GD_alg(g));
+ memset(&(g->u), 0, sizeof(Agraphinfo_t));
}
void fdp_cleanup(graph_t * g)
{
if (Nop || (Pack < 0))
free_scan_graph(g);
+ memset(&(g->u), 0, sizeof(Agraphinfo_t));
}
void neato_cleanup(graph_t * g)
static void twopi_cleanup_graph(graph_t * g)
{
free(GD_neato_nlist(g));
+ memset(&(g->u), 0, sizeof(Agraphinfo_t));
}
void twopi_cleanup(graph_t * g)