equal
deleted
inserted
replaced
290 /// \note The type of the indices is chosen to \c int for efficiency |
290 /// \note The type of the indices is chosen to \c int for efficiency |
291 /// reasons. Thus the maximum dimension of this implementation is 26 |
291 /// reasons. Thus the maximum dimension of this implementation is 26 |
292 /// (assuming that the size of \c int is 32 bit). |
292 /// (assuming that the size of \c int is 32 bit). |
293 /// |
293 /// |
294 /// This graph type fully conforms to the \ref concepts::Graph |
294 /// This graph type fully conforms to the \ref concepts::Graph |
295 /// "Graph" concept, and it also has an important extra feature |
295 /// "Graph concept". |
296 /// that its maps are real \ref concepts::ReferenceMap |
|
297 /// "reference map"s. |
|
298 class HypercubeGraph : public ExtendedHypercubeGraphBase { |
296 class HypercubeGraph : public ExtendedHypercubeGraphBase { |
299 public: |
297 public: |
300 |
298 |
301 typedef ExtendedHypercubeGraphBase Parent; |
299 typedef ExtendedHypercubeGraphBase Parent; |
302 |
300 |