model_server/edge/src/node.cxx
/*
 * find_edges_to_succs
 *      return an elist of this node's sucessors
 *      for successors in other subgraphs the main edge is returned,
 *      i.e. OUTDUMMY -> targetnode or OUTDUMMY -> INDUMMY
 *
 *      however, if *this* is a sugiyama layout dummy, only the edges
 *      to the *direct* successors are returned (not necessarily the main edges).
 */
find_edges_to_succs
return an elist of this node's sucessors
for successors in other subgraphs the main edge is returned,
i.e. OUTDUMMY -> targetnode or OUTDUMMY -> INDUMMY

however, if *this* is a sugiyama layout dummy, only the edges
to the *direct* successors are returned (not necessarily the main edges).
find_edges_to_succs return an elist of this node ' s sucessors for successors in other subgraphs the main edge is returned i . e . OUTDUMMY - > targetnode or OUTDUMMY - > INDUMMY however if * this * is a sugiyama layout dummy only the edges to the * direct * successors are returned ( not necessarily the main edges ) .
elist* 
node::find_edges_to_succs()
{
    elist* result = new elist;
    node* c;
    result->clean();
    slist_iterator_forw nextsucc(*(slist*) this->succlist);
    while (c = (node*) nextsucc()) {
        if ( ! this->isdummy() )
             result->append(this->getbackgraph()->find_edge(this, c));
        else {
             elist* ee = c->find_edges_to_succs();
             result->appendlist(ee);
             ee->clean();
        }
    }
    return result;
}
elist * node :: find_edges_to_succs ( ) { elist * result = new elist ; node * c ; result -> clean ( ) ; slist_iterator_forw nextsucc ( * ( slist * ) this -> succlist ) ; while ( c = ( node * ) nextsucc ( ) ) { if ( ! this -> isdummy ( ) ) result -> append ( this -> getbackgraph ( ) -> find_edge ( this , c ) ) ; else { elist * ee = c -> find_edges_to_succs ( ) ; result -> appendlist ( ee ) ; ee -> clean ( ) ; } } return result ; }
find_edges_to_succs
      return an elist of this node's sucessors
      for successors in other subgraphs the main edge is returned,
      i.e.
find_edges_to_succs return an elist of this node ' s sucessors for successors in other subgraphs the main edge is returned i . e .