Changes in doc/groups.dox [658:85cb3aa71cce:656:e6927fe719e6] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r658 r656 21 21 /** 22 22 @defgroup datas Data Structures 23 This group contains the several data structures implemented in LEMON.23 This group describes 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 contains some graph types between real graphs and graph adaptors.145 This group describes 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 light-weight structures as the adaptors. … … 153 153 \brief Map structures implemented in LEMON. 154 154 155 This group contains the map structures implemented in LEMON.155 This group describes 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 graph-related maps. 167 167 168 This group contains maps that are specifically designed to assign168 This group describes 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 contains map adaptors that are used to create "implicit"180 This group describes 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 contains two dimensional data storages implemented in LEMON.243 This group describes two dimensional data storages implemented in LEMON. 244 244 */ 245 245 … … 249 249 \brief %Path structures implemented in LEMON. 250 250 251 This group contains the path structures implemented in LEMON.251 This group describes 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 contains some data structures implemented in LEMON in267 This group describes 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 contains the several algorithms273 \brief This group describes the several algorithms 274 274 implemented in LEMON. 275 275 276 This group contains the several algorithms276 This group describes the several algorithms 277 277 implemented in LEMON. 278 278 */ … … 283 283 \brief Common graph search algorithms. 284 284 285 This group contains the common graph search algorithms, namely285 This group describes the common graph search algorithms, namely 286 286 \e breadth-first \e search (BFS) and \e depth-first \e search (DFS). 287 287 */ … … 292 292 \brief Algorithms for finding shortest paths. 293 293 294 This group contains the algorithms for finding shortest paths in digraphs.294 This group describes 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 contains the algorithms for finding maximum flows and315 This group describes the algorithms for finding maximum flows and 316 316 feasible circulations. 317 317 … … 451 451 \brief Algorithms for finding minimum cut in graphs. 452 452 453 This group contains the algorithms for finding minimum cut in graphs.453 This group describes the algorithms for finding minimum cut in graphs. 454 454 455 455 The \e minimum \e cut \e problem is to find a non-empty and non-complete … … 468 468 - \ref NagamochiIbaraki "Nagamochi-Ibaraki algorithm" for 469 469 calculating minimum cut in undirected graphs. 470 - \ref GomoryHu "Gomory-Hu tree computation" for calculating470 - \ref GomoryHuTree "Gomory-Hu tree computation" for calculating 471 471 all-pairs minimum cut in undirected graphs. 472 472 … … 476 476 477 477 /** 478 @defgroup graph_prop ertiesConnectivity and Other Graph Properties478 @defgroup graph_prop Connectivity and Other Graph Properties 479 479 @ingroup algs 480 480 \brief Algorithms for discovering the graph properties 481 481 482 This group contains the algorithms for discovering the graph properties482 This group describes the algorithms for discovering the graph properties 483 483 like connectivity, bipartiteness, euler property, simplicity etc. 484 484 … … 492 492 \brief Algorithms for planarity checking, embedding and drawing 493 493 494 This group contains the algorithms for planarity checking,494 This group describes the algorithms for planarity checking, 495 495 embedding and drawing. 496 496 … … 504 504 \brief Algorithms for finding matchings in graphs and bipartite graphs. 505 505 506 This group contains the algorithms for calculating506 This group contains algorithm objects and functions to calculate 507 507 matchings in graphs and bipartite graphs. The general matching problem is 508 finding a subset of the edges for which each node has at most one incident 509 edge. 508 finding a subset of the arcs which does not shares common endpoints. 510 509 511 510 There are several different algorithms for calculate matchings in … … 544 543 \brief Algorithms for finding a minimum cost spanning tree in a graph. 545 544 546 This group contains the algorithms for finding a minimum cost spanning545 This group describes the algorithms for finding a minimum cost spanning 547 546 tree in a graph. 548 547 */ … … 553 552 \brief Auxiliary algorithms implemented in LEMON. 554 553 555 This group contains some algorithms implemented in LEMON554 This group describes some algorithms implemented in LEMON 556 555 in order to make it easier to implement complex algorithms. 557 556 */ … … 562 561 \brief Approximation algorithms. 563 562 564 This group contains the approximation and heuristic algorithms563 This group describes the approximation and heuristic algorithms 565 564 implemented in LEMON. 566 565 */ … … 568 567 /** 569 568 @defgroup gen_opt_group General Optimization Tools 570 \brief This group contains some general optimization frameworks569 \brief This group describes some general optimization frameworks 571 570 implemented in LEMON. 572 571 573 This group contains some general optimization frameworks572 This group describes some general optimization frameworks 574 573 implemented in LEMON. 575 574 */ … … 580 579 \brief Lp and Mip solver interfaces for LEMON. 581 580 582 This group contains Lp and Mip solver interfaces for LEMON. The581 This group describes Lp and Mip solver interfaces for LEMON. The 583 582 various LP solvers could be used in the same manner with this 584 583 interface. … … 599 598 \brief Metaheuristics for LEMON library. 600 599 601 This group contains some metaheuristic optimization tools.600 This group describes some metaheuristic optimization tools. 602 601 */ 603 602 … … 614 613 \brief Simple basic graph utilities. 615 614 616 This group contains some simple basic graph utilities.615 This group describes some simple basic graph utilities. 617 616 */ 618 617 … … 622 621 \brief Tools for development, debugging and testing. 623 622 624 This group contains several useful tools for development,623 This group describes several useful tools for development, 625 624 debugging and testing. 626 625 */ … … 631 630 \brief Simple tools for measuring the performance of algorithms. 632 631 633 This group contains simple tools for measuring the performance632 This group describes simple tools for measuring the performance 634 633 of algorithms. 635 634 */ … … 640 639 \brief Exceptions defined in LEMON. 641 640 642 This group contains the exceptions defined in LEMON.641 This group describes the exceptions defined in LEMON. 643 642 */ 644 643 … … 647 646 \brief Graph Input-Output methods 648 647 649 This group contains the tools for importing and exporting graphs648 This group describes the tools for importing and exporting graphs 650 649 and graph related data. Now it supports the \ref lgf-format 651 650 "LEMON Graph Format", the \c DIMACS format and the encapsulated … … 658 657 \brief Reading and writing LEMON Graph Format. 659 658 660 This group contains methods for reading and writing659 This group describes methods for reading and writing 661 660 \ref lgf-format "LEMON Graph Format". 662 661 */ … … 667 666 \brief General \c EPS drawer and graph exporter 668 667 669 This group contains general \c EPS drawing methods and special668 This group describes general \c EPS drawing methods and special 670 669 graph exporting tools. 671 670 */ … … 691 690 \brief Skeleton classes and concept checking classes 692 691 693 This group contains the data/algorithm skeletons and concept checking692 This group describes the data/algorithm skeletons and concept checking 694 693 classes implemented in LEMON. 695 694 … … 721 720 \brief Skeleton and concept checking classes for graph structures 722 721 723 This group contains the skeletons and concept checking classes of LEMON's722 This group describes the skeletons and concept checking classes of LEMON's 724 723 graph structures and helper classes used to implement these. 725 724 */ … … 730 729 \brief Skeleton and concept checking classes for maps 731 730 732 This group contains the skeletons and concept checking classes of maps.731 This group describes the skeletons and concept checking classes of maps. 733 732 */ 734 733 … … 741 740 the \c demo subdirectory of the source tree. 742 741 743 I n order to compile them, use the <tt>make demo</tt> or the744 <tt>make check</tt> commands.742 It order to compile them, use <tt>--enable-demo</tt> configure option when 743 build the library. 745 744 */ 746 745
Note: See TracChangeset
for help on using the changeset viewer.