[Lemon-commits] Peter Kovacs: Remove notes about reference maps ...

[Lemon HG]

details:   http://lemon.cs.elte.hu/hg/lemon/rev/7a28e215f715
changeset: 614:7a28e215f715
user:      Peter Kovacs <kpeter [at] inf.elte.hu>
date:      Tue Apr 14 10:54:42 2009 +0200
description:
	Remove notes about reference maps as extra features (#190)

diffstat:

 lemon/full_graph.h      |   9 +++------
 lemon/grid_graph.h      |   4 +---
 lemon/hypercube_graph.h |   4 +---
 lemon/list_graph.h      |   6 ------
 lemon/smart_graph.h     |  12 ++----------
 5 files changed, 7 insertions(+), 28 deletions(-)

diffs (108 lines):

diff --git a/lemon/full_graph.h b/lemon/full_graph.h
--- a/lemon/full_graph.h
+++ b/lemon/full_graph.h
@@ -157,9 +157,8 @@
   /// can neither add nor delete either arcs or nodes, and it needs
   /// constant space in memory.
   ///
-  /// This class conforms to the \ref concepts::Digraph "Digraph" concept
-  /// and it also has an important extra feature that its maps are
-  /// real \ref concepts::ReferenceMap "reference map"s.
+  /// This class fully conforms to the \ref concepts::Digraph
+  /// "Digraph concept".
   ///
   /// The \c FullDigraph and \c FullGraph classes are very similar,
   /// but there are two differences. While this class conforms only
@@ -527,9 +526,7 @@
   /// add nor delete either edges or nodes, and it needs constant
   /// space in memory.
   ///
-  /// This class conforms to the \ref concepts::Graph "Graph" concept
-  /// and it also has an important extra feature that its maps are
-  /// real \ref concepts::ReferenceMap "reference map"s.
+  /// This class fully conforms to the \ref concepts::Graph "Graph concept".
   ///
   /// The \c FullGraph and \c FullDigraph classes are very similar,
   /// but there are two differences. While the \c FullDigraph class
diff --git a/lemon/grid_graph.h b/lemon/grid_graph.h
--- a/lemon/grid_graph.h
+++ b/lemon/grid_graph.h
@@ -497,9 +497,7 @@
   ///\endcode
   ///
   /// This graph type fully conforms to the \ref concepts::Graph
-  /// "Graph" concept, and it also has an important extra feature
-  /// that its maps are real \ref concepts::ReferenceMap
-  /// "reference map"s.
+  /// "Graph concept".
   class GridGraph : public ExtendedGridGraphBase {
   public:
 
diff --git a/lemon/hypercube_graph.h b/lemon/hypercube_graph.h
--- a/lemon/hypercube_graph.h
+++ b/lemon/hypercube_graph.h
@@ -292,9 +292,7 @@
   /// (assuming that the size of \c int is 32 bit).
   ///
   /// This graph type fully conforms to the \ref concepts::Graph
-  /// "Graph" concept, and it also has an important extra feature
-  /// that its maps are real \ref concepts::ReferenceMap
-  /// "reference map"s.
+  /// "Graph concept".
   class HypercubeGraph : public ExtendedHypercubeGraphBase {
   public:
 
diff --git a/lemon/list_graph.h b/lemon/list_graph.h
--- a/lemon/list_graph.h
+++ b/lemon/list_graph.h
@@ -320,9 +320,6 @@
   ///Most of the member functions and nested classes are documented
   ///only in the concept class.
   ///
-  ///An important extra feature of this digraph implementation is that
-  ///its maps are real \ref concepts::ReferenceMap "reference map"s.
-  ///
   ///\sa concepts::Digraph
 
   class ListDigraph : public ExtendedListDigraphBase {
@@ -1176,9 +1173,6 @@
   ///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 concepts::ReferenceMap "reference map"s.
-  ///
   ///\sa concepts::Graph
 
   class ListGraph : public ExtendedListGraphBase {
diff --git a/lemon/smart_graph.h b/lemon/smart_graph.h
--- a/lemon/smart_graph.h
+++ b/lemon/smart_graph.h
@@ -191,9 +191,7 @@
   ///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>.
-  ///It conforms to the \ref concepts::Digraph "Digraph concept" with
-  ///an important extra feature that its maps are real \ref
-  ///concepts::ReferenceMap "reference map"s.
+  ///It fully conforms to the \ref concepts::Digraph "Digraph concept".
   ///
   ///\sa concepts::Digraph.
   class SmartDigraph : public ExtendedSmartDigraphBase {
@@ -629,15 +627,9 @@
   /// 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>.
-  /// Except from this it conforms to
-  /// the \ref concepts::Graph "Graph concept".
-  ///
-  /// It also has an
-  /// important extra feature that
-  /// its maps are real \ref concepts::ReferenceMap "reference map"s.
+  /// It fully conforms to the \ref concepts::Graph "Graph concept".
   ///
   /// \sa concepts::Graph.
-  ///
   class SmartGraph : public ExtendedSmartGraphBase {
   private: