///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.

   ///Thus it conforms to

   ///Thus it conforms to

   ///\todo What about loops?

   ///\todo What about loops?

   ///\todo Don't we need SymEdgeMap?

   ///\todo Don't we need SymEdgeMap?

   ///

   ///

   ///\author Alpar Juttner

   ///\author Alpar Juttner

   class FullGraph : public MappableFullGraphBase {

   class FullGraph : public MappableFullGraphBase {