g++ [flags ...] file ...

#include <BiGraphVertex.h>;

BiGraphVertex(const BiGraphVertex<TObject>& copy_vertex);
boolean setParentGraph(Graph<TObject>* parent);
BiGraph<TObject>* getParentGraph() const;
static boolean initCleanUp();
static boolean finishCleanUp();

// declare the graph vertex object
//
BiGraphVertex<Char>* vertex[5];
Char* chr[5];

for (long i=0; i<5; i++) {
  chr[i] = new Char((unichar)i);
  vertex[i] = new BiGraphVertex<Char>(false);
  vertex[i]->setItem(chr[i]);
}

• none.

• This example shows how to manipulate item, arc and parent graph of a BiGraphVertex:

  // create a set of test characters
  //
  Char* chars[128];
  for (long i = 0; i < 128; i++) {
    chars[i] = new Char((unichar)i);
  }
    
  // create two graphs to manipulate
  //
  Graph<Char> graph1(false);
  Graph<Char> graph2(false);
  
  // create an array of vertices to test
  //
  BiGraphVertex<Char>* vertices[128];
  for (long i = 0; i < 128; i++) {
  
    vertices[i] = new BiGraphVertex<Char>(false);
  
    // set the item in each vertex
    //
    vertices[i]->setItem(chars[i]);
  }
  
  // make sure the setParentGraph and getParentGraph methods work
  //
  // assign one of the two graphs to each node
  //
  for (long i = 0; i < 64; i++) {
    if (!vertices[i]->setParentGraph(&graph1)) {
      Console::put(L"Error in setParentGraph");
    }
  }
  for (long i = 64; i < 128; i++) {
    if (!vertices[i]->setParentGraph(&graph2)) {
       Console::put(L"Error in setParentGraph");
    }
  }
  
  // make sure that the proper graph was assigned
  //
  for (long i = 0; i < 64; i++) {
    if ((vertices[i]->getParentGraph() != &graph1) ||
        (vertices[128 - i - 1]->getParentGraph() != &graph2) ||
        (vertices[i]->getParentGraph() ==
         vertices[128 - i - 1]->getParentGraph())) {
       Console::put(L"Error in getParentGraph");
    }
  }