RhodeCode

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

    }

  };

  typedef DigraphExtender<ListDigraphBase> ExtendedListDigraphBase;

  /// \addtogroup graphs

  /// @{

  ///A general directed graph structure.

  ///\ref ListDigraph is a simple and fast <em>directed graph</em>

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

  ///\c std::vector structures.

  ///

  ///It conforms to the \ref concepts::Digraph "Digraph 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 digraph implementation is that

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

  ///

  ///\sa concepts::Digraph

  class ListDigraph : public ExtendedListDigraphBase {

  private:

    ///ListDigraph is \e not copy constructible. Use copyDigraph() instead.

    ///ListDigraph is \e not copy constructible. Use copyDigraph() instead.

    ///

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

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

    ///Use copyDigraph() instead.

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

    ///Use copyDigraph() instead.

    void operator=(const ListDigraph &) {}

  public:

    typedef ExtendedListDigraphBase Parent;

    /// Constructor

    /// Constructor.

    ///

    ListDigraph() {}

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

    }

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

    /// Change the target of \c e to \c n

    /// Change the target of \c e to \c 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.

    ///

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

    ///feature.

    void changeTarget(Arc e, Node n) {

      Parent::changeTarget(e,n);

    }

    /// Change the source of \c e to \c n

    /// Change the source of \c e to \c 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);

    }

    /// Reserve memory for nodes.

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

    }

  };

  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.

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

    ///

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

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

    ///Use copyGraph() instead.

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

    ///Use copyGraph() instead.

    void operator=(const ListGraph &) {}

  public:

    /// Constructor

    /// Constructor.

    ///

    ListGraph() {}

    typedef ExtendedListGraphBase Parent;

    typedef Parent::OutArcIt IncEdgeIt;

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

    ///

    /// Add a new node to the graph.

    /// \return the new node.

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

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

    }

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

    /// \brief Change the source of \c e to \c n

    ///

    /// This function changes the source of \c e to \c 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(Edge e, Node n) {

      Parent::changeSource(e,n);

    }

    /// \brief Change the target of \c e to \c n

    ///

    /// This function changes the target of \c e to \c n.

    ///

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

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

    ///

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

    ///Snapshot feature.

    void changeTarget(Edge e, Node n) {

      Parent::changeTarget(e,n);

    }

    /// \brief Change the source of \c e to \c n

    ///

    /// This function changes the source of \c e to \c n.

    /// It also changes the proper node of the represented edge.

    ///

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