COIN-OR::LEMON - Graph Library

Changeset 2376:0ed45a6c74b1 in lemon-0.x for doc


Ignore:
Timestamp:
02/21/07 14:30:21 (12 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3195
Message:

Reorganization of the modules and groups

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r2371 r2376  
    116116*/
    117117
    118 /**
    119 @defgroup graphbits Tools to Make It Easier to Make Graphs
    120 @ingroup auxdat
    121 \brief Tools to Make It Easier to Make Graphs.
    122 
    123 This group describes the tools that makes it easier to make graphs and
    124 the maps that dynamically update with the graph changes.
    125 */
    126118
    127119/**
     
    135127
    136128/**
    137 @defgroup gutils Basic Graph Utilities
    138 @ingroup algs
    139 \brief This group describes some simple basic graph utilities.
    140 
    141 This group describes some simple basic graph utilities.
    142 */
    143 
    144 /**
    145 @defgroup flowalgs Path and Flow Algorithms
     129@defgroup search Graph Search
     130@ingroup algs
     131\brief This group contains the common graph
     132search algorithms.
     133
     134This group contains the common graph
     135search algorithms like Bfs and Dfs.
     136*/
     137
     138/**
     139@defgroup shortest_path Shortest Path algorithms
    146140@ingroup algs
    147141\brief This group describes the algorithms
    148 for finding paths and flows in graphs.
    149 
    150 This group describes the algorithms
    151 for finding paths and flows in graphs.
     142for finding shortest paths.
     143
     144This group describes the algorithms for finding shortest paths in
     145graphs.
     146
     147*/
     148
     149/**
     150@defgroup max_flow Maximum Flow algorithms
     151@ingroup algs
     152\brief This group describes the algorithms for finding maximum flows.
     153
     154This group describes the algorithms for finding maximum flows.
    152155
    153156\image html flow.png
     
    156159
    157160/**
     161@defgroup min_cost_flow Minimum Cost Flow algorithms
     162@ingroup algs
     163
     164\brief This group describes the algorithms
     165for finding minimum cost flows and circulations.
     166
     167This group describes the algorithms for finding minimum cost flows and
     168circulations. 
     169*/
     170
     171/**
     172@defgroup min_cut Minimum Cut algorithms
     173@ingroup algs
     174\brief This group describes the algorithms
     175for finding minimum cut in graphs.
     176
     177This group describes the algorithms
     178for finding minimum cut in graphs.
     179*/
     180
     181/**
    158182@defgroup topology Topology related algorithms
    159183@ingroup algs
     
    169193
    170194/**
    171 @defgroup matching Matching algorithms in graphs and bipartite graphs
     195@defgroup matching Matching algorithms
    172196@ingroup algs
    173197\brief This group describes the algorithms
     
    183207
    184208/**
    185 @defgroup spantree Minimum Cost Spanning Tree Algorithms
     209@defgroup spantree Minimum Spanning Tree algorithms
    186210@ingroup algs
    187211\brief This group contains the algorithms for finding a minimum cost spanning
     
    194218
    195219/**
    196 @defgroup auxalg Auxiliary Algorithms
     220@defgroup auxalg Auxiliary algorithms
    197221@ingroup algs
    198222\brief Some algorithms implemented in LEMON.
     
    200224This group describes the algorithms in LEMON in order to make
    201225it easier to implement complex algorithms.
    202 
     226*/
     227
     228/**
     229@defgroup approx Approximation algorithms
     230\brief Approximation algorithms
     231
     232Approximation and heuristic algorithms
    203233*/
    204234
     
    232262This group adds some helper tools to general optimization framework
    233263implemented in LEMON.
    234 
    235264*/
    236265
     
    244273
    245274/**
     275@defgroup utils Tools and Utilities
     276\brief Tools and Utilities for Programming in LEMON
     277
     278Tools and Utilities for Programming in LEMON
     279*/
     280
     281/**
     282@defgroup gutils Basic Graph Utilities
     283@ingroup utils
     284\brief This group describes some simple basic graph utilities.
     285
     286This group describes some simple basic graph utilities.
     287*/
     288
     289/**
    246290@defgroup misc Miscellaneous Tools
     291@ingroup utils
    247292Here you can find several useful tools for development,
    248293debugging and testing.
    249294*/
     295
    250296
    251297/**
     
    257303
    258304/**
     305@defgroup graphbits Tools for Graph Implementation
     306@ingroup utils
     307\brief Tools to Make It Easier to Make Graphs.
     308
     309This group describes the tools that makes it easier to make graphs and
     310the maps that dynamically update with the graph changes.
     311*/
     312
     313/**
     314@defgroup exceptions Exceptions
     315@ingroup utils
     316This group contains the exceptions thrown by LEMON library
     317*/
     318
     319/**
    259320@defgroup io_group Input-Output
    260321\brief Several Graph Input-Output methods
     
    303364*/
    304365
    305 /**
    306 @defgroup exceptions Exceptions
    307 This group contains the exceptions thrown by LEMON library
    308 */
    309366
    310367/**
Note: See TracChangeset for help on using the changeset viewer.