Changeset 2260:4274224f8a7d in lemon-0.x for doc
- Timestamp:
- 10/24/06 19:19:16 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
- Location:
- doc
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/graphs.dox
r2116 r2260 12 12 as incoming and outgoing edges of a given node. 13 13 14 Each graph should meet the \ref lemon::concept ::Graph "Graph" concept.14 Each graph should meet the \ref lemon::concepts::Graph "Graph" concept. 15 15 This concept does not make it possible to change the graph (i.e. it is 16 16 not possible to add or delete edges or nodes). Most of the graph … … 19 19 20 20 In case of graphs meeting the full feature 21 \ref lemon::concept ::ErasableGraph "ErasableGraph"21 \ref lemon::concepts::ErasableGraph "ErasableGraph" 22 22 concept 23 23 you can also erase individual edges and nodes in arbitrary order. … … 25 25 The implemented graph structures are the following. 26 26 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets 27 the \ref lemon::concept ::ErasableGraph "ErasableGraph" concept27 the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept 28 28 and it also has some convenient extra features. 29 29 \li \ref lemon::SmartGraph "SmartGraph" is a more memory 30 30 efficient version of \ref lemon::ListGraph "ListGraph". The 31 31 price of this is that it only meets the 32 \ref lemon::concept ::ExtendableGraph "ExtendableGraph" concept,32 \ref lemon::concepts::ExtendableGraph "ExtendableGraph" concept, 33 33 so you cannot delete individual edges or nodes. 34 34 \li \ref lemon::FullGraph "FullGraph" 35 35 implements a complete graph. It is a 36 \ref lemon::concept ::Graph "Graph", so you cannot36 \ref lemon::concepts::Graph "Graph", so you cannot 37 37 change the number of nodes once it is constructed. It is extremely memory 38 38 efficient: it uses constant amount of memory independently from the number of -
doc/groups.dox
r2233 r2260 77 77 Map adaptors are used to create "implicit" maps from other maps. 78 78 79 Most of them are \ref lemon::concept ::ReadMap "ReadMap"s. They can79 Most of them are \ref lemon::concepts::ReadMap "ReadMap"s. They can 80 80 make arithmetic operations between one or two maps (negation, scaling, 81 81 addition, multiplication etc.) or e.g. convert a map to another one … … 103 103 algorithm to store its result in any kind of path structure. 104 104 105 \sa lemon::concept ::Path105 \sa lemon::concepts::Path 106 106 107 107 */ -
doc/maps.dox
r1788 r2260 14 14 15 15 A map can be 16 \e readable (\ref lemon::concept ::ReadMap "ReadMap", for short),17 \e writable (\ref lemon::concept ::WriteMap "WriteMap") or both18 (\ref lemon::concept ::ReadWriteMap "ReadWriteMap").16 \e readable (\ref lemon::concepts::ReadMap "ReadMap", for short), 17 \e writable (\ref lemon::concepts::WriteMap "WriteMap") or both 18 (\ref lemon::concepts::ReadWriteMap "ReadWriteMap"). 19 19 There also exists a special type of 20 ReadWrite map called \ref lemon::concept ::ReferenceMap "reference map".20 ReadWrite map called \ref lemon::concepts::ReferenceMap "reference map". 21 21 In addition that you can 22 22 read and write the values of a key, a reference map -
doc/namespaces.dox
r2157 r2260 9 9 /// The namespace of LEMON concepts and concept checking classes 10 10 /// 11 namespace concept {}11 namespace concepts {} 12 12 }
Note: See TracChangeset
for help on using the changeset viewer.