Changes in doc/groups.dox [757:f1fe0ddad6f7:762:ece80147fb08] in lemon
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r757 r762 281 281 282 282 /** 283 @defgroup geomdat Geometric Data Structures 284 @ingroup auxdat 285 \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 dimensional 290 vector with the usual operations. 291  \ref lemon::dim2::Box "dim2::Box" can be used to determine the 292 rectangular bounding box of a set of \ref lemon::dim2::Point 293 "dim2::Point"'s. 294 */ 295 296 /** 297 @defgroup matrices Matrices 298 @ingroup auxdat 299 \brief Two dimensional data storages implemented in LEMON. 300 301 This group contains two dimensional data storages implemented in LEMON. 302 */ 303 304 /** 283 305 @defgroup algs Algorithms 284 306 \brief This group contains the several algorithms … … 320 342 321 343 /** 344 @defgroup spantree Minimum Spanning Tree Algorithms 345 @ingroup algs 346 \brief Algorithms for finding minimum cost spanning trees and arborescences. 347 348 This group contains the algorithms for finding minimum cost spanning 349 trees and arborescences. 350 */ 351 352 /** 322 353 @defgroup max_flow Maximum Flow Algorithms 323 354 @ingroup algs … … 397 428 398 429 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}} 399 \sum_{uv\in A ,u\in X, v\not\in X}cap(uv) \f]430 \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f] 400 431 401 432 LEMON contains several algorithms related to minimum cut problems: … … 410 441 If you want to find minimum cut just between two distinict nodes, 411 442 see the \ref max_flow "maximum flow problem". 412 */413 414 /**415 @defgroup graph_properties Connectivity and Other Graph Properties416 @ingroup algs417 \brief Algorithms for discovering the graph properties418 419 This group contains the algorithms for discovering the graph properties420 like connectivity, bipartiteness, euler property, simplicity etc.421 422 \image html edge_biconnected_components.png423 \image latex edge_biconnected_components.eps "biedgeconnected components" width=\textwidth424 */425 426 /**427 @defgroup planar Planarity Embedding and Drawing428 @ingroup algs429 \brief Algorithms for planarity checking, embedding and drawing430 431 This group contains the algorithms for planarity checking,432 embedding and drawing.433 434 \image html planar.png435 \image latex planar.eps "Plane graph" width=\textwidth436 443 */ 437 444 … … 477 484 478 485 /** 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. 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 507 */ 508 509 /** 510 @defgroup approx Approximation Algorithms 511 @ingroup algs 512 \brief Approximation algorithms. 513 514 This group contains the approximation and heuristic algorithms 515 implemented in LEMON. 485 516 */ 486 517 … … 492 523 This group contains some algorithms implemented in LEMON 493 524 in order to make it easier to implement complex algorithms. 494 */495 496 /**497 @defgroup approx Approximation Algorithms498 @ingroup algs499 \brief Approximation algorithms.500 501 This group contains the approximation and heuristic algorithms502 implemented in LEMON.503 525 */ 504 526 … … 609 631 610 632 /** 611 @defgroup dimacs_group DIMACS format633 @defgroup dimacs_group DIMACS Format 612 634 @ingroup io_group 613 635 \brief Read and write files in DIMACS format … … 671 693 672 694 /** 695 @defgroup tools Standalone Utility Applications 696 697 Some utility applications are listed here. 698 699 The standard compilation procedure (<tt>./configure;make</tt>) will compile 700 them, as well. 701 */ 702 703 /** 673 704 \anchor demoprograms 674 705 … … 682 713 */ 683 714 684 /**685 @defgroup tools Standalone Utility Applications686 687 Some utility applications are listed here.688 689 The standard compilation procedure (<tt>./configure;make</tt>) will compile690 them, as well.691 */692 693 715 }
Note: See TracChangeset
for help on using the changeset viewer.