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

[Lemon SVN]

Author: alpar
Date: Fri Oct 20 14:05:54 2006
New Revision: 3008

Modified:
   hugo/trunk/lemon/full_graph.h
   hugo/trunk/lemon/grid_ugraph.h
   hugo/trunk/lemon/list_graph.h
   hugo/trunk/lemon/smart_graph.h

Log:
Graph imlementations actually provide ReferenceMaps.

Modified: hugo/trunk/lemon/full_graph.h
==============================================================================
--- hugo/trunk/lemon/full_graph.h	(original)
+++ hugo/trunk/lemon/full_graph.h	Fri Oct 20 14:05:54 2006
@@ -167,7 +167,10 @@
   /// It is completely static, so you can neither add nor delete either
   /// edges or nodes.
   /// Thus it conforms to
-  /// the \ref concept::Graph "Graph" concept
+  /// the \ref concept::Graph "Graph" concept and
+  ///it also has an
+  ///important extra feature that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
   /// \sa concept::Graph.
   ///
   /// \sa FullUGraph
@@ -379,6 +382,10 @@
   /// is that this class conforms to the undirected graph concept and
   /// it does not contain the loop edges.
   ///
+  ///It also has an
+  ///important extra feature that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   /// \sa FullGraph
   ///
   /// \author Balazs Dezso

Modified: hugo/trunk/lemon/grid_ugraph.h
==============================================================================
--- hugo/trunk/lemon/grid_ugraph.h	(original)
+++ hugo/trunk/lemon/grid_ugraph.h	Fri Oct 20 14:05:54 2006
@@ -293,7 +293,10 @@
   ///\endcode
   ///
   /// The graph type is fully conform to the \ref concept::UGraph
-  /// "Undirected Graph" concept.
+  /// "Undirected Graph" concept,  and it also has an
+  ///important extra feature that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   ///
   /// \author Balazs Dezso
   class GridUGraph : public ExtendedGridUGraphBase {

Modified: hugo/trunk/lemon/list_graph.h
==============================================================================
--- hugo/trunk/lemon/list_graph.h	(original)
+++ hugo/trunk/lemon/list_graph.h	Fri Oct 20 14:05:54 2006
@@ -322,6 +322,10 @@
   ///also provides several additional useful extra functionalities.
   ///The most of the member functions and nested classes are
   ///documented only in the concept class.
+  ///
+  ///An important extra feature of this graph implementation is that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   ///\sa concept::Graph.
 
   class ListGraph : public ExtendedListGraphBase {
@@ -743,6 +747,9 @@
 
   ///This is a simple and fast undirected graph implementation.
   ///
+  ///An important extra feature of this graph implementation is that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   ///It conforms to the
   ///\ref concept::UGraph "UGraph concept".
   ///
@@ -1491,6 +1498,10 @@
   ///
   /// This is a bipartite undirected graph implementation.
   /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
+  ///
+  ///An important extra feature of this graph implementation is that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   /// \sa concept::BpUGraph.
   ///
   class ListBpUGraph : public ExtendedListBpUGraphBase {

Modified: hugo/trunk/lemon/smart_graph.h
==============================================================================
--- hugo/trunk/lemon/smart_graph.h	(original)
+++ hugo/trunk/lemon/smart_graph.h	Fri Oct 20 14:05:54 2006
@@ -194,7 +194,10 @@
   ///that <b> it does support only limited (only stack-like)
   ///node and edge deletions</b>.
   ///It conforms to 
-  ///the \ref concept::Graph "Graph concept".
+  ///the \ref concept::Graph "Graph concept" with an
+  ///important extra feature that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   ///\sa concept::Graph.
   ///
   ///\author Alpar Juttner
@@ -378,6 +381,11 @@
   /// node and edge deletions</b>.
   /// Except from this it conforms to 
   /// the \ref concept::UGraph "UGraph concept".
+  ///
+  ///It also has an
+  ///important extra feature that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   /// \sa concept::UGraph.
   ///
   /// \todo Snapshot hasn't been implemented yet.
@@ -755,6 +763,11 @@
   /// that <b> it does not support node and edge deletions</b>.
   /// Except from this it conforms to 
   /// the \ref concept::BpUGraph "BpUGraph concept".
+  ///
+  ///It also has an
+  ///important extra feature that
+  ///its maps are real \ref concept::ReferenceMap "reference map"s.
+  ///
   /// \sa concept::BpUGraph.
   ///
   class SmartBpUGraph : public ExtendedSmartBpUGraphBase {