p->p.y = y;
prev->next = p;
p->next = curr;
-
- /* This test should be unnecessary */
- /* if (!sorted(origin,ip->verts)) */
- /* error (ip,s,x,y); */
-
}
*cn = agnnodes(subg);
cdata->nvars += *cn;
c = *cs++ = N_GNEW(*cn++,int);
- /* fprintf(stderr,"Cluster with %d nodes...\n",agnnodes(subg)); */
for (n = agfstnode(subg); n; n = agnxtnode(subg, n)) {
node_t *gn;
int ind = 0;
if(AGSEQ(gn)==AGSEQ(n)) break;
ind++;
}
- /* fprintf(stderr," node=%s, id=%d, ind=%d\n",agnameof(n),n->id,ind); */
*c++=ind;
assigned[ind]=TRUE;
cdata->ntoplevel--;
fprintf(stderr, "convert graph: ");
start_timer();
fprintf(stderr, "majorization\n");
-// fprintf(stderr, "%i\n", count_nodes(g));
}
gp = makeGraphData(g, nv, &ne, mode, model, &nodes);