internal/ccall/cgraph/edge.c
int agedgeseqcmpf(Dict_t * d, void *arg_e0, void *arg_e1, Dtdisc_t * disc)
{
    Agedge_t *e0, *e1;

    NOTUSED(d);
    e0 = arg_e0;
    e1 = arg_e1;
    NOTUSED(disc);
    assert(arg_e0 && arg_e1);

    if (e0->node != e1->node) {
        if (AGSEQ(e0->node) < AGSEQ(e1->node)) return -1;
        if (AGSEQ(e0->node) > AGSEQ(e1->node)) return 1;
    }
    else {
        if (AGSEQ(e0) < AGSEQ(e1)) return -1;
        if (AGSEQ(e0) > AGSEQ(e1)) return 1;
    }
    return 0;
}
/* edge comparison.  for ordered traversal. */
edge comparison.  for ordered traversal.
edge comparison . for ordered traversal .
int agedgeseqcmpf(Dict_t * d, void *arg_e0, void *arg_e1, Dtdisc_t * disc)
{
    Agedge_t *e0, *e1;
    NOTUSED(d);
    e0 = arg_e0;
    e1 = arg_e1;
    NOTUSED(disc);
    assert(arg_e0 && arg_e1);
    if (e0->node != e1->node) {
        if (AGSEQ(e0->node) < AGSEQ(e1->node)) return -1;
        if (AGSEQ(e0->node) > AGSEQ(e1->node)) return 1;
    }
    else {
        if (AGSEQ(e0) < AGSEQ(e1)) return -1;
        if (AGSEQ(e0) > AGSEQ(e1)) return 1;
    }
    return 0;
}
int agedgeseqcmpf ( Dict_t * d , void * arg_e0 , void * arg_e1 , Dtdisc_t * disc ) { Agedge_t * e0 , * e1 ; NOTUSED ( d ) ; e0 = arg_e0 ; e1 = arg_e1 ; NOTUSED ( disc ) ; assert ( arg_e0 && arg_e1 ) ; if ( e0 -> node != e1 -> node ) { if ( AGSEQ ( e0 -> node ) < AGSEQ ( e1 -> node ) ) return -1 ; if ( AGSEQ ( e0 -> node ) > AGSEQ ( e1 -> node ) ) return 1 ; } else { if ( AGSEQ ( e0 ) < AGSEQ ( e1 ) ) return -1 ; if ( AGSEQ ( e0 ) > AGSEQ ( e1 ) ) return 1 ; } return 0 ; }
edge comparison.
edge comparison .