///\brief FullGraph and SymFullGraph classes.

 ///\brief FullGraph and SymFullGraph classes.

 namespace lemon {

 namespace lemon {

   class FullGraphBase {

   class FullGraphBase {

     int NodeNum;

     int NodeNum;

     int EdgeNum;

     int EdgeNum;

   public:

   public:

   typedef AlterableGraphExtender<FullGraphBase> AlterableFullGraphBase;

   typedef AlterableGraphExtender<FullGraphBase> AlterableFullGraphBase;

   typedef IterableGraphExtender<AlterableFullGraphBase> IterableFullGraphBase;

   typedef IterableGraphExtender<AlterableFullGraphBase> IterableFullGraphBase;

   typedef DefaultMappableGraphExtender<IterableFullGraphBase> MappableFullGraphBase;

   typedef DefaultMappableGraphExtender<IterableFullGraphBase> MappableFullGraphBase;

   ///A full graph class.

   ///A full graph class.

   ///This is a simple and fast directed full graph implementation.

   ///This is a simple and fast directed full graph implementation.

   ///It is completely static, so you can neither add nor delete either

   ///It is completely static, so you can neither add nor delete either

   ///edges or nodes.

   ///edges or nodes.

   public:

   public:

     FullGraph(int n) { construct(n); }

     FullGraph(int n) { construct(n); }

   };

   };

   // Base graph class for UndirFullGraph.

   // Base graph class for UndirFullGraph.

   class UndirFullGraphBase {

   class UndirFullGraphBase {

     int NodeNum;

     int NodeNum;

     int EdgeNum;

     int EdgeNum;

       e.id = source < NodeNum ? source * (source - 1) / 2 + target : -1;

       e.id = source < NodeNum ? source * (source - 1) / 2 + target : -1;

     }

     }

   };

   };

   /// \todo UndirFullGraph from the UndirFullGraphBase

   /// \todo UndirFullGraph from the UndirFullGraphBase

   /// @}  

   /// @}  

 } //namespace lemon

 } //namespace lemon