Changeset 2117:96efb4fa0736 in lemon0.x for doc/groups.dox
 Timestamp:
 07/04/06 19:49:01 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2827
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r2084 r2117 26 26 Alteration of standard containers need a very limited number of 27 27 operations, these together satisfy the everyday requirements. 28 In the case of graph stru tures, different operations are needed which do28 In the case of graph structures, different operations are needed which do 29 29 not alter the physical graph, but gives another view. If some nodes or 30 30 edges have to be hidden or the reverse oriented graph have to be used, then 31 this is the case. It also may happen that in a flow implemen ation31 this is the case. It also may happen that in a flow implementation 32 32 the residual graph can be accessed by another algorithm, or a nodeset 33 33 is to be shrunk for another algorithm. … … 46 46 \brief Graph types between real graphs and graph adaptors. 47 47 48 Graph types between real graphs and graph adaptors. These classes 49 wrap graphs to give new functionality as the adaptors do it. But the 50 other way they are not lightweigthstructures as the adaptors.48 Graph types between real graphs and graph adaptors. These classes wrap 49 graphs to give new functionality as the adaptors do it. On the other 50 hand they are not lightweight structures as the adaptors. 51 51 */ 52 52 … … 78 78 79 79 Most of them are \ref lemon::concept::ReadMap "ReadMap"s. They can 80 make arithmetic op rerations between one or two maps (negation, scaling,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 82 82 of different Value type. … … 186 186 @defgroup spantree Minimum Cost Spanning Tree Algorithms 187 187 @ingroup algs 188 \brief This group contain es the algorithms for finding a minimum cost spanning188 \brief This group contains the algorithms for finding a minimum cost spanning 189 189 tree in a graph 190 190 191 This group contain es the algorithms for finding a minimum cost spanning191 This group contains the algorithms for finding a minimum cost spanning 192 192 tree in a graph 193 193 */ … … 233 233 Here you can find tools for importing and exporting graphs 234 234 and graph related data. Now it supports the LEMON format, the 235 dimacsformat and the encapsulated postscript format.235 \c DIMACS format and the encapsulated postscript format. 236 236 */ 237 237 … … 269 269 @defgroup eps_io Postscript exporting 270 270 @ingroup io_group 271 \brief General EPS drawer and graph exporter272 273 This group contains general EPS drawing methods and special271 \brief General \c EPS drawer and graph exporter 272 273 This group contains general \c EPS drawing methods and special 274 274 graph exporting tools. 275 275 */ … … 287 287 classes implemented in LEMON. 288 288 289 One aim of these classes is to make it easier to check if a certain 290 class or template function is correctly implemented. 291 292 The other (sometimes even more important) aim is to document the concepts. 289 The purpose of the classes in this group is fourfold. 290 291  These classes contain the documentations of the concepts. In order 292 to avoid document multiplications, an implementation of a concept 293 simply refers to the corresponding concept class. 294 295  These classes declare every functions, <tt>typedef<tt>s etc. an 296 implementation of the concepts should provide, however completely 297 without implementations and real data structures behind the 298 interface. On the other hand they should provide nothing else. All 299 the algorithms working on a data structure meeting a certain concept 300 should compile with these classes. (Though it will not run properly, 301 of course.) In this way it is easily to check if an algorithm 302 doesn't use any extra feature of a certain implementation. 303 304  The concept descriptor classes also provide a <em>checker class<em> 305 that makes it possible check whether a certain implementation of a 306 concept indeed provides all the required features. 307 308  Finally, They can serve as a skeleton of a new implementation of a concept. 293 309 294 310 */
Note: See TracChangeset
for help on using the changeset viewer.