RhodeCode

#include <lemon/assert.h>

///\brief HypercubeGraph class.

  class HypercubeGraphBase {

    typedef HypercubeGraphBase Graph;

    class Edge;

    HypercubeGraphBase() {}

      LEMON_ASSERT(dim >= 1, "The number of dimensions must be at least 1.");

      _node_num = 1 << dim;

      _edge_num = dim * (1 << dim-1);

    typedef True EdgeNumTag;

    int nodeNum() const { return _node_num; }

    int edgeNum() const { return _edge_num; }

    int arcNum() const { return 2 * _edge_num; }

    int maxNodeId() const { return _node_num - 1; }

    int maxEdgeId() const { return _edge_num - 1; }

    int maxArcId() const { return 2 * _edge_num - 1; }

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

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

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

    static int id(Node node) { return node._id; }

    static int id(Edge edge) { return edge._id; }

    static int id(Arc arc) { return arc._id; }

    Node u(Edge edge) const {

      int base = edge._id & ((1 << _dim-1) - 1);

      int k = edge._id >> _dim-1;

      return ((base >> k) << k+1) | (base & ((1 << k) - 1));

    Node v(Edge edge) const {

      int base = edge._id & ((1 << _dim-1) - 1);

      int k = edge._id >> _dim-1;

      return ((base >> k) << k+1) | (base & ((1 << k) - 1)) | (1 << k);

    Node source(Arc arc) const {

      return (arc._id & 1) == 1 ? u(arc) : v(arc);

    }

    Node target(Arc arc) const {

      return (arc._id & 1) == 1 ? v(arc) : u(arc);

    }

    typedef True FindEdgeTag;

    typedef True FindArcTag;

    Edge findEdge(Node u, Node v, Edge prev = INVALID) const {

      if (prev != INVALID) return INVALID;

      int d = u._id ^ v._id;

      int k = 0;

      if (d == 0) return INVALID;

      for ( ; (d & 1) == 0; d >>= 1) ++k;

      if (d >> 1 != 0) return INVALID;

      return (k << _dim-1) | ((u._id >> k+1) << k) | (u._id & ((1 << k) - 1));

    }

    Arc findArc(Node u, Node v, Arc prev = INVALID) const {

      Edge edge = findEdge(u, v, prev);

      if (edge == INVALID) return INVALID;

      int k = edge._id >> _dim-1;

      return ((u._id >> k) & 1) == 1 ? edge._id << 1 : (edge._id << 1) | 1;

    }

      friend class HypercubeGraphBase;

      int _id;

      Node(int id) : _id(id) {}

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

      friend class Arc;

    protected:

      int _id;

      Edge(int id) : _id(id) {}

    public:

      Edge() {}

      Edge (Invalid) : _id(-1) {}

      bool operator==(const Edge edge) const {return _id == edge._id;}

      bool operator!=(const Edge edge) const {return _id != edge._id;}

      bool operator<(const Edge edge) const {return _id < edge._id;}

      friend class HypercubeGraphBase;

      int _id;

      Arc(int id) : _id(id) {}

      Arc() {}

      Arc (Invalid) : _id(-1) {}

      operator Edge() const { return _id != -1 ? Edge(_id >> 1) : INVALID; }

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

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

      bool operator<(const Arc arc) const {return _id < arc._id;}

      node._id = _node_num - 1;

      --node._id;

    }

    void first(Edge& edge) const {

      edge._id = _edge_num - 1;

    }

    static void next(Edge& edge) {

      --edge._id;

      arc._id = 2 * _edge_num - 1;

      --arc._id;

    }

    void firstInc(Edge& edge, bool& dir, const Node& node) const {

      edge._id = node._id >> 1;

      dir = (node._id & 1) == 0;

    }

    void nextInc(Edge& edge, bool& dir) const {

      Node n = dir ? u(edge) : v(edge);

      int k = (edge._id >> _dim-1) + 1;

      if (k < _dim) {

        edge._id = (k << _dim-1) |

                   ((n._id >> k+1) << k) | (n._id & ((1 << k) - 1));

        dir = ((n._id >> k) & 1) == 0;

      } else {

        edge._id = -1;

        dir = true;

      }

      arc._id = ((node._id >> 1) << 1) | (~node._id & 1);

      Node n = (arc._id & 1) == 1 ? u(arc) : v(arc);

      int k = (arc._id >> _dim) + 1;

      if (k < _dim) {

        arc._id = (k << _dim-1) |

                  ((n._id >> k+1) << k) | (n._id & ((1 << k) - 1));

        arc._id = (arc._id << 1) | (~(n._id >> k) & 1);

      } else {

        arc._id = -1;

      }

      arc._id = ((node._id >> 1) << 1) | (node._id & 1);

      Node n = (arc._id & 1) == 1 ? v(arc) : u(arc);

      int k = (arc._id >> _dim) + 1;

      if (k < _dim) {

        arc._id = (k << _dim-1) |

                  ((n._id >> k+1) << k) | (n._id & ((1 << k) - 1));

        arc._id = (arc._id << 1) | ((n._id >> k) & 1);

        arc._id = -1;

    static bool direction(Arc arc) {

      return (arc._id & 1) == 1;

    }

    static Arc direct(Edge edge, bool dir) {

      return Arc((edge._id << 1) | (dir ? 1 : 0));

    }

      return static_cast<bool>(node._id & (1 << n));

    }

    int dimension(Edge edge) const {

      return edge._id >> _dim-1;

      return arc._id >> _dim;

      return node._id;

    int _dim;

    int _node_num, _edge_num;

  typedef GraphExtender<HypercubeGraphBase> ExtendedHypercubeGraphBase;

  /// \ingroup graphs

  /// \brief Hypercube graph class

  /// This class implements a special graph type. The nodes of the graph

  /// are indiced with integers with at most \c dim binary digits.

  /// Two nodes are connected in the graph if and only if their indices

  /// differ only on one position in the binary form.

  /// \note The type of the indices is chosen to \c int for efficiency

  /// reasons. Thus the maximum dimension of this implementation is 26

  /// (assuming that the size of \c int is 32 bit).

  /// This graph type is fully conform to the \ref concepts::Graph

  /// "Graph" concept, and it also has an important extra feature

  /// that its maps are real \ref concepts::ReferenceMap

  /// "reference map"s.

  class HypercubeGraph : public ExtendedHypercubeGraphBase {

    typedef ExtendedHypercubeGraphBase Parent;

    /// \brief Constructs a hypercube graph with \c dim dimensions.

    /// Constructs a hypercube graph with \c dim dimensions.

    HypercubeGraph(int dim) { construct(dim); }

    /// \brief The number of dimensions.

    /// Gives back the number of dimensions.

    /// \brief Returns \c true if the n'th bit of the node is one.

    /// Returns \c true if the n'th bit of the node is one.

    /// \brief The dimension id of an edge.

    /// Gives back the dimension id of the given edge.

    /// It is in the [0..dim-1] range.

    int dimension(Edge edge) const {

      return Parent::dimension(edge);

    }

    /// \brief The dimension id of an arc.

    ///

    /// Gives back the dimension id of the given arc.

    /// It is in the [0..dim-1] range.

    /// \brief The index of a node.

    /// Gives back the index of the given node.

    /// The lower bits of the integer describes the node.

    /// \brief Gives back a node by its index.

    /// Gives back a node by its index.

    /// \brief Number of edges.

    int edgeNum() const { return Parent::edgeNum(); }

    /// This map makes possible to give back a linear combination

    /// for each node. It works like the \c std::accumulate function,

    /// so it accumulates the \c bf binary function with the \c fv first

    /// value. The map accumulates only on that positions (dimensions)

    /// where the index of the node is one. The values that have to be

    /// accumulated should be given by the \c begin and \c end iterators

    /// and the length of this range should be equal to the dimension

    /// number of the graph.

    /// HypercubeGraph graph(DIM);

    /// HypercubeGraph::HyperMap<dim2::Point<double> >

    ///   pos(graph, base, base + DIM, dim2::Point<double>(0.0, 0.0));

    /// \see HypercubeGraph

      /// \brief The key type of the map

      /// \brief The value type of the map

      /// Construct a HyperMap for the given graph. The values that have

      /// to be accumulated should be given by the \c begin and \c end

      /// iterators and the length of this range should be equal to the

      /// dimension number of the graph.

      /// This map accumulates the \c bf binary function with the \c fv

      /// first value on that positions (dimensions) where the index of

      /// the node is one.

      HyperMap(const Graph& graph, It begin, It end,

               T fv = 0, const BF& bf = BF())

        : _graph(graph), _values(begin, end), _first_value(fv), _bin_func(bf)

        LEMON_ASSERT(_values.size() == graph.dimension(),

                     "Wrong size of range");

      /// \brief The partial accumulated value.

      Value operator[](const Key& k) const {

      const Graph& _graph;

#include <lemon/hypercube_graph.h>

    checkGraphOutArcList(G, n, num - 1);

    checkGraphInArcList(G, n, num - 1);

    checkGraphIncEdgeList(G, n, num - 1);

  { // Checking HypercubeGraph

    checkConcept<Graph, HypercubeGraph>();

  }

void checkHypercubeGraph(int dim) {

  GRAPH_TYPEDEFS(HypercubeGraph);

  HypercubeGraph G(dim);

  checkGraphNodeList(G, 1 << dim);

  checkGraphEdgeList(G, dim * (1 << dim-1));

  checkGraphArcList(G, dim * (1 << dim));

  Node n = G.nodeFromId(dim);

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

    checkGraphIncEdgeList(G, n, dim);

    for (IncEdgeIt e(G, n); e != INVALID; ++e) {

      check( (G.u(e) == n &&

              G.id(G.v(e)) == G.id(n) ^ (1 << G.dimension(e))) ||

             (G.v(e) == n &&

              G.id(G.u(e)) == G.id(n) ^ (1 << G.dimension(e))),

             "Wrong edge or wrong dimension");

    }

    checkGraphOutArcList(G, n, dim);

    for (OutArcIt a(G, n); a != INVALID; ++a) {

      check(G.source(a) == n &&

            G.id(G.target(a)) == G.id(n) ^ (1 << G.dimension(a)),

            "Wrong arc or wrong dimension");

    }

    checkGraphInArcList(G, n, dim);

    for (InArcIt a(G, n); a != INVALID; ++a) {

      check(G.target(a) == n &&

            G.id(G.source(a)) == G.id(n) ^ (1 << G.dimension(a)),

            "Wrong arc or wrong dimension");

    }

  }

  checkGraphConArcList(G, (1 << dim) * dim);

  checkGraphConEdgeList(G, dim * (1 << dim-1));

  checkArcDirections(G);

  checkNodeIds(G);

  checkArcIds(G);

  checkEdgeIds(G);

  checkGraphNodeMap(G);

  checkGraphArcMap(G);

  checkGraphEdgeMap(G);

}

  { // Checking FullGraph

  { // Checking HypercubeGraph

    checkHypercubeGraph(1);

    checkHypercubeGraph(2);

    checkHypercubeGraph(3);

    checkHypercubeGraph(4);

  }

        -e "s/\<HyperCubeDigraph\>/HypercubeGraph/g"\