*operation* void addReverseAltEdges()
  *wrapper* Cd_graph
    *prefix*
    (@
      adjacencies->addReverseAltEdges(this);
    @)

*operation* void addReverseAltEdges(Cd_graph *cdgraph)
  *wrapper* Adjacency_Nlist
    *prefix*
    (@
       Adjacency_list_iterator next_arg(*this);
       Adjacency* each_arg;

       while (each_arg = next_arg())
         each_arg->addReverseAltEdges(cdgraph);
    @)
  *wrapper* Adjacency
    *prefix*
    (@
       this->set_superclasses(cdgraph->ImmSuperclasses (source));
    @)

*operation* int AsAlternative(Vertex *vertex)
  *wrapper* Neighbors
    *prefix*
    (@
       return_val = 0;
    @)
  *wrapper* Neighbors_wc
    *prefix*
    (@
       return_val = 0;
    @)
  *wrapper* Alternat_ns
    *prefix*
    (@
       return_val = alternat_ns->AsAlternative(vertex);
    @)
  *wrapper* Term_Barlist
    *prefix*
    (@
       Term_list_iterator next(*this);
       Term_              each;

       while (each = next())
         if (each->get_vertex()->equal(vertex))
	    break;

       if (each)
          return_val = 1;
       else
	  return_val = 0;
    @)

*operation* Vertex_List* ImmSuperclasses(Vertex *vertex)
  *wrapper* Cd_graph
    *prefix*
    (@
       return_val = adjacencies->ImmSuperclasses(vertex);
    @)
  *wrapper* Adjacency_Nlist
    *prefix*
    (@
       Vertex_List *result = new Vertex_List();
       Adjacency_list_iterator next_arg(*this);
       Adjacency* each_arg;

       while (each_arg = next_arg())
          each_arg->ImmSuperclasses(result,vertex);
       return_val = result;
    @)

*operation* void ImmSuperclasses(Vertex_List* result,Vertex *vertex)
  *wrapper* Adjacency
    *prefix*
    (@
       if (ns->AsAlternative(vertex))
         result->append((Vertex*)source->g_copy());
    @)