RhodeCode

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

    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