COIN-OR::LEMON - Graph Library

Changeset 950:d74557d1f100 in lemon-0.x


Ignore:
Timestamp:
10/30/04 20:33:14 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1330
Message:
  • Changes in doc (spell check).
  • SmallGraph? is a class instead of being a typedef. (For the sake of doxygen.)
Location:
src/lemon
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/skeletons/graph_component.h

    r946 r950  
    197197    /// This class provides beside the core graph features
    198198    /// core iterable interface for the graph structure.
    199     /// The most of the base graphs should be conform to this concept.
     199    /// Most of the base graphs should be conform to this concept.
    200200
    201201    class BaseIterableGraphComponent : virtual public BaseGraphComponent {
  • src/lemon/smart_graph.h

    r946 r950  
    4646  /// @{
    4747
    48   ///A smart graph class.
    49 
    50   ///This is a simple and fast graph implementation.
    51   ///It is also quite memory efficient, but at the price
    52   ///that <b> it does not support node and edge deletion</b>.
    53   ///It conforms to
    54   ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
    55   ///\sa skeleton::ExtendableGraph.
    56   ///
    57   ///\todo Some member functions could be \c static.
    58   ///
    59   ///\todo A possibly useful functionality: a function saveState() would
    60   ///give back a data sturcture X and then the function restoreState(X)
    61   ///would remove the nodes and edges added after the call of saveState().
    62   ///Of course it should be used as a stack. (Maybe X is not necessary.)
    63   ///
    64   ///\author Alpar Juttner
    6548  class SmartGraphBase {
    6649
     
    241224  typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase;
    242225
    243   typedef ClearableSmartGraphBase SmartGraph;
    244 
    245 
     226  ///A smart graph class.
     227
     228  ///This is a simple and fast graph implementation.
     229  ///It is also quite memory efficient, but at the price
     230  ///that <b> it does not support node and edge deletion</b>.
     231  ///It conforms to
     232  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
     233  ///\sa skeleton::ExtendableGraph.
     234  ///
     235  ///\todo Some member functions could be \c static.
     236  ///
     237  ///\todo A possibly useful functionality: a function saveState()
     238  ///(or snapshot() ) would
     239  ///give back a data sturcture X and then the function restoreState(X)
     240  ///(or rollBack() )
     241  ///would remove the nodes and edges added after the call of saveState().
     242  ///Of course it should be used as a stack. (Maybe X is not necessary.)
     243  ///
     244  ///\author Alpar Juttner
     245  class SmartGraph :public ClearableSmartGraphBase { };
     246 
    246247  template <>
    247248  int countNodes<SmartGraph>(const SmartGraph& graph) {
Note: See TracChangeset for help on using the changeset viewer.