double _statistics[10];
#endif
-static void sfdp_init_node(node_t * n)
-{
- common_init_node(n);
- ND_pos(n) = N_NEW(GD_ndim(n->graph), double);
- gv_nodesize(n, GD_flip(n->graph));
-}
-
static void sfdp_init_edge(edge_t * e)
{
common_init_edge(e);
#endif
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
- sfdp_init_node(n);
+ neato_init_node(n);
#if 0
FIX so that user positions works with multiscale
user_pos(N_pos, NULL, n, nnodes);
int rv;
if (!sym) return dflt;
+#ifdef WITH_CGRAPH
+ s = agxget (g, sym);
+#else
s = agxget (g, sym->index);
+#endif
if (isdigit(*s)) {
#if (HAVE_GTS || HAVE_TRIANGLE)
if ((v = atoi (s)) <= SMOOTHING_RNG)
int rv;
if (!sym) return dflt;
+#ifdef WITH_CGRAPH
+ s = agxget (g, sym);
+#else
s = agxget (g, sym->index);
+#endif
if (isdigit(*s)) {
if ((v = atoi (s)) <= QUAD_TREE_FAST && v >= QUAD_TREE_NONE){
rv = v;