Changeset 606:c5fd2d996909 in lemon for doc
 Timestamp:
 03/29/09 23:08:20 (11 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 doc
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r478 r606 21 21 /** 22 22 @defgroup datas Data Structures 23 This group describes the several data structures implemented in LEMON.23 This group contains the several data structures implemented in LEMON. 24 24 */ 25 25 … … 143 143 \brief Graph types between real graphs and graph adaptors. 144 144 145 This group describes some graph types between real graphs and graph adaptors.145 This group contains some graph types between real graphs and graph adaptors. 146 146 These classes wrap graphs to give new functionality as the adaptors do it. 147 147 On the other hand they are not lightweight structures as the adaptors. … … 153 153 \brief Map structures implemented in LEMON. 154 154 155 This group describes the map structures implemented in LEMON.155 This group contains the map structures implemented in LEMON. 156 156 157 157 LEMON provides several special purpose maps and map adaptors that e.g. combine … … 166 166 \brief Special graphrelated maps. 167 167 168 This group describes maps that are specifically designed to assign168 This group contains maps that are specifically designed to assign 169 169 values to the nodes and arcs/edges of graphs. 170 170 … … 178 178 \brief Tools to create new maps from existing ones 179 179 180 This group describes map adaptors that are used to create "implicit"180 This group contains map adaptors that are used to create "implicit" 181 181 maps from other maps. 182 182 … … 241 241 \brief Two dimensional data storages implemented in LEMON. 242 242 243 This group describes two dimensional data storages implemented in LEMON.243 This group contains two dimensional data storages implemented in LEMON. 244 244 */ 245 245 … … 249 249 \brief %Path structures implemented in LEMON. 250 250 251 This group describes the path structures implemented in LEMON.251 This group contains the path structures implemented in LEMON. 252 252 253 253 LEMON provides flexible data structures to work with paths. … … 265 265 \brief Auxiliary data structures implemented in LEMON. 266 266 267 This group describes some data structures implemented in LEMON in267 This group contains some data structures implemented in LEMON in 268 268 order to make it easier to implement combinatorial algorithms. 269 269 */ … … 271 271 /** 272 272 @defgroup algs Algorithms 273 \brief This group describes the several algorithms273 \brief This group contains the several algorithms 274 274 implemented in LEMON. 275 275 276 This group describes the several algorithms276 This group contains the several algorithms 277 277 implemented in LEMON. 278 278 */ … … 283 283 \brief Common graph search algorithms. 284 284 285 This group describes the common graph search algorithms, namely285 This group contains the common graph search algorithms, namely 286 286 \e breadthfirst \e search (BFS) and \e depthfirst \e search (DFS). 287 287 */ … … 292 292 \brief Algorithms for finding shortest paths. 293 293 294 This group describes the algorithms for finding shortest paths in digraphs.294 This group contains the algorithms for finding shortest paths in digraphs. 295 295 296 296  \ref Dijkstra algorithm for finding shortest paths from a source node … … 313 313 \brief Algorithms for finding maximum flows. 314 314 315 This group describes the algorithms for finding maximum flows and315 This group contains the algorithms for finding maximum flows and 316 316 feasible circulations. 317 317 … … 346 346 \brief Algorithms for finding minimum cost flows and circulations. 347 347 348 This group describes the algorithms for finding minimum cost flows and348 This group contains the algorithms for finding minimum cost flows and 349 349 circulations. 350 350 … … 383 383 \brief Algorithms for finding minimum cut in graphs. 384 384 385 This group describes the algorithms for finding minimum cut in graphs.385 This group contains the algorithms for finding minimum cut in graphs. 386 386 387 387 The \e minimum \e cut \e problem is to find a nonempty and noncomplete … … 400 400  \ref NagamochiIbaraki "NagamochiIbaraki algorithm" for 401 401 calculating minimum cut in undirected graphs. 402  \ref GomoryHu Tree"GomoryHu tree computation" for calculating402  \ref GomoryHu "GomoryHu tree computation" for calculating 403 403 allpairs minimum cut in undirected graphs. 404 404 … … 412 412 \brief Algorithms for discovering the graph properties 413 413 414 This group describes the algorithms for discovering the graph properties414 This group contains the algorithms for discovering the graph properties 415 415 like connectivity, bipartiteness, euler property, simplicity etc. 416 416 … … 424 424 \brief Algorithms for planarity checking, embedding and drawing 425 425 426 This group describes the algorithms for planarity checking,426 This group contains the algorithms for planarity checking, 427 427 embedding and drawing. 428 428 … … 475 475 \brief Algorithms for finding a minimum cost spanning tree in a graph. 476 476 477 This group describes the algorithms for finding a minimum cost spanning477 This group contains the algorithms for finding a minimum cost spanning 478 478 tree in a graph. 479 479 */ … … 484 484 \brief Auxiliary algorithms implemented in LEMON. 485 485 486 This group describes some algorithms implemented in LEMON486 This group contains some algorithms implemented in LEMON 487 487 in order to make it easier to implement complex algorithms. 488 488 */ … … 493 493 \brief Approximation algorithms. 494 494 495 This group describes the approximation and heuristic algorithms495 This group contains the approximation and heuristic algorithms 496 496 implemented in LEMON. 497 497 */ … … 499 499 /** 500 500 @defgroup gen_opt_group General Optimization Tools 501 \brief This group describes some general optimization frameworks501 \brief This group contains some general optimization frameworks 502 502 implemented in LEMON. 503 503 504 This group describes some general optimization frameworks504 This group contains some general optimization frameworks 505 505 implemented in LEMON. 506 506 */ … … 511 511 \brief Lp and Mip solver interfaces for LEMON. 512 512 513 This group describes Lp and Mip solver interfaces for LEMON. The513 This group contains Lp and Mip solver interfaces for LEMON. The 514 514 various LP solvers could be used in the same manner with this 515 515 interface. … … 530 530 \brief Metaheuristics for LEMON library. 531 531 532 This group describes some metaheuristic optimization tools.532 This group contains some metaheuristic optimization tools. 533 533 */ 534 534 … … 545 545 \brief Simple basic graph utilities. 546 546 547 This group describes some simple basic graph utilities.547 This group contains some simple basic graph utilities. 548 548 */ 549 549 … … 553 553 \brief Tools for development, debugging and testing. 554 554 555 This group describes several useful tools for development,555 This group contains several useful tools for development, 556 556 debugging and testing. 557 557 */ … … 562 562 \brief Simple tools for measuring the performance of algorithms. 563 563 564 This group describes simple tools for measuring the performance564 This group contains simple tools for measuring the performance 565 565 of algorithms. 566 566 */ … … 571 571 \brief Exceptions defined in LEMON. 572 572 573 This group describes the exceptions defined in LEMON.573 This group contains the exceptions defined in LEMON. 574 574 */ 575 575 … … 578 578 \brief Graph InputOutput methods 579 579 580 This group describes the tools for importing and exporting graphs580 This group contains the tools for importing and exporting graphs 581 581 and graph related data. Now it supports the \ref lgfformat 582 582 "LEMON Graph Format", the \c DIMACS format and the encapsulated … … 589 589 \brief Reading and writing LEMON Graph Format. 590 590 591 This group describes methods for reading and writing591 This group contains methods for reading and writing 592 592 \ref lgfformat "LEMON Graph Format". 593 593 */ … … 598 598 \brief General \c EPS drawer and graph exporter 599 599 600 This group describes general \c EPS drawing methods and special600 This group contains general \c EPS drawing methods and special 601 601 graph exporting tools. 602 602 */ … … 622 622 \brief Skeleton classes and concept checking classes 623 623 624 This group describes the data/algorithm skeletons and concept checking624 This group contains the data/algorithm skeletons and concept checking 625 625 classes implemented in LEMON. 626 626 … … 652 652 \brief Skeleton and concept checking classes for graph structures 653 653 654 This group describes the skeletons and concept checking classes of LEMON's654 This group contains the skeletons and concept checking classes of LEMON's 655 655 graph structures and helper classes used to implement these. 656 656 */ … … 661 661 \brief Skeleton and concept checking classes for maps 662 662 663 This group describes the skeletons and concept checking classes of maps.663 This group contains the skeletons and concept checking classes of maps. 664 664 */ 665 665 
doc/mainpage.dox
r463 r606 46 46 "Quick Tour to LEMON" which will guide you along. 47 47 48 If you already feel like using our library, see the page that tells you 49 \ref getstart "How to start using LEMON". 50 51 If you 52 want to see how LEMON works, see 53 some \ref demoprograms "demo programs". 48 If you already feel like using our library, see the 49 <a class="el" href="http://lemon.cs.elte.hu/pub/tutorial/">LEMON Tutorial</a>. 54 50 55 51 If you know what you are looking for then try to find it under the 56 <a class="el" href="modules.html">Modules</a> 57 section. 52 <a class="el" href="modules.html">Modules</a> section. 58 53 59 54 If you are a user of the old (0.x) series of LEMON, please check out the
Note: See TracChangeset
for help on using the changeset viewer.