#include "pp.h"



void Cd_graph::addReverseAltEdges(  )
{
  DEM_TRACE("Cd_graph","void Cd_graph::addReverseAltEdges()");
  // prefix class wrappers

      adjacencies->addReverseAltEdges(this);
    

  // suffix class wrappers

}

void Adjacency_Nlist::addReverseAltEdges( Cd_graph*  cdgraph )
{
  DEM_TRACE("Adjacency_Nlist","void Adjacency_Nlist::addReverseAltEdges(Cd_graph*  cdgraph)");
  // prefix class wrappers

       Adjacency_list_iterator next_arg(*this);
       Adjacency* each_arg;

       while (each_arg = next_arg())
         each_arg->addReverseAltEdges(cdgraph);
    

  // suffix class wrappers

}

void Adjacency::addReverseAltEdges( Cd_graph*  cdgraph )
{
  DEM_TRACE("Adjacency","void Adjacency::addReverseAltEdges(Cd_graph*  cdgraph)");
  // prefix class wrappers

       this->set_superclasses(cdgraph->ImmSuperclasses (source));
    

  // suffix class wrappers

}

int Neighbors::AsAlternative( Vertex*  vertex )
{
  DEM_TRACE("Neighbors","int Neighbors::AsAlternative(Vertex*  vertex)");
  int return_val;

  this->AsAlternative_( return_val, vertex  );
  return return_val;
}
void Neighbors::AsAlternative_( int& return_val, Vertex*  vertex )
{
  DEM_TRACE("Neighbors","void Neighbors::AsAlternative_(int& return_val,Vertex*  vertex)");
  // prefix class wrappers

       return_val = 0;
    

  // suffix class wrappers

}

int Neighbors_wc::AsAlternative( Vertex*  vertex )
{
  DEM_TRACE("Neighbors_wc","int Neighbors_wc::AsAlternative(Vertex*  vertex)");
  int return_val;

  this->AsAlternative_( return_val, vertex  );
  return return_val;
}
void Neighbors_wc::AsAlternative_( int& return_val, Vertex*  vertex )
{
  DEM_TRACE("Neighbors_wc","void Neighbors_wc::AsAlternative_(int& return_val,Vertex*  vertex)");
  // prefix class wrappers

       return_val = 0;
    

  // suffix class wrappers

}

int Alternat_ns::AsAlternative( Vertex*  vertex )
{
  DEM_TRACE("Alternat_ns","int Alternat_ns::AsAlternative(Vertex*  vertex)");
  int return_val;

  this->AsAlternative_( return_val, vertex  );
  return return_val;
}
void Alternat_ns::AsAlternative_( int& return_val, Vertex*  vertex )
{
  DEM_TRACE("Alternat_ns","void Alternat_ns::AsAlternative_(int& return_val,Vertex*  vertex)");
  // prefix class wrappers

       return_val = alternat_ns->AsAlternative(vertex);
    

  // suffix class wrappers

}

int Term_Barlist::AsAlternative( Vertex*  vertex )
{
  DEM_TRACE("Term_Barlist","int Term_Barlist::AsAlternative(Vertex*  vertex)");
  int return_val;

  this->AsAlternative_( return_val, vertex  );
  return return_val;
}
void Term_Barlist::AsAlternative_( int& return_val, Vertex*  vertex )
{
  DEM_TRACE("Term_Barlist","void Term_Barlist::AsAlternative_(int& return_val,Vertex*  vertex)");
  // prefix class wrappers

       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;
    

  // suffix class wrappers

}

Vertex_List*  Cd_graph::ImmSuperclasses( Vertex*  vertex )
{
  DEM_TRACE("Cd_graph","Vertex_List*  Cd_graph::ImmSuperclasses(Vertex*  vertex)");
  Vertex_List*  return_val;

  this->ImmSuperclasses_( return_val, vertex  );
  return return_val;
}
void Cd_graph::ImmSuperclasses_( Vertex_List* & return_val, Vertex*  vertex )
{
  DEM_TRACE("Cd_graph","void Cd_graph::ImmSuperclasses_(Vertex_List* & return_val,Vertex*  vertex)");
  // prefix class wrappers

       return_val = adjacencies->ImmSuperclasses(vertex);
    

  // suffix class wrappers

}

Vertex_List*  Adjacency_Nlist::ImmSuperclasses( Vertex*  vertex )
{
  DEM_TRACE("Adjacency_Nlist","Vertex_List*  Adjacency_Nlist::ImmSuperclasses(Vertex*  vertex)");
  Vertex_List*  return_val;

  this->ImmSuperclasses_( return_val, vertex  );
  return return_val;
}
void Adjacency_Nlist::ImmSuperclasses_( Vertex_List* & return_val, Vertex*  vertex )
{
  DEM_TRACE("Adjacency_Nlist","void Adjacency_Nlist::ImmSuperclasses_(Vertex_List* & return_val,Vertex*  vertex)");
  // prefix class wrappers

       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;
    

  // suffix class wrappers

}

void Adjacency::ImmSuperclasses( Vertex_List*  result,Vertex*  vertex )
{
  DEM_TRACE("Adjacency","void Adjacency::ImmSuperclasses(Vertex_List*  result,Vertex*  vertex)");
  // prefix class wrappers

       if (ns->AsAlternative(vertex))
         result->append((Vertex*)source->g_copy());
    

  // suffix class wrappers

}