RhodeCode

  /// can neither add nor delete either arcs or nodes, and it needs

  /// constant space in memory.

  ///

  ///

  /// The \c FullDigraph and \c FullGraph classes are very similar,

  /// but there are two differences. While this class conforms only

  /// add nor delete either edges or nodes, and it needs constant

  /// space in memory.

  ///

  ///

  /// The \c FullGraph and \c FullDigraph classes are very similar,

  /// but there are two differences. While the \c FullDigraph class

  ///\endcode

  ///

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

  class GridGraph : public ExtendedGridGraphBase {

  public:

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

  ///

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

  class HypercubeGraph : public ExtendedHypercubeGraphBase {

  public:

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

  ///only in the concept class.

  ///

  ///\sa concepts::Digraph

  class ListDigraph : public ExtendedListDigraphBase {

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

  ///only in the concept class.

  ///

  ///\sa concepts::Graph

  class ListGraph : public ExtendedListGraphBase {

  ///It is also quite memory efficient, but at the price

  ///that <b> it does support only limited (only stack-like)

  ///node and arc deletions</b>.

  ///

  ///\sa concepts::Digraph.

  class SmartDigraph : public ExtendedSmartDigraphBase {

  /// It is also quite memory efficient, but at the price

  /// that <b> it does support only limited (only stack-like)

  /// node and arc deletions</b>.

  ///

  /// \sa concepts::Graph.

  class SmartGraph : public ExtendedSmartGraphBase {

  private: