ND_mark(n) = ND_onstack(n) = FALSE;
for (n = agfstnode(g); n; n = agnxtnode(g, n))
checkdfs(g, n);
- for (n = agfstnode(g); n; n = agnxtnode(g, n))
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
if (ND_mark(n) == FALSE) {
fprintf (stderr, "graph is unconnected\n");
break;
void showpath(path * p)
{
int i;
- point LL, UR;
+ pointf LL, UR;
fprintf(stderr, "%%!PS\n");
for (i = 0; i < p->nbox; i++) {
LL = p->boxes[i].LL;
UR = p->boxes[i].UR;
fprintf(stderr,
- "newpath %d %d moveto %d %d lineto %d %d lineto %d %d lineto closepath stroke\n",
+ "newpath %.04f %.04f moveto %.04f %.04f lineto %.04f %.04f lineto %.04f %.04f lineto closepath stroke\n",
LL.x, LL.y, UR.x, LL.y, UR.x, UR.y, LL.x, UR.y);
}
fprintf(stderr, "showpage\n");
return 0;
}
-#ifdef DEBUG
+#ifdef DEVDBG
#include <psdbg.c>
#endif
(v, w, trip->poly.ps[tp->v.i], trip->poly.ps[tp->v.j], ip))
return 0;
}
-#ifdef DEBUG
+#ifdef DEVDBG
psInit();
psComment ("Failure in triPoint");
psColor("0 0 1");
free(rtr);
}
-#ifdef DEBUG
+#ifdef DEVDBG
static void
prTriPoly (tripoly_t *poly, int si, int ei)
{