typedef struct fdpParms_s fdpParms_t;
extern void fdp_layout(Agraph_t * g);
- extern void fdp_nodesize(node_t *, boolean);
- extern void fdp_init_graph(Agraph_t * g);
- extern void fdp_init_node_edge(Agraph_t * g);
extern void fdp_cleanup(Agraph_t * g);
+ extern void fdp_init_node_edge(graph_t * g);
#ifdef __cplusplus
}
c = '\0';
if (sscanf(p, "%lf,%lf%c", pvec, pvec + 1, &c) >= 2) {
if (PSinputscale > 0.0) {
- int i;
- for (i = 0; i < NDIM; i++)
- pvec[i] = pvec[i] / PSinputscale;
+ int j;
+ for (j = 0; j < NDIM; j++)
+ pvec[j] = pvec[j] / PSinputscale;
}
ND_pinned(np) = P_SET;
if ((c == '!')
if (isRoot || isEmpty)
margin = 0;
else
- margin = late_int (g, G_margin, CL_OFFSET, 0);
+ margin = late_int (rg, G_margin, CL_OFFSET, 0);
pt.x = -bb.LL.x + margin;
pt.y = -bb.LL.y + margin + GD_border(rg)[BOTTOM_IX].y;
bb.LL.x = 0;
* Initialize graph-dependent information and
* state variable.s
*/
-void init_info(graph_t * g, layout_info * infop)
+static void init_info(graph_t * g, layout_info * infop)
{
- infop->G_coord = agattr(g,AGRAPH, "coords", NULL);
- infop->G_width = agattr(g,AGRAPH, "width", NULL);
- infop->G_height = agattr(g, AGRAPH,"height", NULL);
+ infop->G_coord = agattr(g, AGRAPH, "coords", NULL);
+ infop->G_width = agattr(g, AGRAPH, "width", NULL);
+ infop->G_height = agattr(g, AGRAPH, "height", NULL);
infop->rootg = g;
infop->gid = 0;
infop->pack.mode = getPackInfo(g, l_node, CL_OFFSET / 2, &(infop->pack));
}
}
-void fdp_init_graph(Agraph_t * g)
+static void fdp_init_graph(Agraph_t * g)
{
setEdgeType (g, ET_LINE);
GD_alg(g) = (void *) NEW(gdata); /* freed in cleanup_graph */
fdp_init_node_edge(g);
}
-void fdpLayout(graph_t * g)
+static void fdpLayout(graph_t * g)
{
layout_info info;
double size;
Agnode_t *np;
int n_pos = 0; /* no. of nodes with position info */
- box bb = { {0, 0}, {0, 0} };
+ boxf bb = { {0, 0}, {0, 0} };
pointf ctr; /* center of boundary ellipse */
long local_seed;
double PItimes2 = M_PI * 2.0;