RhodeCode

    int maxNodeId() const { return nodes.size()-1; } 

    int maxArcId() const { return arcs.size()-1; }

    Node source(Arc e) const { return Node(arcs[e.id].source); }

    Node target(Arc e) const { return Node(arcs[e.id].target); }

    void first(Node& node) const { 

      node.id = first_node;

    }

    void next(Node& node) const {

      node.id = nodes[node.id].next;

    }

      int n;

      for(n = first_node; 

	  n!=-1 && nodes[n].first_in == -1; 

	  n = nodes[n].next);

    }

    void next(Arc& arc) const {

      if (arcs[arc.id].next_in != -1) {

	arc.id = arcs[arc.id].next_in;

      } else {

	int n;

	for(n = nodes[arcs[arc.id].target].next;

	  n!=-1 && nodes[n].first_in == -1; 

	  n = nodes[n].next);

	arc.id = (n == -1) ? -1 : nodes[n].first_in;

      }      

    }

    void firstOut(Arc &e, const Node& v) const {

      e.id = nodes[v.id].first_out;

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

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

      else nodes[arcs[e.id].source].first_out = arcs[e.id].next_out;

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

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

      }

      arcs[e.id].source = n.id;

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

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

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

    }

  };

  typedef DigraphExtender<ListDigraphBase> ExtendedListDigraphBase;

  /// @{

  ///

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

  ///

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

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

  ///

  class ListDigraph : public ExtendedListDigraphBase {

  private:

    ///

    ListDigraph(const ListDigraph &) :ExtendedListDigraphBase() {};

    ///\brief Assignment of ListDigraph to another one is \e not allowed.

    ///Assignment of ListDigraph to another one is \e not allowed.

    void operator=(const ListDigraph &) {}

  public:

    typedef ExtendedListDigraphBase Parent;

    /// Constructor

    /// Constructor.

    ///

    ListDigraph() {}

    ///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); 

    }

    ///

    ///\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.

    void changeTarget(Arc e, Node n) { 

      Parent::changeTarget(e,n); 

    }

    ///

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

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

    ///invalidated.

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

    ///feature.

    void changeSource(Arc e, Node n) { 

      Parent::changeSource(e,n);

    }

    /// 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);

    }

    /// 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); };

    /// 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.

    ///

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

    ///may be invalidated.

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

    ///feature.

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

    {

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

	OutArcIt f=e;

	++f;

	if(r && target(e)==a) erase(e);

	else changeSource(e,a);

	e=f;

      }

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

	InArcIt f=e;

	++f;

	if(r && source(e)==a) erase(e);

	else changeTarget(e,a);

      erase(b);

    }

    ///Split a node.

    ///This function splits a node. First a new node is added to the digraph,

    ///then the source of each outgoing arc of \c n is moved to this new node.

    ///If \c connect is \c true (this is the default value), then a new arc

    ///from \c n to the newly created node is also added.

    ///\return The newly created node.

    ///

    ///\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.  

    ///

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

    Node split(Node n, bool connect = true) {

      Node b = addNode();

      for(OutArcIt e(*this,n);e!=INVALID;) {

 	OutArcIt f=e;

	++f;

	changeSource(e,b);

	e=f;

      }

      if (connect) addArc(n,b);

      return b;

    }

    ///Split an arc.

    ///This function splits an arc. First a new node \c b is added to

    ///the digraph, then the original arc is re-targeted to \c

    ///b. Finally an arc from \c b to the original target is added.

    ///\return The newly created node.  

    Node split(Arc e) {

      Node b = addNode();

      addArc(b,target(e));

      changeTarget(e,b);

      return b;

    }

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

    ///

    ///

    /// The newly added nodes and arcs can be removed using the

    /// restore() function.

    ///

    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:

      Node (Invalid) { id = -1; }

      bool operator==(const Node& node) const {return id == node.id;}

      bool operator!=(const Node& node) const {return id != node.id;}

      bool operator<(const Node& node) const {return id < node.id;}

    };

    class Edge {

      friend class ListGraphBase;

    protected:

      int id;

      explicit Edge(int pid) { id = pid;}

    public:

      Edge() {}

      Edge (Invalid) { id = -1; }

    };

    class Arc {

      friend class ListGraphBase;

    protected:

      int id;

      explicit Arc(int pid) { id = pid;}

    public:

      operator Edge() const { return edgeFromId(id / 2); }

      Arc() {}

      Arc (Invalid) { id = -1; }

      bool operator==(const Arc& arc) const {return id == arc.id;}

      bool operator!=(const Arc& arc) const {return id != arc.id;}

      e.id = nodes[v.id].first_out;

    }

    void nextOut(Arc &e) const {

      e.id = arcs[e.id].next_out;

    }

    void firstIn(Arc &e, const Node& v) const {

      e.id = ((nodes[v.id].first_out) ^ 1);

      if (e.id == -2) e.id = -1;

    }

    void nextIn(Arc &e) const {

      e.id = ((arcs[e.id ^ 1].next_out) ^ 1);

      if (e.id == -2) e.id = -1;

    }

    void firstInc(Edge &e, bool& d, const Node& v) const {

      } else {

        e.id = -1;

        d = true;

      }

    }

    void nextInc(Edge &e, bool& d) const {

      } else {

        e.id = -1;

        d = true;

      }

    }

    static int id(Node v) { return v.id; }

    static int id(Arc e) { return e.id; }

    static int id(Edge e) { return e.id; }

    static Node nodeFromId(int id) { return Node(id);}

    static Arc arcFromId(int id) { return Arc(id);}

    static Edge edgeFromId(int id) { return Edge(id);}

    Node addNode() {     

      int n;

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

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

      }

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

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

      } else {

	first_node = nodes[n].next;

      }

      nodes[n].next = first_free_node;

      first_free_node = n;

    }

      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) {

      } 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;

  /// @{

  ///

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

  ///

  class ListGraph : public ExtendedListGraphBase {

  private:

    ///

    ListGraph(const ListGraph &) :ExtendedListGraphBase()  {};

    ///\brief Assignment of ListGraph to another one is \e not allowed.

    ///Assignment of ListGraph to another one is \e not allowed.

    void operator=(const ListGraph &) {}

  public:

    /// Constructor

    /// Constructor.

    ///

    ListGraph() {}

    typedef ExtendedListGraphBase Parent;

    ///

    /// \return the new node.

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

    ///

    /// and target node \c t.

    /// \return the new edge.

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

      return Parent::addEdge(s, t); 

    }

    ///

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>InArcIt</tt>s

    ///referencing the changed arc remain

    ///valid. However <tt>OutArcIt</tt>s are invalidated.

    void changeSource(Edge e, Node n) { 

      Parent::changeSource(e,n); 

    }    

    ///

    ///

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

    /// valid. However the other iterators may be invalidated.

    void changeTarget(Edge e, Node n) { 

      Parent::changeTarget(e,n); 

    }

    ///

    ///

    ///\note The <tt>ArcIt</tt>s and <tt>InArcIt</tt>s

    ///referencing the changed arc remain

    ///valid. However <tt>OutArcIt</tt>s are invalidated.

    void changeSource(Arc e, Node n) { 

      if (Parent::direction(e)) {

        Parent::changeSource(e,n);

      } else {

        Parent::changeTarget(e,n);

      } 

    }

    ///

    ///

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

    ///referencing the changed arc remain

    ///valid. However <tt>InArcIt</tt>s are invalidated.

    void changeTarget(Arc e, Node n) { 

      if (Parent::direction(e)) {

        Parent::changeTarget(e,n);

      } else {

        Parent::changeSource(e,n);

      } 

    }

    /// \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.

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

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

	  erase(e);

	} else if (source(e) == b) {

	  changeSource(e, a);

	} else {

	  changeTarget(e, a);

	}

	e = f;

      }

      erase(b);

    }

    ///

    ///

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

    /// using the restore() function.

    ///

    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:

        Snapshot& snapshot;

      };

      class EdgeObserverProxy : public EdgeNotifier::ObserverBase {

      public:

        EdgeObserverProxy(Snapshot& _snapshot)

          : snapshot(_snapshot) {}

        using EdgeNotifier::ObserverBase::attach;

        using EdgeNotifier::ObserverBase::detach;

        using EdgeNotifier::ObserverBase::attached;

      protected:

        }

          }

        }

        }

          }

        }

        virtual void build() {

          }

          }

        }

        virtual void clear() {

          }

        }

        Snapshot& snapshot;

      };

      NodeObserverProxy node_observer_proxy;

      std::list<Node> added_nodes;

      void addNode(const Node& node) {

        added_nodes.push_front(node);        

      }

      void eraseNode(const Node& node) {

        std::list<Node>::iterator it = 

          std::find(added_nodes.begin(), added_nodes.end(), node);

        if (it == added_nodes.end()) {

          clear();

          throw NodeNotifier::ImmediateDetach();

        } else {

          added_nodes.erase(it);

        }

      }

      }

        std::list<Edge>::iterator it = 

          clear();

          node_observer_proxy.detach();

          throw EdgeNotifier::ImmediateDetach();

        } else {

        }        

      }

      }

      void detach() {

	node_observer_proxy.detach();

      }

      bool attached() const {

        return node_observer_proxy.attached();

      }

      void clear() {

        added_nodes.clear();

      }

    public:

      /// \brief Default constructor.

      ///

      /// Default constructor.

      /// To actually make a snapshot you must call save().

      Snapshot() 

      /// \brief Constructor that immediately makes a snapshot.

      ///      

        : node_observer_proxy(*this), 

      }

      /// \brief Make a snapshot.

      ///

      ///

      /// This function can be called more than once. In case of a repeated

      /// call, the previous snapshot gets lost.

        if (attached()) {

          detach();

          clear();

        }

      }

      /// \brief Undo the changes until the last snapshot.

      // 

      /// Undo the changes until the last snapshot created by save().

      void restore() {

	detach();

	}

	for(std::list<Node>::iterator it = added_nodes.begin(); 

            it != added_nodes.end(); ++it) {

	}

        clear();

      }

      /// \brief Gives back true when the snapshot is valid.

      ///

      /// Gives back true when the snapshot is valid.

      bool valid() const {

        return attached();

      }

    };

  };

  /// @}  

} //namespace lemon