COIN-OR::LEMON - Graph Library

Changeset 959:c80ef5912903 in lemon-0.x for doc


Ignore:
Timestamp:
11/04/04 21:24:59 (15 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1342
Message:

skeleton(s) -> concept renaming

Location:
doc
Files:
4 edited

Legend:

Unmodified
Added
Removed
  • doc/Doxyfile

    r953 r959  
    432432                         namespaces.dox \
    433433                         ../src/lemon \
    434                          ../src/lemon/skeletons \
     434                         ../src/lemon/concept \
    435435                         ../src/test/test_tools.h
    436436
  • doc/graphs.dox

    r921 r959  
    1010
    1111Each graph should meet the
    12 \ref lemon::skeleton::StaticGraph "StaticGraph" concept.
     12\ref lemon::concept::StaticGraph "StaticGraph" concept.
    1313This concept does not
    1414makes it possible to change the graph (i.e. it is not possible to add
     
    1717
    1818The graphs meeting the
    19 \ref lemon::skeleton::ExtendableGraph "ExtendableGraph"
     19\ref lemon::concept::ExtendableGraph "ExtendableGraph"
    2020concept allow node and
    2121edge addition. You can also "clear" (i.e. erase all edges and nodes)
     
    2323
    2424In case of graphs meeting the full feature
    25 \ref lemon::skeleton::ErasableGraph "ErasableGraph"
     25\ref lemon::concept::ErasableGraph "ErasableGraph"
    2626concept
    2727you can also erase individual edges and node in arbitrary order.
     
    2929The implemented graph structures are the following.
    3030\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
    31 the \ref lemon::skeleton::ErasableGraph "ErasableGraph" concept
     31the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
    3232and it also have some convenience features.
    3333\li \ref lemon::SmartGraph "SmartGraph" is a more memory
    3434efficient version of \ref lemon::ListGraph "ListGraph". The
    3535price of it is that it only meets the
    36 \ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept,
     36\ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
    3737so you cannot delete individual edges or nodes.
    3838\li \ref lemon::SymListGraph "SymListGraph" and
     
    4646are shared by the edge pairs.
    4747\li \ref lemon::FullGraph "FullGraph"
    48 implements a full graph. It is a \ref lemon::skeleton::StaticGraph, so you cannot
     48implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot
    4949change the number of nodes once it is constructed. It is extremely memory
    5050efficient: it uses constant amount of memory independently from the number of
  • doc/groups.dox

    r947 r959  
    8181
    8282/**
    83 @defgroup skeletons Skeletons
    84 \brief Skeletons (a.k.a. concept checking classes)
     83@defgroup concept Concept
     84\brief Skeleton classes and concept checking classes
    8585
    86 This group describes the data/algorithm skeletons implemented in LEMON in
    87 order to make it easier to check if a certain template class or
    88 template function is correctly implemented.
     86This group describes the data/algorithm skeletons and concept checking
     87classes implemented in LEMON. These classes exist in order to make it
     88easier to check if a certain template class or template function is
     89correctly implemented.
    8990*/
    9091
  • doc/namespaces.dox

    r921 r959  
    99  /// \todo Some more detailed description would be nice here.
    1010  ///
    11   namespace skeleton {}
     11  namespace concept {}
    1212}
Note: See TracChangeset for help on using the changeset viewer.