Changeset 2256:b22dfb6c5ff3 in lemon-0.x for lemon

Timestamp:

10/20/06 14:05:54 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3008

Message:

Graph imlementations actually provide ReferenceMaps?.

Location:

lemon

Files:

• full_graph.h (modified) (2 diffs)
• grid_ugraph.h (modified) (1 diff)
• list_graph.h (modified) (3 diffs)
• smart_graph.h (modified) (3 diffs)

lemon/full_graph.h

@@ -168 +168 @@
   /// 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.
   ///
@@ -379 +382 @@
   /// 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

lemon/grid_ugraph.h

@@ -294 +294 @@
   ///
   /// 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

lemon/list_graph.h

@@ -323 +323 @@
   ///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.
 
@@ -744 +748 @@
   ///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".
@@ -1492 +1499 @@
   /// 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.
   ///

lemon/smart_graph.h

@@ -195 +195 @@
   ///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.
   ///
@@ -379 +382 @@
   /// 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.
   ///
@@ -756 +764 @@
   /// 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.
   ///