RhodeCode

    ///Add a new node to the digraph.

    ///Add a new node to the digraph.

    ///\return the new node.

    Node addNode() { return Parent::addNode(); }

    ///Add a new arc to the digraph.

    ///Add a new arc to the digraph with source node \c s

    ///and target node \c t.

    ///\return the new arc.

    Arc addArc(const Node& s, const Node& t) {

      return Parent::addArc(s, t);

    }

    ///\brief Erase a node from the digraph.

    ///

    ///Erase a node from the digraph.

    ///

    void erase(const Node& n) { Parent::erase(n); }

    ///\brief Erase an arc from the digraph.

    ///

    ///Erase an arc from the digraph.

    ///

    void erase(const Arc& a) { Parent::erase(a); }

    /// Node validity check

    /// This function gives back true if the given node is valid,

    /// ie. it is a real node of the graph.

    ///

    /// \warning A Node pointing to a removed item

    /// could become valid again later if new nodes are

    /// added to the graph.

    bool valid(Node n) const { return Parent::valid(n); }

    /// Arc validity check

    /// This function gives back true if the given arc is valid,

    /// ie. it is a real arc of the graph.

    ///

    /// \warning An Arc pointing to a removed item

    /// could become valid again later if new nodes are

    /// added to the graph.

    bool valid(Arc a) const { return Parent::valid(a); }

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>OutArcIt</tt>s referencing

    ///the changed arc remain valid. However <tt>InArcIt</tt>s are

    ///invalidated.

    ///

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    }

    ///

    ///invalidated.

    ///

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    }

    /// Invert the direction of an arc.

    ///\note The <tt>ArcIt</tt>s referencing the changed arc remain

    ///valid. However <tt>OutArcIt</tt>s and <tt>InArcIt</tt>s are

    ///invalidated.

    ///

    ///\warning This functionality cannot be used together with the Snapshot

    ///feature.

    void reverseArc(Arc e) {

      Node t=target(e);

      changeTarget(e,source(e));

      changeSource(e,t);

    }

    /// Reserve memory for nodes.

    /// Using this function it is possible to avoid the superfluous memory

    /// allocation: if you know that the digraph you want to build will

    /// be very large (e.g. it will contain millions of nodes and/or arcs)

    /// then it is worth reserving space for this amount before starting

    /// to build the digraph.

    /// \sa reserveArc

    void reserveNode(int n) { nodes.reserve(n); };

    /// Reserve memory for arcs.

    /// Using this function it is possible to avoid the superfluous memory

    /// allocation: if you know that the digraph you want to build will

    /// be very large (e.g. it will contain millions of nodes and/or arcs)

    /// then it is worth reserving space for this amount before starting

    /// to build the digraph.

    /// \sa reserveNode

    void reserveArc(int m) { arcs.reserve(m); };

    ///Contract two nodes.

    ///This function contracts two nodes.

    ///Node \p b will be removed but instead of deleting

    ///incident arcs, they will be joined to \p a.

    ///The last parameter \p r controls whether to remove loops. \c true

    ///means that loops will be removed.

    ///

    ///\note The <tt>ArcIt</tt>s referencing a moved arc remain

    ///valid. However <tt>InArcIt</tt>s and <tt>OutArcIt</tt>s

    ///may be invalidated.

    ///

        nodes[nodes[n].prev].next = nodes[n].next;

      } else {

        first_node = nodes[n].next;

      }

      nodes[n].next = first_free_node;

      first_free_node = n;

      nodes[n].prev = -2;

    }

    void erase(const Edge& edge) {

      int n = edge.id * 2;

      if (arcs[n].next_out != -1) {

        arcs[arcs[n].next_out].prev_out = arcs[n].prev_out;

      }

      if (arcs[n].prev_out != -1) {

        arcs[arcs[n].prev_out].next_out = arcs[n].next_out;

      } else {

        nodes[arcs[n | 1].target].first_out = arcs[n].next_out;

      }

      if (arcs[n | 1].next_out != -1) {

        arcs[arcs[n | 1].next_out].prev_out = arcs[n | 1].prev_out;

      }

      if (arcs[n | 1].prev_out != -1) {

        arcs[arcs[n | 1].prev_out].next_out = arcs[n | 1].next_out;

      } else {

        nodes[arcs[n].target].first_out = arcs[n | 1].next_out;

      }

      arcs[n].next_out = first_free_arc;

      first_free_arc = n;

      arcs[n].prev_out = -2;

      arcs[n | 1].prev_out = -2;

    }

    void clear() {

      arcs.clear();

      nodes.clear();

      first_node = first_free_node = first_free_arc = -1;

    }

  protected:

      if(arcs[2 * e.id].next_out != -1) {

        arcs[arcs[2 * e.id].next_out].prev_out = arcs[2 * e.id].prev_out;

      }

      if(arcs[2 * e.id].prev_out != -1) {

        arcs[arcs[2 * e.id].prev_out].next_out =

          arcs[2 * e.id].next_out;

      } else {

        nodes[arcs[(2 * e.id) | 1].target].first_out =

          arcs[2 * e.id].next_out;

      }

      if (nodes[n.id].first_out != -1) {

        arcs[nodes[n.id].first_out].prev_out = 2 * e.id;

      }

      arcs[(2 * e.id) | 1].target = n.id;

      arcs[2 * e.id].prev_out = -1;

      arcs[2 * e.id].next_out = nodes[n.id].first_out;

      nodes[n.id].first_out = 2 * e.id;

    }

      if(arcs[(2 * e.id) | 1].next_out != -1) {

        arcs[arcs[(2 * e.id) | 1].next_out].prev_out =

          arcs[(2 * e.id) | 1].prev_out;

      }

      if(arcs[(2 * e.id) | 1].prev_out != -1) {

        arcs[arcs[(2 * e.id) | 1].prev_out].next_out =

          arcs[(2 * e.id) | 1].next_out;

      } else {

        nodes[arcs[2 * e.id].target].first_out =

          arcs[(2 * e.id) | 1].next_out;

      }

      if (nodes[n.id].first_out != -1) {

        arcs[nodes[n.id].first_out].prev_out = ((2 * e.id) | 1);

      }

      arcs[2 * e.id].target = n.id;

      arcs[(2 * e.id) | 1].prev_out = -1;

      arcs[(2 * e.id) | 1].next_out = nodes[n.id].first_out;

      nodes[n.id].first_out = ((2 * e.id) | 1);

    }

  };

  typedef GraphExtender<ListGraphBase> ExtendedListGraphBase;

  /// \addtogroup graphs

  /// @{

  ///A general undirected graph structure.

  ///\ref ListGraph is a simple and fast <em>undirected graph</em>

  ///implementation based on static linked lists that are stored in

  ///\c std::vector structures.

  ///

  ///It conforms to the \ref concepts::Graph "Graph concept" and it

  ///also provides several useful additional functionalities.

  ///Most of the member functions and nested classes are documented

  ///only in the concept class.

  ///

  ///An important extra feature of this graph implementation is that

  ///its maps are real \ref concepts::ReferenceMap "reference map"s.

  ///

  ///\sa concepts::Graph

  class ListGraph : public ExtendedListGraphBase {

  private:

    ///ListGraph is \e not copy constructible. Use copyGraph() instead.

    /// \brief Add a new edge to the graph.

    ///

    /// Add a new edge to the graph with source node \c s

    /// and target node \c t.

    /// \return the new edge.

    Edge addEdge(const Node& s, const Node& t) {

      return Parent::addEdge(s, t);

    }

    /// \brief Erase a node from the graph.

    ///

    /// Erase a node from the graph.

    ///

    void erase(const Node& n) { Parent::erase(n); }

    /// \brief Erase an edge from the graph.

    ///

    /// Erase an edge from the graph.

    ///

    void erase(const Edge& e) { Parent::erase(e); }

    /// Node validity check

    /// This function gives back true if the given node is valid,

    /// ie. it is a real node of the graph.

    ///

    /// \warning A Node pointing to a removed item

    /// could become valid again later if new nodes are

    /// added to the graph.

    bool valid(Node n) const { return Parent::valid(n); }

    /// Arc validity check

    /// This function gives back true if the given arc is valid,

    /// ie. it is a real arc of the graph.

    ///

    /// \warning An Arc pointing to a removed item

    /// could become valid again later if new edges are

    /// added to the graph.

    bool valid(Arc a) const { return Parent::valid(a); }

    /// Edge validity check

    /// This function gives back true if the given edge is valid,

    /// ie. it is a real arc of the graph.

    ///

    /// \warning A Edge pointing to a removed item

    /// could become valid again later if new edges are

    /// added to the graph.

    bool valid(Edge e) const { return Parent::valid(e); }

    ///

    ///

    ///

    ///\warning This functionality cannot be used together with the

    ///Snapshot feature.

    }

    ///

    ///

    ///

    ///\warning This functionality cannot be used together with the

    ///Snapshot feature.

    }

    /// \brief Contract two nodes.

    ///

    /// This function contracts two nodes.

    /// Node \p b will be removed but instead of deleting

    /// its neighboring arcs, they will be joined to \p a.

    /// The last parameter \p r controls whether to remove loops. \c true

    /// means that loops will be removed.

    ///

    /// \note The <tt>ArcIt</tt>s referencing a moved arc remain

    /// valid.

    ///

    ///\warning This functionality cannot be used together with the

    ///Snapshot feature.

    void contract(Node a, Node b, bool r = true) {

      for(IncEdgeIt e(*this, b); e!=INVALID;) {

        IncEdgeIt f = e; ++f;

        if (r && runningNode(e) == a) {

          erase(e);

        } else {

        }

        e = f;

      }

      erase(b);

    }

    /// \brief Class to make a snapshot of the graph and restore

    /// it later.

    ///

    /// Class to make a snapshot of the graph and restore it later.

    ///

    /// The newly added nodes and edges can be removed

    /// using the restore() function.

    ///

    /// \warning Edge and node deletions and other modifications

    /// (e.g. changing nodes of edges, contracting nodes) cannot be

    /// restored. These events invalidate the snapshot.

    class Snapshot {

    protected:

      typedef Parent::NodeNotifier NodeNotifier;

      class NodeObserverProxy : public NodeNotifier::ObserverBase {

      public:

        NodeObserverProxy(Snapshot& _snapshot)

          : snapshot(_snapshot) {}

        using NodeNotifier::ObserverBase::attach;

        using NodeNotifier::ObserverBase::detach;

        using NodeNotifier::ObserverBase::attached;

      protected:

        virtual void add(const Node& node) {

          snapshot.addNode(node);

        }

        virtual void add(const std::vector<Node>& nodes) {

          for (int i = nodes.size() - 1; i >= 0; ++i) {

            snapshot.addNode(nodes[i]);

          }

        }

        virtual void erase(const Node& node) {

          snapshot.eraseNode(node);

        }

        virtual void erase(const std::vector<Node>& nodes) {

          for (int i = 0; i < int(nodes.size()); ++i) {