Context Navigation

Changeset 2117:96efb4fa0736 in lemon-0.x for lemon

Timestamp:

07/04/06 19:49:01 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Location:

lemon

Files:

-                      r2111
+                      r2117
     /// @{
+    /// An empty graph class.
+    /// This class provides all the common features of a graph structure,
+    /// however completely without implementations and real data structures
+    /// behind the interface.
+    /// All graph algorithms should compile with this class, but it will not
+    /// run properly, of course.
+    /// The directed graph concept
+    /// This class describes the \ref concept "concept" of the
+    /// immutable directed graphs.
     ///
+    /// It can be used for checking the interface compatibility,
+    /// or it can serve as a skeleton of a new graph structure.
+    ///
+    /// Also, you will find here the full documentation of a certain graph
+    /// feature, the documentation of a real graph imlementation
+    /// like @ref ListGraph or
+    /// @ref SmartGraph will just refer to this structure.
+    /// Note that actual graph implementation like @ref ListGraph or
+    /// @ref SmartGraph may have several additional functionality.
     ///
+    /// \todo A pages describing the concept of concept description would
+    /// be nice.
+    /// \sa concept
     class Graph {
     public:

-                      r2116
+                      r2117
   ///A list graph class.
   ///This is a simple and fast erasable graph implementation.
+  ///This is a simple and fast graph implementation.
   ///
   ///It conforms to the \ref concept::Graph "Graph" concept and it
+  ///It conforms to the \ref concept::Graph "Graph concept" and it
   ///also provides several additional useful extra functionalities.
   ///The most of the member functions and nested classes are
 …
   ///An undirected list graph class.
   ///This is a simple and fast erasable undirected graph implementation.
+  ///This is a simple and fast undirected graph implementation.
   ///
   ///It conforms to the
   ///\ref concept::UGraph "UGraph" concept.
+  ///\ref concept::UGraph "UGraph concept".
   ///
   ///\sa concept::UGraph.
 …
   ///
   /// This is a bipartite undirected graph implementation.
+  /// It is conforms to the \ref concept::ErasableBpUGraph "ErasableBpUGraph"
+  /// concept.
+  /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
   /// \sa concept::BpUGraph.
   ///

Note: See TracChangeset for help on using the changeset viewer.