Graph.cpp

Go to the documentation of this file.

#include "Graph.hpp"

namespace OA {

//--------------------------------------------------------------------
OA_ptr<BaseGraph::Node>
Graph::create_DFS_links (OA_ptr<BaseGraph::Node> n)
{/* AIS - commented out in order to get OA to compile
  OA_ptr<NodesIterator> neigh =
    (n.convert<Node>())->getNeighborNodesIterator();;
  OA_ptr<BaseGraph::Node> last = n;
  while (neigh->isValid()) {
    if (neigh->current()->dfs_succ.ptrEqual(0)) {
      OA_ptr<Node> n = neigh->current(); // Stupid Sun CC 5.4
      // cast is needed to access protected member
      (last.convert<Node>())->dfs_succ = n.convert<BaseGraph::Node>();
      last = create_DFS_links(neigh->current());
    }
    ++(*neigh);
  }
  // cast is needed to access protected member
  (last.convert<Node>())->dfs_succ = 0;
  return last;*/
}
//--------------------------------------------------------------------


//--------------------------------------------------------------------
OA_ptr<BaseGraph::Node>
Graph::create_BFS_links (OA_ptr<BaseGraph::Node> n)
{
  return n;
}
//--------------------------------------------------------------------


//--------------------------------------------------------------------
void
Graph::addNode (OA_ptr<Graph::Node> n)
{
  BaseGraph::addNode(n);
}
//--------------------------------------------------------------------


//--------------------------------------------------------------------
void
Graph::addEdge (OA_ptr<Graph::Edge> e)
{
  BaseGraph::addEdge(e);
  e->node1()->incident_edges->push_back(e);
  e->node2()->incident_edges->push_back(e);
}
//--------------------------------------------------------------------


//--------------------------------------------------------------------
void
Graph::removeEdge (OA_ptr<Graph::Edge> e)
{
  BaseGraph::removeEdge(e);

  // remove this edge from the list of incident edges of the two nodes involved
  e->node1()->incident_edges->remove(e);
  e->node2()->incident_edges->remove(e);
}
//--------------------------------------------------------------------


//--------------------------------------------------------------------
void
Graph::removeNode (OA_ptr<Graph::Node> n)
{
/* AIS - temporarily commented out so I can get OA to compile.
  BaseGraph::removeNode(n);

  // remove all the edges incident on this node
  OA_ptr<EdgesIterator> incident = n->getIncidentEdgesIterator();
  while (incident->isValid()) {
    OA_ptr<Edge> e = incident->current();
    // remove this edge from the neighboring node's list of incident edges
    if (e->node1().ptrEqual(n)) {
      e->node2()->incident_edges->remove(e);
    } else {
      e->node1()->incident_edges->remove(e);
    }
    // remove this edge
    BaseGraph::removeEdge(e);
    ++incident;
  }*/
}
//--------------------------------------------------------------------

} // end of OA namespace