RhodeCode

        } else {

          node_first_out[source] = arc_index;

        }

      }

      node_first_out[node_num] = arc_num;

    }

  protected:

    void fastFirstOut(Arc& e, const Node& n) const {

      e.id = node_first_out[n.id];

    }

    static void fastNextOut(Arc& e) {

      ++e.id;

    }

    void fastLastOut(Arc& e, const Node& n) const {

      e.id = node_first_out[n.id + 1];

    }

  protected:

    bool built;

    int node_num;

    int arc_num;

    int *node_first_out;

    int *node_first_in;

    int *arc_source;

    int *arc_target;

    int *arc_next_in;

    int *arc_next_out;

  };

  typedef DigraphExtender<StaticDigraphBase> ExtendedStaticDigraphBase;

  /// \ingroup graphs

  ///

  /// \brief A static directed graph class.

  ///

  /// \ref StaticDigraph is a highly efficient digraph implementation,

  /// but it is fully static.

  /// It stores only two \c int values for each node and only four \c int

  /// values for each arc. Moreover it provides faster item iteration than

  /// \ref ListDigraph and \ref SmartDigraph, especially using \c OutArcIt

  /// iterators, since its arcs are stored in an appropriate order.

  /// However it only provides build() and clear() functions and does not

  /// support any other modification of the digraph.

  ///

  /// This type fully conforms to the \ref concepts::Digraph "Digraph concept".

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

  /// only in the concept class.

  ///

  /// \sa concepts::Digraph

  class StaticDigraph : public ExtendedStaticDigraphBase {

  public:

    typedef ExtendedStaticDigraphBase Parent;

  public:

    ///

    /// \brief Build the digraph copying another digraph.

    ///

    /// This function builds the digraph copying another digraph of any

    /// kind. It can be called more than once, but in such case, the whole

    /// structure and all maps will be cleared and rebuilt.

    ///

    /// This method also makes possible to copy a digraph to a StaticDigraph

    /// structure using \ref DigraphCopy.

    /// 

    /// \param digraph An existing digraph to be copied.

    /// \param nodeRef The node references will be copied into this map.

    /// Its key type must be \c Digraph::Node and its value type must be

    /// \c StaticDigraph::Node.

    /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap"

    /// concept.

    /// \param arcRef The arc references will be copied into this map.

    /// Its key type must be \c Digraph::Arc and its value type must be

    /// \c StaticDigraph::Arc.

    /// It must conform to the \ref concepts::WriteMap "WriteMap" concept.

    ///

    /// \note If you do not need the arc references, then you could use

    /// \ref NullMap for the last parameter. However the node references

    /// are required by the function itself, thus they must be readable

    /// from the map.

    template <typename Digraph, typename NodeRefMap, typename ArcRefMap>

    void build(const Digraph& digraph, NodeRefMap& nodeRef, ArcRefMap& arcRef) {

      if (built) Parent::clear();

      Parent::build(digraph, nodeRef, arcRef);

    }

  protected:

    using Parent::fastFirstOut;

    using Parent::fastNextOut;

    using Parent::fastLastOut;

  public:

    class OutArcIt : public Arc {

    public:

      OutArcIt() { }

      OutArcIt(Invalid i) : Arc(i) { }

      OutArcIt(const StaticDigraph& digraph, const Node& node) {

	digraph.fastFirstOut(*this, node);

	digraph.fastLastOut(last, node);

        if (last == *this) *this = INVALID;

      }

      OutArcIt(const StaticDigraph& digraph, const Arc& arc) : Arc(arc) {

        if (arc != INVALID) {

          digraph.fastLastOut(last, digraph.source(arc));

        }

      }

      OutArcIt& operator++() { 

        StaticDigraph::fastNextOut(*this);

        if (last == *this) *this = INVALID;

        return *this; 

      }

    private:

      Arc last;

    };

    Node baseNode(const OutArcIt &arc) const {

      return Parent::source(static_cast<const Arc&>(arc));

    }

    Node runningNode(const OutArcIt &arc) const {

      return Parent::target(static_cast<const Arc&>(arc));

    }

    Node baseNode(const InArcIt &arc) const {

      return Parent::target(static_cast<const Arc&>(arc));

  G.build(g, nref, aref);

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 0);

  SmartDigraph::Arc a1 = g.addArc(n1, n2);

  G.build(g, nref, aref);

  check(G.source(aref[a1]) == nref[n1] && G.target(aref[a1]) == nref[n2],

        "Wrong arc or wrong references");

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 1);

  checkGraphOutArcList(G, nref[n1], 1);

  checkGraphOutArcList(G, nref[n2], 0);

  checkGraphOutArcList(G, nref[n3], 0);

  checkGraphInArcList(G, nref[n1], 0);

  checkGraphInArcList(G, nref[n2], 1);

  checkGraphInArcList(G, nref[n3], 0);

  checkGraphConArcList(G, 1);

  SmartDigraph::Arc

    a2 = g.addArc(n2, n1),

    a3 = g.addArc(n2, n3),

    a4 = g.addArc(n2, n3);

  digraphCopy(g, G).nodeRef(nref).run();

  checkGraphNodeList(G, 3);

  checkGraphArcList(G, 4);

  checkGraphOutArcList(G, nref[n1], 1);

  checkGraphOutArcList(G, nref[n2], 3);

  checkGraphOutArcList(G, nref[n3], 0);

  checkGraphInArcList(G, nref[n1], 1);

  checkGraphInArcList(G, nref[n2], 1);

  checkGraphInArcList(G, nref[n3], 2);

  checkGraphConArcList(G, 4);

  checkNodeIds(G);

  checkArcIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

}

void checkFullDigraph(int num) {

  typedef FullDigraph Digraph;

  DIGRAPH_TYPEDEFS(Digraph);

  Digraph G(num);

  checkGraphNodeList(G, num);

  checkGraphArcList(G, num * num);

  for (NodeIt n(G); n != INVALID; ++n) {

    checkGraphOutArcList(G, n, num);

    checkGraphInArcList(G, n, num);

  }

  checkGraphConArcList(G, num * num);

  checkNodeIds(G);

  checkArcIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

  for (int i = 0; i < G.nodeNum(); ++i) {

    check(G.index(G(i)) == i, "Wrong index");

  }

  for (NodeIt s(G); s != INVALID; ++s) {

    for (NodeIt t(G); t != INVALID; ++t) {

      Arc a = G.arc(s, t);

      check(G.source(a) == s && G.target(a) == t, "Wrong arc lookup");

    }

  }

}

void checkDigraphs() {

  { // Checking ListDigraph

    checkDigraphBuild<ListDigraph>();

    checkDigraphSplit<ListDigraph>();

    checkDigraphAlter<ListDigraph>();

    checkDigraphErase<ListDigraph>();

    checkDigraphSnapshot<ListDigraph>();

    checkDigraphValidityErase<ListDigraph>();

  }

  { // Checking SmartDigraph

    checkDigraphBuild<SmartDigraph>();

    checkDigraphSplit<SmartDigraph>();

    checkDigraphSnapshot<SmartDigraph>();

    checkDigraphValidity<SmartDigraph>();