Changeset 2084:59769591eb60 in lemon0.x for doc/groups.dox
 Timestamp:
 05/15/06 11:49:51 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2749
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r2072 r2084 15 15 and thereafter the program code can be made efficient by small modifications. 16 16 17 The most efficient implementation of diverse applications require the usage of different physical graph implementations. These differences appear in the size of 18 graph we require to handle, memory or time usage limitations or in 19 the set of operations through which the graph can be accessed. 20 LEMON provides several physical graph structures to meet the 21 diverging requirements of the possible users. 22 In order to save on running time or on memory usage, some structures may 23 fail to provide some graph features like edge or node deletion. 17 The most efficient implementation of diverse applications require the 18 usage of different physical graph implementations. These differences 19 appear in the size of graph we require to handle, memory or time usage 20 limitations or in the set of operations through which the graph can be 21 accessed. LEMON provides several physical graph structures to meet 22 the diverging requirements of the possible users. In order to save on 23 running time or on memory usage, some structures may fail to provide 24 some graph features like edge or node deletion. 24 25 25 26 Alteration of standard containers need a very limited number of … … 77 78 78 79 Most of them are \ref lemon::concept::ReadMap "ReadMap"s. They can 79 make arithmetic oprerations between one or two maps (negation, scali g,80 make arithmetic oprerations between one or two maps (negation, scaling, 80 81 addition, multiplication etc.) or e.g. convert a map to another one 81 82 of different Value type. … … 87 88 \brief Two dimensional data storages. 88 89 89 Two dimensional 90 data storages. 91 */ 92 90 Two dimensional data storages. 91 */ 92 93 /** 94 @defgroup paths Path Structures 95 @ingroup datas 96 \brief Path structures implemented in LEMON. 97 98 LEMON provides flexible data structures 99 to work with paths. 100 101 All of them have the same interface, especially they can be built or extended 102 using a standard Builder subclass. This make is easy to have e.g. the Dijkstra 103 algorithm to store its result in any kind of path structure. 104 105 \sa lemon::concept::Path 106 107 */ 93 108 94 109 /** … … 111 126 112 127 /** 113 @defgroup galgs GraphAlgorithms114 \brief This group describes the several graphalgorithms128 @defgroup algs Algorithms 129 \brief This group describes the several algorithms 115 130 implemented in LEMON. 116 131 117 This group describes the several graphalgorithms132 This group describes the several algorithms 118 133 implemented in LEMON. 119 134 */ … … 121 136 /** 122 137 @defgroup gutils General Graph Utilities 123 @ingroup galgs138 @ingroup algs 124 139 \brief This group describes some simple general graph utilities. 125 140 126 141 This group describes some simple general graph utilities. 142 */ 143 144 /** 145 @defgroup flowalgs Path and Flow Algorithms 146 @ingroup algs 147 \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. 152 153 \image html flow.png 154 \image latex flow.eps "Graph flow" width=\textwidth 155 */ 156 157 /** 158 @defgroup topology Topology related algorithms 159 @ingroup algs 160 \brief This group describes the algorithms 161 for discover the topology of the graphs. 162 163 This group describes the algorithms 164 for discover the topology of the graphs. 165 166 \image html edge_biconnected_components.png 167 \image latex edge_biconnected_components.eps "biedgeconnected components" width=\textwidth 168 169 */ 170 171 /** 172 @defgroup matching Matching algorithms in graphs and bipartite graphs 173 @ingroup algs 174 \brief This group describes the algorithms 175 for find matchings in graphs and bipartite graphs. 176 177 This group provides some algorithm objects and function 178 to calculate matchings in graphs and bipartite graphs. 179 180 \image html bipartite_matching.png 181 \image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth 182 183 */ 184 185 /** 186 @defgroup spantree Minimum Cost Spanning Tree Algorithms 187 @ingroup algs 188 \brief This group containes the algorithms for finding a minimum cost spanning 189 tree in a graph 190 191 This group containes the algorithms for finding a minimum cost spanning 192 tree in a graph 193 */ 194 195 196 /** 197 @defgroup auxalg Auxiliary Algorithms 198 @ingroup algs 199 \brief Some algorithms implemented in LEMON. 200 201 This group describes the algorithms in LEMON in order to make 202 it easier to implement complex algorithms. 203 127 204 */ 128 205 … … 135 212 implemented in LEMON. 136 213 137 */138 139 /**140 @defgroup flowalgs Path and Flow Algorithms141 @ingroup galgs142 \brief This group describes the algorithms143 for finding paths and flows in graphs.144 145 This group describes the algorithms146 for finding paths and flows in graphs.147 148 \image html flow.png149 \image latex flow.eps "Graph flow" width=\textwidth150 */151 152 /**153 @defgroup topology Topology related algorithms154 @ingroup galgs155 \brief This group describes the algorithms156 for discover the topology of the graphs.157 158 This group describes the algorithms159 for discover the topology of the graphs.160 161 \image html edge_biconnected_components.png162 \image latex edge_biconnected_components.eps "biedgeconnected components" width=\textwidth163 164 */165 166 /**167 @defgroup matching Matching algorithms in graphs and bipartite graphs168 @ingroup galgs169 \brief This group describes the algorithms170 for find matchings in graphs and bipartite graphs.171 172 This group provides some algorithm objects and function173 to calculate matchings in graphs and bipartite graphs.174 175 \image html bipartite_matching.png176 \image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth177 178 */179 180 /**181 @defgroup exceptions Exceptions182 This group contains the exceptions thrown by LEMON library183 214 */ 184 215 … … 198 229 /** 199 230 @defgroup io_group InputOutput 200 Here you can find tools for imporing and exporting graphs and graph related 201 data 231 \brief Several Graph InputOutput methods 232 233 Here you can find tools for importing and exporting graphs 234 and graph related data. Now it supports the LEMON format, the 235 dimacs format and the encapsulated postscript format. 236 */ 237 238 /** 239 @defgroup lemon_io Lemon InputOutput 240 @ingroup io_group 241 \brief Reading and writing LEMON format 242 243 Methods for reading and writing LEMON format. More about this 244 format you can find on the \ref graphiopage "Graph InputOutput" 245 tutorial pages. 246 202 247 */ 203 248 204 249 /** 205 250 @defgroup section_io Section readers and writers 206 @ingroup io_group251 @ingroup lemon_io 207 252 \brief Section readers and writers for lemon InputOutput. 208 253 … … 213 258 /** 214 259 @defgroup item_io Item Readers and Writers 215 @ingroup io_group260 @ingroup lemon_io 216 261 \brief Item readers and writers for lemon InputOutput. 217 262 … … 222 267 223 268 /** 269 @defgroup eps_io Postscript exporting 270 @ingroup io_group 271 \brief General EPS drawer and graph exporter 272 273 This group contains general EPS drawing methods and special 274 graph exporting tools. 275 */ 276 277 /** 278 @defgroup exceptions Exceptions 279 This group contains the exceptions thrown by LEMON library 280 */ 281 282 /** 224 283 @defgroup concept Concepts 225 284 \brief Skeleton classes and concept checking classes … … 234 293 235 294 */ 295 236 296 237 297 /**
Note: See TracChangeset
for help on using the changeset viewer.