n2 = aghead(ep);
if (n2 == n)
n2 = agtail(ep);
-#ifndef WITH_CGRAPH
ex = agfindedge(g, n1, n2);
-#else /* WITH_CGRAPH */
- ex = agedge(g, n1, n2, NULL, 0);
-#endif /* WITH_CGRAPH */
if (ex) {
has_pair_edge = 1;
if (n1 < n2) { /* count edge only once */
/* check to see if there is a node which is set to be the root
*/
if (state->rootname) {
-#ifndef WITH_CGRAPH
root = agfindnode(g, state->rootname);
-#else /* WITH_CGRAPH */
- root = agnode(g, state->rootname,0);
-#endif /* WITH_CGRAPH */
}
if (!root && state->N_root) {
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
edge_t *f;
int s0, e0;
/* pick up arrowhead of opposing edge */
-#ifdef WITH_CGRAPH
- f = agedge(agraphof(aghead(e)), aghead(e), agtail(e), (char *)NULL, FALSE);
-#else
f = agfindedge(agraphof(aghead(e)), aghead(e), agtail(e));
-#endif
arrow_flags(f, &s0, &e0);
*eflag = *eflag | s0;
*sflag = *sflag | e0;