COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
07/04/06 19:49:01 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2827
Message:
  • Revised "Concepts" group documentation
  • Other minor doc improvements
Location:
lemon
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/graph.h

    r2111 r2117  
    6060    /// @{
    6161
    62     /// An empty graph class.
    63  
    64     /// This class provides all the common features of a graph structure,
    65     /// however completely without implementations and real data structures
    66     /// behind the interface.
    67     /// All graph algorithms should compile with this class, but it will not
    68     /// run properly, of course.
     62    /// The directed graph concept
     63
     64    /// This class describes the \ref concept "concept" of the
     65    /// immutable directed graphs.
    6966    ///
    70     /// It can be used for checking the interface compatibility,
    71     /// or it can serve as a skeleton of a new graph structure.
    72     ///
    73     /// Also, you will find here the full documentation of a certain graph
    74     /// feature, the documentation of a real graph imlementation
    75     /// like @ref ListGraph or
    76     /// @ref SmartGraph will just refer to this structure.
     67    /// Note that actual graph implementation like @ref ListGraph or
     68    /// @ref SmartGraph may have several additional functionality.
    7769    ///
    78     /// \todo A pages describing the concept of concept description would
    79     /// be nice.
     70    /// \sa concept
    8071    class Graph {
    8172    public:
  • lemon/list_graph.h

    r2116 r2117  
    315315  ///A list graph class.
    316316
    317   ///This is a simple and fast erasable graph implementation.
     317  ///This is a simple and fast graph implementation.
    318318  ///
    319   ///It conforms to the \ref concept::Graph "Graph" concept and it
     319  ///It conforms to the \ref concept::Graph "Graph concept" and it
    320320  ///also provides several additional useful extra functionalities.
    321321  ///The most of the member functions and nested classes are
     
    718718  ///An undirected list graph class.
    719719
    720   ///This is a simple and fast erasable undirected graph implementation.
     720  ///This is a simple and fast undirected graph implementation.
    721721  ///
    722722  ///It conforms to the
    723   ///\ref concept::UGraph "UGraph" concept.
     723  ///\ref concept::UGraph "UGraph concept".
    724724  ///
    725725  ///\sa concept::UGraph.
     
    11461146  ///
    11471147  /// This is a bipartite undirected graph implementation.
    1148   /// It is conforms to the \ref concept::ErasableBpUGraph "ErasableBpUGraph"
    1149   /// concept.
     1148  /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
    11501149  /// \sa concept::BpUGraph.
    11511150  ///
Note: See TracChangeset for help on using the changeset viewer.