[Lemon-commits] [lemon_svn] alpar: r1331 - hugo/trunk/src/lemon

[Lemon SVN]

Author: alpar
Date: Sat Oct 30 20:51:00 2004
New Revision: 1331

Modified:
   hugo/trunk/src/lemon/full_graph.h

Log:
- SmallGraph is also a class instead of being a typedef.
  (For the sake of doxygen.)

Modified: hugo/trunk/src/lemon/full_graph.h
==============================================================================
--- hugo/trunk/src/lemon/full_graph.h	(original)
+++ hugo/trunk/src/lemon/full_graph.h	Sat Oct 30 20:51:00 2004
@@ -37,18 +37,6 @@
 /// \addtogroup graphs
 /// @{
 
-  ///A full graph class.
-
-  ///This is a simple and fast directed full graph implementation.
-  ///It is completely static, so you can neither add nor delete either
-  ///edges or nodes.
-  ///Thus it conforms to
-  ///the \ref skeleton::StaticGraph "StaticGraph" concept
-  ///\sa skeleton::StaticGraph.
-  ///\todo What about loops?
-  ///\todo Don't we need SymEdgeMap?
-  ///
-  ///\author Alpar Juttner
   class FullGraphBase {
     int NodeNum;
     int EdgeNum;
@@ -200,6 +188,18 @@
   typedef IdMappableGraphExtender<IterableFullGraphBase> IdMappableFullGraphBase;
   typedef DefaultMappableGraphExtender<IdMappableFullGraphBase> MappableFullGraphBase;
 
+  ///A full graph class.
+
+  ///This is a simple and fast directed full graph implementation.
+  ///It is completely static, so you can neither add nor delete either
+  ///edges or nodes.
+  ///Thus it conforms to
+  ///the \ref skeleton::StaticGraph "StaticGraph" concept
+  ///\sa skeleton::StaticGraph.
+  ///\todo What about loops?
+  ///\todo Don't we need SymEdgeMap?
+  ///
+  ///\author Alpar Juttner
   class FullGraph : public MappableFullGraphBase {
   public: