Changeset 959:c80ef5912903 in lemon-0.x for doc
- Timestamp:
- 11/04/04 21:24:59 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1342
- Location:
- doc
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/Doxyfile
r953 r959 432 432 namespaces.dox \ 433 433 ../src/lemon \ 434 ../src/lemon/ skeletons\434 ../src/lemon/concept \ 435 435 ../src/test/test_tools.h 436 436 -
doc/graphs.dox
r921 r959 10 10 11 11 Each graph should meet the 12 \ref lemon:: skeleton::StaticGraph "StaticGraph" concept.12 \ref lemon::concept::StaticGraph "StaticGraph" concept. 13 13 This concept does not 14 14 makes it possible to change the graph (i.e. it is not possible to add … … 17 17 18 18 The graphs meeting the 19 \ref lemon:: skeleton::ExtendableGraph "ExtendableGraph"19 \ref lemon::concept::ExtendableGraph "ExtendableGraph" 20 20 concept allow node and 21 21 edge addition. You can also "clear" (i.e. erase all edges and nodes) … … 23 23 24 24 In case of graphs meeting the full feature 25 \ref lemon:: skeleton::ErasableGraph "ErasableGraph"25 \ref lemon::concept::ErasableGraph "ErasableGraph" 26 26 concept 27 27 you can also erase individual edges and node in arbitrary order. … … 29 29 The implemented graph structures are the following. 30 30 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets 31 the \ref lemon:: skeleton::ErasableGraph "ErasableGraph" concept31 the \ref lemon::concept::ErasableGraph "ErasableGraph" concept 32 32 and it also have some convenience features. 33 33 \li \ref lemon::SmartGraph "SmartGraph" is a more memory 34 34 efficient version of \ref lemon::ListGraph "ListGraph". The 35 35 price of it is that it only meets the 36 \ref lemon:: skeleton::ExtendableGraph "ExtendableGraph" concept,36 \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept, 37 37 so you cannot delete individual edges or nodes. 38 38 \li \ref lemon::SymListGraph "SymListGraph" and … … 46 46 are shared by the edge pairs. 47 47 \li \ref lemon::FullGraph "FullGraph" 48 implements a full graph. It is a \ref lemon:: skeleton::StaticGraph, so you cannot48 implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot 49 49 change the number of nodes once it is constructed. It is extremely memory 50 50 efficient: it uses constant amount of memory independently from the number of -
doc/groups.dox
r947 r959 81 81 82 82 /** 83 @defgroup skeletons Skeletons84 \brief Skeleton s (a.k.a. concept checking classes)83 @defgroup concept Concept 84 \brief Skeleton classes and concept checking classes 85 85 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. 86 This group describes the data/algorithm skeletons and concept checking 87 classes implemented in LEMON. These classes exist in order to make it 88 easier to check if a certain template class or template function is 89 correctly implemented. 89 90 */ 90 91 -
doc/namespaces.dox
r921 r959 9 9 /// \todo Some more detailed description would be nice here. 10 10 /// 11 namespace skeleton{}11 namespace concept {} 12 12 }
Note: See TracChangeset
for help on using the changeset viewer.