Remove backedges from cyclegraph

[c11tester.git] / cyclegraph.cc

diff --git a/cyclegraph.cc b/cyclegraph.cc
index 8acbb4edcfd5db2f719fb5f2c9d85422047b3a10..36f64a43a16885217d1b4d75cfa5e281e43d3d19 100644 (file)
--- a/cyclegraph.cc
+++ b/cyclegraph.cc
@@ -342,21 +342,6 @@ unsigned int CycleNode::getNumEdges() const
        return edges.size();
 }
 
-/**
- * @param i The index of the back edge to return
- * @returns The CycleNode back-edge indexed by i
- */
-CycleNode * CycleNode::getBackEdge(unsigned int i) const
-{
-       return back_edges[i];
-}
-
-/** @returns The number of edges entering this CycleNode */
-unsigned int CycleNode::getNumBackEdges() const
-{
-       return back_edges.size();
-}
-
 /**
  * @brief Remove an element from a vector
  * @param v The vector
@@ -386,22 +371,6 @@ CycleNode * CycleNode::removeEdge()
 
        CycleNode *ret = edges.back();
        edges.pop_back();
-       vector_remove_node(ret->back_edges, this);
-       return ret;
-}
-
-/**
- * @brief Remove a (back) edge from this CycleNode
- * @return The CycleNode which was popped, if one exists; otherwise NULL
- */
-CycleNode * CycleNode::removeBackEdge()
-{
-       if (back_edges.empty())
-               return NULL;
-
-       CycleNode *ret = back_edges.back();
-       back_edges.pop_back();
-       vector_remove_node(ret->edges, this);
        return ret;
 }
 
@@ -416,7 +385,6 @@ bool CycleNode::addEdge(CycleNode *node)
                if (edges[i] == node)
                        return false;
        edges.push_back(node);
-       node->back_edges.push_back(this);
        return true;
 }