COIN-OR::LEMON - Graph Library

Changeset 761:98a30824fe36 in lemon


Ignore:
Timestamp:
07/24/09 11:07:52 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Rearrange modules (#303)

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r760 r761  
    227227
    228228/**
    229 @defgroup matrices Matrices
    230 @ingroup datas
    231 \brief Two dimensional data storages implemented in LEMON.
    232 
    233 This group contains two dimensional data storages implemented in LEMON.
    234 */
    235 
    236 /**
    237229@defgroup paths Path Structures
    238230@ingroup datas
     
    257249This group contains some data structures implemented in LEMON in
    258250order to make it easier to implement combinatorial algorithms.
     251*/
     252
     253/**
     254@defgroup geomdat Geometric Data Structures
     255@ingroup auxdat
     256\brief Geometric data structures implemented in LEMON.
     257
     258This group contains geometric data structures implemented in LEMON.
     259
     260 - \ref lemon::dim2::Point "dim2::Point" implements a two dimensional
     261   vector with the usual operations.
     262 - \ref lemon::dim2::Box "dim2::Box" can be used to determine the
     263   rectangular bounding box of a set of \ref lemon::dim2::Point
     264   "dim2::Point"'s.
     265*/
     266
     267/**
     268@defgroup matrices Matrices
     269@ingroup auxdat
     270\brief Two dimensional data storages implemented in LEMON.
     271
     272This group contains two dimensional data storages implemented in LEMON.
    259273*/
    260274
     
    299313
    300314/**
     315@defgroup spantree Minimum Spanning Tree Algorithms
     316@ingroup algs
     317\brief Algorithms for finding minimum cost spanning trees and arborescences.
     318
     319This group contains the algorithms for finding minimum cost spanning
     320trees and arborescences.
     321*/
     322
     323/**
    301324@defgroup max_flow Maximum Flow Algorithms
    302325@ingroup algs
     
    389412If you want to find minimum cut just between two distinict nodes,
    390413see the \ref max_flow "maximum flow problem".
    391 */
    392 
    393 /**
    394 @defgroup graph_properties Connectivity and Other Graph Properties
    395 @ingroup algs
    396 \brief Algorithms for discovering the graph properties
    397 
    398 This group contains the algorithms for discovering the graph properties
    399 like connectivity, bipartiteness, euler property, simplicity etc.
    400 
    401 \image html connected_components.png
    402 \image latex connected_components.eps "Connected components" width=\textwidth
    403 */
    404 
    405 /**
    406 @defgroup planar Planarity Embedding and Drawing
    407 @ingroup algs
    408 \brief Algorithms for planarity checking, embedding and drawing
    409 
    410 This group contains the algorithms for planarity checking,
    411 embedding and drawing.
    412 
    413 \image html planar.png
    414 \image latex planar.eps "Plane graph" width=\textwidth
    415414*/
    416415
     
    456455
    457456/**
    458 @defgroup spantree Minimum Spanning Tree Algorithms
    459 @ingroup algs
    460 \brief Algorithms for finding minimum cost spanning trees and arborescences.
    461 
    462 This group contains the algorithms for finding minimum cost spanning
    463 trees and arborescences.
     457@defgroup graph_properties Connectivity and Other Graph Properties
     458@ingroup algs
     459\brief Algorithms for discovering the graph properties
     460
     461This group contains the algorithms for discovering the graph properties
     462like connectivity, bipartiteness, euler property, simplicity etc.
     463
     464\image html connected_components.png
     465\image latex connected_components.eps "Connected components" width=\textwidth
     466*/
     467
     468/**
     469@defgroup planar Planarity Embedding and Drawing
     470@ingroup algs
     471\brief Algorithms for planarity checking, embedding and drawing
     472
     473This group contains the algorithms for planarity checking,
     474embedding and drawing.
     475
     476\image html planar.png
     477\image latex planar.eps "Plane graph" width=\textwidth
     478*/
     479
     480/**
     481@defgroup approx Approximation Algorithms
     482@ingroup algs
     483\brief Approximation algorithms.
     484
     485This group contains the approximation and heuristic algorithms
     486implemented in LEMON.
    464487*/
    465488
     
    471494This group contains some algorithms implemented in LEMON
    472495in order to make it easier to implement complex algorithms.
    473 */
    474 
    475 /**
    476 @defgroup approx Approximation Algorithms
    477 @ingroup algs
    478 \brief Approximation algorithms.
    479 
    480 This group contains the approximation and heuristic algorithms
    481 implemented in LEMON.
    482496*/
    483497
     
    588602
    589603/**
    590 @defgroup dimacs_group DIMACS format
     604@defgroup dimacs_group DIMACS Format
    591605@ingroup io_group
    592606\brief Read and write files in DIMACS format
     
    650664
    651665/**
     666@defgroup tools Standalone Utility Applications
     667
     668Some utility applications are listed here.
     669
     670The standard compilation procedure (<tt>./configure;make</tt>) will compile
     671them, as well.
     672*/
     673
     674/**
    652675\anchor demoprograms
    653676
     
    661684*/
    662685
    663 /**
    664 @defgroup tools Standalone Utility Applications
    665 
    666 Some utility applications are listed here.
    667 
    668 The standard compilation procedure (<tt>./configure;make</tt>) will compile
    669 them, as well.
    670 */
    671 
    672686}
  • lemon/dim2.h

    r463 r761  
    2222#include <iostream>
    2323
    24 ///\ingroup misc
     24///\ingroup geomdat
    2525///\file
    2626///\brief A simple two dimensional vector and a bounding box implementation
    27 ///
    28 /// The class \ref lemon::dim2::Point "dim2::Point" implements
    29 /// a two dimensional vector with the usual operations.
    30 ///
    31 /// The class \ref lemon::dim2::Box "dim2::Box" can be used to determine
    32 /// the rectangular bounding box of a set of
    33 /// \ref lemon::dim2::Point "dim2::Point"'s.
    3427
    3528namespace lemon {
     
    4134  namespace dim2 {
    4235
    43   /// \addtogroup misc
     36  /// \addtogroup geomdat
    4437  /// @{
    4538
Note: See TracChangeset for help on using the changeset viewer.