remove unnecessary 'ND_alg' casts

diff --git a/lib/dotgen/dotsplines.c b/lib/dotgen/dotsplines.c
index d15720467f2689f42985e26eb71080f4f5b12a39..a32ea004f5b840c22406d6e68841f8151ee6f036 100644 (file)
--- a/lib/dotgen/dotsplines.c
+++ b/lib/dotgen/dotsplines.c
@@ -290,7 +290,7 @@ setEdgeLabelPos (graph_t * g)
     for (n = GD_nlist(g); n; n = ND_next(n)) {
        if (ND_node_type(n) == VIRTUAL) {
            if (ND_alg(n)) {   // label of non-adjacent flat edge
-               edge_t* fe = (edge_t*)ND_alg(n);
+               edge_t* fe = ND_alg(n);
                l = ED_label(fe);
                assert (l);
                l->pos = ND_coord(n);
@@ -372,7 +372,7 @@ static void _dot_splines(graph_t * g, int normalize)
                 * the label.
                 */
            if (ND_alg(n)) {
-               edge_t* fe = (edge_t*)ND_alg(n);
+               edge_t* fe = ND_alg(n);
                assert (ED_label(fe));
                ED_label(fe)->pos = ND_coord(n);
                ED_label(fe)->set = true;

diff --git a/lib/dotgen/mincross.c b/lib/dotgen/mincross.c
index 85bd4f46163aa07c42caf63c688bc0eaf09842be..fa91f91ac06c9bbc6ba967130d5f0a9b35300021 100644 (file)
--- a/lib/dotgen/mincross.c
+++ b/lib/dotgen/mincross.c
@@ -303,7 +303,7 @@ checkLabelOrder (graph_t* g)
        rk = GD_rank(g)+r;
        for (j = 0; j < rk->n; j++) {
            u = rk->v[j];
-           if ((e = (edge_t*)ND_alg(u))) {
+           if ((e = ND_alg(u))) {
                if (!lg) lg = agopen ("lg", Agstrictdirected, 0);
                snprintf(buf, sizeof(buf), "%d", j);
                n = agnode(lg, buf, 1);

diff --git a/lib/dotgen/position.c b/lib/dotgen/position.c
index 1a3578d981d6e64077044ee2d0432a425ca83d11..9637ac725c24335862e3e935ff88e743fc705e49 100644 (file)
--- a/lib/dotgen/position.c
+++ b/lib/dotgen/position.c
@@ -260,7 +260,7 @@ make_LR_constraints(graph_t * g)
            }
 
            /* constraints from labels of flat edges on previous rank */
-           if ((e = (edge_t*)ND_alg(u))) {
+           if ((e = ND_alg(u))) {
                e0 = ND_save_out(u).list[0];
                e1 = ND_save_out(u).list[1];
                if (ND_order(aghead(e0)) > ND_order(aghead(e1))) {

diff --git a/lib/neatogen/constraint.c b/lib/neatogen/constraint.c
index ebf8a8f1e248d5d10e21cd51c94b52faa2e8bf19..8d143cb094a4cf1f867fd5a33db90b2118d3632d 100644 (file)
--- a/lib/neatogen/constraint.c
+++ b/lib/neatogen/constraint.c
@@ -137,10 +137,10 @@ static void mapGraphs(graph_t * g, graph_t * cg, distfn dist)
     int delta;
 
     for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
-       tp = (nitem *) ND_alg(n);
+       tp = ND_alg(n);
        t = tp->cnode;
        for (e = agfstout(g, n); e; e = agnxtout(g, e)) {
-           hp = (nitem *) ND_alg(aghead(e));
+           hp = ND_alg(aghead(e));
            delta = dist(&tp->bb, &hp->bb);
            h = hp->cnode;
            ce = agedge(cg, t, h, NULL, 1);