static void post(Agraph_t * g)
{
Agnode_t *v;
Agnode_t *prev;
char buf[256];
char dflt[256];
Agsym_t *sym;
Agsym_t *psym;
double dist, oldmax;
double maxdist = 0.0; /* maximum "finite" distance */
sym = agattr(g, AGNODE, "dist", "");
if (doPath)
psym = agattr(g, AGNODE, "prev", "");
if (setall)
sprintf(dflt, "%.3lf", HUGE);
for (v = agfstnode(g); v; v = agnxtnode(g, v)) {
dist = getdist(v);
if (dist) {
dist--;
sprintf(buf, "%.3lf", dist);
agxset(v, sym, buf);
if (doPath && (prev = getprev(v)))
agxset(v, psym, agnameof(prev));
if (maxdist < dist)
maxdist = dist;
} else if (setall)
agxset(v, sym, dflt);
}
sym = agattrsym(g, "maxdist");
if (sym) {
if (!setall) {
/* if we are preserving distances in other components,
* check previous value of maxdist.
*/
oldmax = atof(agxget(g, sym));
if (oldmax > maxdist)
maxdist = oldmax;
}
sprintf(buf, "%.3lf", maxdist);
agxset(g, sym, buf);
} else {
sprintf(buf, "%.3lf", maxdist);
agattr(g, AGRAPH, "maxdist", buf);
}
agclean(g, AGNODE, "dijkstra");
agclean(g, AGEDGE, "dijkstra");
}
static void
dot_cleanup_graph(graph_t * g)
{
int i, c;
graph_t *clust;
for (c = 1; c <= GD_n_cluster(g); c++) {
clust = GD_clust(g)[c];
GD_cluster_was_collapsed(clust) = FALSE;
dot_cleanup(clust);
}
if (GD_clust(g)) free (GD_clust(g));
if (GD_rankleader(g)) free (GD_rankleader(g));
free_list(GD_comp(g));
if (GD_rank(g)) {
for (i = GD_minrank(g); i <= GD_maxrank(g); i++)
free(GD_rank(g)[i].av);
if (GD_minrank(g) == -1)
free(GD_rank(g)-1);
else
free(GD_rank(g));
}
if (g != agroot(g))
#ifndef WITH_CGRAPH
memset(&(g->u), 0, sizeof(Agraphinfo_t));
#else /* WITH_CGRAPH */
agclean(g,AGRAPH,"Agraphinfo_t");
#endif /* WITH_CGRAPH */
}
static void twopi_cleanup_graph(graph_t * g)
{
free(GD_neato_nlist(g));
if (g != agroot(g))
#ifndef WITH_CGRAPH
memset(&(g->u), 0, sizeof(Agraphinfo_t));
#else /* WITH_CGRAPH */
agclean(g,AGRAPH,"Agraphinfo_t");
#endif /* WITH_CGRAPH */
}
void graph_cleanup(graph_t *g)
{
if (GD_drawing(g) && GD_drawing(g)->xdots)
freeXDot ((xdot*)GD_drawing(g)->xdots);
if (GD_drawing(g) && GD_drawing(g)->id)
free (GD_drawing(g)->id);
free(GD_drawing(g));
GD_drawing(g) = NULL;
free_label(GD_label(g));
//FIX HERE , STILL SHALLOW
//memset(&(g->u), 0, sizeof(Agraphinfo_t));
agclean(g, AGRAPH,"Agraphinfo_t");
}
int gvToolTred(Agraph_t * g)
{
Agnode_t *n;
int warn = 0;
if (agisdirected(g)) {
aginit(g, AGNODE, "info", sizeof(Agmarknodeinfo_t), TRUE);
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
warn = dfs(n, NULL, warn);
}
agclean(g, AGNODE, "info");
} else {
fprintf(stderr, "warning: %s is not a directed graph, not attempting tred\n",
agnameof(g));
}
return 0; // FIXME - return proper errors
}
static void
dot_cleanup_node(node_t * n)
{
free_list(ND_in(n));
free_list(ND_out(n));
free_list(ND_flat_out(n));
free_list(ND_flat_in(n));
free_list(ND_other(n));
free_label(ND_label(n));
if (ND_shape(n))
ND_shape(n)->fns->freefn(n);
#ifndef WITH_CGRAPH
memset(&(n->u), 0, sizeof(Agnodeinfo_t));
#else /* WITH_CGRAPH */
agclean(agraphof(n), AGNODE,"Agnodeinfo_t");
#endif /* WITH_CGRAPH */
}
void clean_up(Agraph_t* g)
{
agclean(g, AGNODE, "nodedata");
free(nodes);
}
