Changes in doc/groups.dox [715:ece80147fb08:710:f1fe0ddad6f7] in lemon-main
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r715 r710 281 281 282 282 /** 283 @defgroup geomdat Geometric Data Structures284 @ingroup auxdat285 \brief Geometric data structures implemented in LEMON.286 287 This group contains geometric data structures implemented in LEMON.288 289 - \ref lemon::dim2::Point "dim2::Point" implements a two dimensional290 vector with the usual operations.291 - \ref lemon::dim2::Box "dim2::Box" can be used to determine the292 rectangular bounding box of a set of \ref lemon::dim2::Point293 "dim2::Point"'s.294 */295 296 /**297 @defgroup matrices Matrices298 @ingroup auxdat299 \brief Two dimensional data storages implemented in LEMON.300 301 This group contains two dimensional data storages implemented in LEMON.302 */303 304 /**305 283 @defgroup algs Algorithms 306 284 \brief This group contains the several algorithms … … 342 320 343 321 /** 344 @defgroup spantree Minimum Spanning Tree Algorithms345 @ingroup algs346 \brief Algorithms for finding minimum cost spanning trees and arborescences.347 348 This group contains the algorithms for finding minimum cost spanning349 trees and arborescences.350 */351 352 /**353 322 @defgroup max_flow Maximum Flow Algorithms 354 323 @ingroup algs … … 428 397 429 398 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}} 430 \sum_{uv\in A :u\in X, v\not\in X}cap(uv) \f]399 \sum_{uv\in A, u\in X, v\not\in X}cap(uv) \f] 431 400 432 401 LEMON contains several algorithms related to minimum cut problems: … … 441 410 If you want to find minimum cut just between two distinict nodes, 442 411 see the \ref max_flow "maximum flow problem". 412 */ 413 414 /** 415 @defgroup graph_properties Connectivity and Other Graph Properties 416 @ingroup algs 417 \brief Algorithms for discovering the graph properties 418 419 This group contains the algorithms for discovering the graph properties 420 like connectivity, bipartiteness, euler property, simplicity etc. 421 422 \image html edge_biconnected_components.png 423 \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth 424 */ 425 426 /** 427 @defgroup planar Planarity Embedding and Drawing 428 @ingroup algs 429 \brief Algorithms for planarity checking, embedding and drawing 430 431 This group contains the algorithms for planarity checking, 432 embedding and drawing. 433 434 \image html planar.png 435 \image latex planar.eps "Plane graph" width=\textwidth 443 436 */ 444 437 … … 484 477 485 478 /** 486 @defgroup graph_properties Connectivity and Other Graph Properties 487 @ingroup algs 488 \brief Algorithms for discovering the graph properties 489 490 This group contains the algorithms for discovering the graph properties 491 like connectivity, bipartiteness, euler property, simplicity etc. 492 493 \image html connected_components.png 494 \image latex connected_components.eps "Connected components" width=\textwidth 495 */ 496 497 /** 498 @defgroup planar Planarity Embedding and Drawing 499 @ingroup algs 500 \brief Algorithms for planarity checking, embedding and drawing 501 502 This group contains the algorithms for planarity checking, 503 embedding and drawing. 504 505 \image html planar.png 506 \image latex planar.eps "Plane graph" width=\textwidth 479 @defgroup spantree Minimum Spanning Tree Algorithms 480 @ingroup algs 481 \brief Algorithms for finding minimum cost spanning trees and arborescences. 482 483 This group contains the algorithms for finding minimum cost spanning 484 trees and arborescences. 485 */ 486 487 /** 488 @defgroup auxalg Auxiliary Algorithms 489 @ingroup algs 490 \brief Auxiliary algorithms implemented in LEMON. 491 492 This group contains some algorithms implemented in LEMON 493 in order to make it easier to implement complex algorithms. 507 494 */ 508 495 … … 514 501 This group contains the approximation and heuristic algorithms 515 502 implemented in LEMON. 516 */517 518 /**519 @defgroup auxalg Auxiliary Algorithms520 @ingroup algs521 \brief Auxiliary algorithms implemented in LEMON.522 523 This group contains some algorithms implemented in LEMON524 in order to make it easier to implement complex algorithms.525 503 */ 526 504 … … 631 609 632 610 /** 633 @defgroup dimacs_group DIMACS Format611 @defgroup dimacs_group DIMACS format 634 612 @ingroup io_group 635 613 \brief Read and write files in DIMACS format … … 693 671 694 672 /** 673 \anchor demoprograms 674 675 @defgroup demos Demo Programs 676 677 Some demo programs are listed here. Their full source codes can be found in 678 the \c demo subdirectory of the source tree. 679 680 In order to compile them, use the <tt>make demo</tt> or the 681 <tt>make check</tt> commands. 682 */ 683 684 /** 695 685 @defgroup tools Standalone Utility Applications 696 686 … … 701 691 */ 702 692 703 /**704 \anchor demoprograms705 706 @defgroup demos Demo Programs707 708 Some demo programs are listed here. Their full source codes can be found in709 the \c demo subdirectory of the source tree.710 711 In order to compile them, use the <tt>make demo</tt> or the712 <tt>make check</tt> commands.713 */714 715 693 }
Note: See TracChangeset
for help on using the changeset viewer.