fclose(fp);
}
-/* #define BOX */
-
-/* static char* pos_name = "pos"; */
-/* static char* lp_name = "lp"; */
-
double Scale = 0.0;
double ArrowScale = 1.0;
#define ARROW_LENGTH 10
#define ARROW_WIDTH 5
-/* #define DEGREES(rad) ((rad)/M_PI * 180.0) */
static char *plog = "%!PS-Adobe-2.0\n\n\
/Times-Roman findfont 14 scalefont setfont\n\
edge_t *e;
int nn;
int i;
- /* ndata* alg; */
aginit(g, AGNODE, "Agnodeinfo_t", sizeof(Agnodeinfo_t), TRUE);
processClusterEdges(g);
* add new nodes.
*/
nn = agnnodes(g);
- /* alg = N_NEW(nn, ndata); */
GD_neato_nlist(g) = N_NEW(nn + 1, node_t *);
for (i = 0, n = agfstnode(g); n; n = agnxtnode(g, n)) {
init_node (n);
- /* ND_alg(n) = alg + i; */
GD_neato_nlist(g)[i] = n;
ND_id(n) = i++;
}
}
}
initialPositions(g);
-
}
static void cleanup_subgs(graph_t * g)
{
int ov;
double force;
- /* double dout, din; */
#if defined(DEBUG) || defined(MS) || defined(ALT)
double dist;
#endif
- /* double factor; */
while (dist2 == 0.0) {
xdelta = 5 - rand() % 10;
int ov;
for (n1 = agnxtnode(g, n); n1; n1 = agnxtnode(g, n1)) {
ov = applyRep(n, n1);
-/* if (V && ov) */
- /* fprintf (stderr,"%s ov %s\n", n->name, n1->name); */
overlaps += ov;
}
for (e = agfstout(g, n); e; e = agnxtout(g, e)) {