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

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

skeleton(s) -> concept renaming

Location:
doc
Files:
4 edited

Unmodified
Removed
• ## doc/Doxyfile

 r953 namespaces.dox \ ../src/lemon \ ../src/lemon/skeletons \ ../src/lemon/concept \ ../src/test/test_tools.h
• ## doc/graphs.dox

 r921 Each graph should meet the \ref lemon::skeleton::StaticGraph "StaticGraph" concept. \ref lemon::concept::StaticGraph "StaticGraph" concept. This concept does not makes it possible to change the graph (i.e. it is not possible to add The graphs meeting the \ref lemon::skeleton::ExtendableGraph "ExtendableGraph" \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept allow node and edge addition. You can also "clear" (i.e. erase all edges and nodes) In case of graphs meeting the full feature \ref lemon::skeleton::ErasableGraph "ErasableGraph" \ref lemon::concept::ErasableGraph "ErasableGraph" concept you can also erase individual edges and node in arbitrary order. The implemented graph structures are the following. \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets the \ref lemon::skeleton::ErasableGraph "ErasableGraph" concept the \ref lemon::concept::ErasableGraph "ErasableGraph" concept and it also have some convenience features. \li \ref lemon::SmartGraph "SmartGraph" is a more memory efficient version of \ref lemon::ListGraph "ListGraph". The price of it is that it only meets the \ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept, \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept, so you cannot delete individual edges or nodes. \li \ref lemon::SymListGraph "SymListGraph" and are shared by the edge pairs. \li \ref lemon::FullGraph "FullGraph" implements a full graph. It is a \ref lemon::skeleton::StaticGraph, so you cannot implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot change the number of nodes once it is constructed. It is extremely memory efficient: it uses constant amount of memory independently from the number of
• ## doc/groups.dox

 r947 /** @defgroup skeletons Skeletons \brief Skeletons (a.k.a. concept checking classes) @defgroup concept Concept \brief Skeleton classes and concept checking classes This group describes the data/algorithm skeletons implemented in LEMON in order to make it easier to check if a certain template class or template function is correctly implemented. This group describes the data/algorithm skeletons and concept checking classes implemented in LEMON. These classes exist in order to make it easier to check if a certain template class or template function is correctly implemented. */
• ## doc/namespaces.dox

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