for (i = 0; i < nG; i++) {
for (j = 0; j < i; j++) {
f = Spring_coeff / (D[i][j] * D[i][j]);
-#ifndef WITH_CGRAPH
- if ((e = agfindedge(G, GD_neato_nlist(G)[i],
- GD_neato_nlist(G)[j])))
-#else /* WITH_CGRAPH */
- if ((e = agedge(G, GD_neato_nlist(G)[i],
- GD_neato_nlist(G)[j],(char*)0,0)))
-#endif /* WITH_CGRAPH */
+ if ((e = agfindedge(G, GD_neato_nlist(G)[i], GD_neato_nlist(G)[j])))
f = f * ED_factor(e);
K[i][j] = K[j][i] = f;
}
twopi_init_graph(g);
s = agget(g, "root");
if (s && (*s != '\0')) {
-#ifndef WITH_CGRAPH
ctr = agfindnode(g, s);
-#else /* WITH_CGRAPH */
- ctr = agnode(g, s,0);
-#endif /* WITH_CGRAPH */
if (!ctr) {
agerr(AGWARN, "specified root node \"%s\" was not found.", s);
agerr(AGPREV, "Using default calculation for root node\n");
{
if (!t || !h)
return NULL;
-#ifndef WITH_CGRAPH
return agfindedge(agraphof(t), t, h);
-#else
- return agedge(agraphof(t), t, h, NULL, 0);
-#endif
}
Agsym_t *findattr(Agraph_t *g, char *name)
mg = agraphof(ng);
if (!mg)
return NULL;
-#ifndef WITH_CGRAPH
e = agfindedge(mg, ng, nsg);
-#else
- e = agedge(mg, ng, nsg, NULL, 0);
-#endif
if (!e)
return NULL;
e = agnxtout(mg, e);
mg = agraphof(ng);
if (!mg)
return NULL;
-#ifndef WITH_CGRAPH
e = agfindedge(mg, nsg, ng);
-#else
- e = agedge(mg, nsg, ng, NULL, 0);
-#endif
if (!e)
return NULL;
e = agnxtin(mg, e);
if (!n || !h)
return NULL;
g = agraphof(n);
-#ifndef WITH_CGRAPH
e = agfindedge(g, n, h);
-#else
- e = agedge(g, n, h, NULL, 0);
-#endif
if (!e)
return NULL;
do {
if (!n || !t)
return NULL;
-#ifndef WITH_CGRAPH
e = agfindedge(g, t, n);
-#else
- e = agedge(g, t, n, NULL, 0);
-#endif
if (!e)
return NULL;
do {
argv[0], " findedge tailnodename headnodename\"", NULL);
return TCL_ERROR;
}
-#ifndef WITH_CGRAPH
if (!(tail = agfindnode(g, argv[2]))) {
-#else
- if (!(tail = agnode(g, argv[2], 0))) {
-#endif
Tcl_AppendResult(interp, "Tail node \"", argv[2], "\" not found.", NULL);
return TCL_ERROR;
}
-#ifndef WITH_CGRAPH
if (!(head = agfindnode(g, argv[3]))) {
-#else
- if (!(head = agnode(g, argv[3], 0))) {
-#endif
Tcl_AppendResult(interp, "Head node \"", argv[3], "\" not found.", NULL);
return TCL_ERROR;
}
-#ifndef WITH_CGRAPH
if (!(e = agfindedge(g, tail, head))) {
-#else
- if (!(e = agedge(g, tail, head, NULL, 0))) {
-#endif
Tcl_AppendResult(interp, "Edge \"", argv[2], " - ", argv[3], "\" not found.", NULL);
return TCL_ERROR;
}
Tcl_AppendResult(interp, "wrong # args: should be \"", argv[0], " findnode nodename\"", NULL);
return TCL_ERROR;
}
-#ifndef WITH_CGRAPH
if (!(n = agfindnode(g, argv[2]))) {
-#else
- if (!(n = agnode(g, argv[2], 0))) {
-#endif
Tcl_AppendResult(interp, "Node not found.", NULL);
return TCL_ERROR;
}