*operation* void get_inherited_parts(Vertex*              avertex,
				     Vertex_List*         result,
				     Path_constraint_exp* c)
  *wrapper* Cd_graph
    *prefix*
    (@
       adjacencies->get_inherited_parts(avertex,result,c);
    @)
  *wrapper* Adjacency_Nlist
    *prefix*
    (@
       Adjacency_list_iterator next(*this);
       Adjacency*              each;

       while (each = next())
         {
           if (each->get_source()->equal(avertex))
             {
               each->get_inherited_parts(this,result,c);
               return;
             }
         }
    @)

*operation* void get_inherited_parts(
                                Adjacency_Nlist*     adjs,
				Vertex_List*         result,
				Path_constraint_exp* c)
  *wrapper* Adjacency
    *prefix*
    (@
       if (superclasses)
         superclasses->get_inherited_parts(adjs, result, c);
    @)
  *wrapper* Vertex_List
    *prefix*
    (@
       static DemString * mark = new DemString("bypassing");
       Vertex_list_iterator     next(*this);
       Vertex*                  each;

       while (each = next())
         if (!mark->g_equal(each->get_bypassing()))
           adjs->get_target_vertices(each,result,c);
    @)


*operation* void get_target_vertices(Vertex*              avertex,
				     Vertex_List*         result,
				     Path_constraint_exp* c)
  *wrapper* Adjacency_Nlist 
    *prefix*
    (@
       Adjacency_list_iterator next(*this);
       Adjacency*              each;

       while (each = next()) 
         { 
           if (each->get_source()->equal(avertex)) 
             { 
               each->get_inherited_parts(this,result,c);   
               each->get_target_vertices(this,each->get_source(),result,c);
               return; 
             } 
         }   
    @)

*operation* void get_target_vertices(Adjacency_Nlist *adjs,
				     Vertex *   source,
				     Vertex_List* result,
				     Path_constraint_exp* c)
  *wrapper*    Adjacency
    *prefix*
    (@
       ns->get_target_vertices(adjs, source, result, c);
    @)
  *wrapper* Neighbors
    *prefix*
    (@
    @)
  *wrapper* Neighbors_wc
    *prefix*
    (@
       construct_ns->get_target_vertices(adjs, source, result, c);
    @)
  *wrapper* Any_vertex_List
    *prefix*
    (@
       Any_vertex_list_iterator  next(*this);
       Any_vertex*               each;

       while (each = next())
         each->get_target_vertices(adjs, source, result, c);
    @)
  *wrapper* Any_vertex
    *prefix*
    (@
    @)
  *wrapper* Opt_labeled_term
    *prefix*
    (@
    @)
  *wrapper* Optional_term
    *prefix*
    (@
       opt->get_target_vertices(adjs, source, result, c);
    @)
  *wrapper* Opt_labeled_term_Sandwich
    *prefix*
    (@
       inner->get_target_vertices(adjs, source, result, c);
    @)
  *wrapper* Labeled
    *prefix*
    (@
       if ( c && !c->isXConsEdgeInTheList(source,this->get_label_name(),this->get_vertex()))
         result->append(this->get_vertex()->get_vertex());
    @)
  *wrapper* Regular
    *prefix*
    (@
       derror('i',1," unexpected visit at Regular::get_target_vertices\n");
       abort();
    @)