Changeset 2376:0ed45a6c74b1 in lemon0.x for doc/groups.dox
 Timestamp:
 02/21/07 14:30:21 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3195
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r2371 r2376 116 116 */ 117 117 118 /**119 @defgroup graphbits Tools to Make It Easier to Make Graphs120 @ingroup auxdat121 \brief Tools to Make It Easier to Make Graphs.122 123 This group describes the tools that makes it easier to make graphs and124 the maps that dynamically update with the graph changes.125 */126 118 127 119 /** … … 135 127 136 128 /** 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 132 search algorithms. 133 134 This group contains the common graph 135 search algorithms like Bfs and Dfs. 136 */ 137 138 /** 139 @defgroup shortest_path Shortest Path algorithms 146 140 @ingroup algs 147 141 \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. 142 for finding shortest paths. 143 144 This group describes the algorithms for finding shortest paths in 145 graphs. 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 154 This group describes the algorithms for finding maximum flows. 152 155 153 156 \image html flow.png … … 156 159 157 160 /** 161 @defgroup min_cost_flow Minimum Cost Flow algorithms 162 @ingroup algs 163 164 \brief This group describes the algorithms 165 for finding minimum cost flows and circulations. 166 167 This group describes the algorithms for finding minimum cost flows and 168 circulations. 169 */ 170 171 /** 172 @defgroup min_cut Minimum Cut algorithms 173 @ingroup algs 174 \brief This group describes the algorithms 175 for finding minimum cut in graphs. 176 177 This group describes the algorithms 178 for finding minimum cut in graphs. 179 */ 180 181 /** 158 182 @defgroup topology Topology related algorithms 159 183 @ingroup algs … … 169 193 170 194 /** 171 @defgroup matching Matching algorithms in graphs and bipartite graphs195 @defgroup matching Matching algorithms 172 196 @ingroup algs 173 197 \brief This group describes the algorithms … … 183 207 184 208 /** 185 @defgroup spantree Minimum Cost Spanning Tree Algorithms209 @defgroup spantree Minimum Spanning Tree algorithms 186 210 @ingroup algs 187 211 \brief This group contains the algorithms for finding a minimum cost spanning … … 194 218 195 219 /** 196 @defgroup auxalg Auxiliary Algorithms220 @defgroup auxalg Auxiliary algorithms 197 221 @ingroup algs 198 222 \brief Some algorithms implemented in LEMON. … … 200 224 This group describes the algorithms in LEMON in order to make 201 225 it easier to implement complex algorithms. 202 226 */ 227 228 /** 229 @defgroup approx Approximation algorithms 230 \brief Approximation algorithms 231 232 Approximation and heuristic algorithms 203 233 */ 204 234 … … 232 262 This group adds some helper tools to general optimization framework 233 263 implemented in LEMON. 234 235 264 */ 236 265 … … 244 273 245 274 /** 275 @defgroup utils Tools and Utilities 276 \brief Tools and Utilities for Programming in LEMON 277 278 Tools 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 286 This group describes some simple basic graph utilities. 287 */ 288 289 /** 246 290 @defgroup misc Miscellaneous Tools 291 @ingroup utils 247 292 Here you can find several useful tools for development, 248 293 debugging and testing. 249 294 */ 295 250 296 251 297 /** … … 257 303 258 304 /** 305 @defgroup graphbits Tools for Graph Implementation 306 @ingroup utils 307 \brief Tools to Make It Easier to Make Graphs. 308 309 This group describes the tools that makes it easier to make graphs and 310 the maps that dynamically update with the graph changes. 311 */ 312 313 /** 314 @defgroup exceptions Exceptions 315 @ingroup utils 316 This group contains the exceptions thrown by LEMON library 317 */ 318 319 /** 259 320 @defgroup io_group InputOutput 260 321 \brief Several Graph InputOutput methods … … 303 364 */ 304 365 305 /**306 @defgroup exceptions Exceptions307 This group contains the exceptions thrown by LEMON library308 */309 366 310 367 /**
Note: See TracChangeset
for help on using the changeset viewer.