AM_CFLAGS = -D_BLD_common=1
endif
-if WITH_CGRAPH
-else
pkginclude_HEADERS = arith.h geom.h color.h types.h textpara.h usershape.h
noinst_HEADERS = render.h utils.h memory.h \
geomprocs.h colorprocs.h colortbl.h entities.h globals.h \
logic.h const.h macros.h htmllex.h htmltable.h pointset.h
noinst_LTLIBRARIES = libcommon_C.la
-endif
if WITH_CODEGENS
CODEGENS = $(GD_CODEGENS) diagen.c hpglgen.c mifgen.c mpgen.c picgen.c vtxgen.c
edge_t *e;
t = GD_nlist(g);
for (h = ND_next(t); h; h = ND_next(h)) {
+#ifdef WITH_CGRAPH
+ if (!agedge(g, t, h, (char *)NULL, FALSE)) {
+#else
if (!agfindedge(g, t, h)) {
+#endif
e = agedge(g, t, h);
ED_minlen(e) = 0;
elist_append(e, ND_out(t));
typedef int (*qsort_cmpf) (const void *, const void *);
typedef int (*bsearch_cmpf) (const void *, const void *);
+#ifdef WITH_CGRAPH
+ typedef struct Agraph_s graph_t;
+ typedef struct Agnode_s node_t;
+ typedef struct Agedge_s edge_t;
+ typedef struct Agsym_s attrsym_t;
+#else
typedef struct Agraph_t graph_t;
-
typedef struct Agnode_t node_t;
typedef struct Agedge_t edge_t;
-
typedef struct Agsym_t attrsym_t;
+#endif
typedef struct htmllabel_t htmllabel_t;
#define ED_weight(e) (e)->u.weight
#define ED_xpenalty(e) (e)->u.xpenalty
-#if WITH_CGRAPH
+#ifdef WITH_CGRAPH
#include "cgraph.h"
#else
#include "graph.h"
n0 = agfindnode(g, s0);
n1 = agfindnode(g, s1);
if (n0 && n1)
+#ifdef WITH_CGRAPH
+ return agedge(g, n0, n1, (char *)NULL, FALSE);
+#else
return agfindedge(g, n0, n1);
+#endif
else
return NULL;
}