Changeset 2376:0ed45a6c74b1 in lemon-0.x
- Timestamp:
- 02/21/07 14:30:21 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3195
- Files:
-
- 16 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 Input-Output 260 321 \brief Several Graph Input-Output methods … … 303 364 */ 304 365 305 /**306 @defgroup exceptions Exceptions307 This group contains the exceptions thrown by LEMON library308 */309 366 310 367 /** -
lemon/bellman_ford.h
r2362 r2376 20 20 #define LEMON_BELMANN_FORD_H 21 21 22 /// \ingroup flowalgs22 /// \ingroup shortest_path 23 23 /// \file 24 24 /// \brief BellmanFord algorithm. … … 145 145 /// \brief %BellmanFord algorithm class. 146 146 /// 147 /// \ingroup flowalgs147 /// \ingroup shortest_path 148 148 /// This class provides an efficient implementation of \c Bellman-Ford 149 149 /// algorithm. The edge lengths are passed to the algorithm using a … … 1023 1023 /// \brief Function type interface for BellmanFord algorithm. 1024 1024 /// 1025 /// \ingroup flowalgs1025 /// \ingroup shortest_path 1026 1026 /// Function type interface for BellmanFord algorithm. 1027 1027 /// -
lemon/bfs.h
r2350 r2376 20 20 #define LEMON_BFS_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup search 23 23 ///\file 24 24 ///\brief Bfs algorithm. … … 113 113 ///%BFS algorithm class. 114 114 115 ///\ingroup flowalgs115 ///\ingroup search 116 116 ///This class provides an efficient implementation of the %BFS algorithm. 117 117 /// … … 1074 1074 ///Function type interface for Bfs algorithm. 1075 1075 1076 /// \ingroup flowalgs1076 /// \ingroup search 1077 1077 ///Function type interface for Bfs algorithm. 1078 1078 /// … … 1188 1188 /// %BFS Visit algorithm class. 1189 1189 1190 /// \ingroup flowalgs1190 /// \ingroup search 1191 1191 /// This class provides an efficient implementation of the %BFS algorithm 1192 1192 /// with visitor interface. -
lemon/circulation.h
r2375 r2376 24 24 #include <lemon/elevator.h> 25 25 26 ///\ingroup flowalgs26 ///\ingroup max_flow 27 27 ///\file 28 28 ///\brief Push-prelabel algorithm for finding a feasible circulation. -
lemon/csp.h
r2373 r2376 20 20 #define LEMON_CSP_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup approx 23 23 ///\file 24 24 ///\brief Algorithm for the Resource Constrained Shortest Path problem. -
lemon/dfs.h
r2335 r2376 20 20 #define LEMON_DFS_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup search 23 23 ///\file 24 24 ///\brief Dfs algorithm. … … 115 115 ///%DFS algorithm class. 116 116 117 ///\ingroup flowalgs117 ///\ingroup search 118 118 ///This class provides an efficient implementation of the %DFS algorithm. 119 119 /// … … 1048 1048 ///Function type interface for Dfs algorithm. 1049 1049 1050 /// \ingroup flowalgs1050 ///\ingroup search 1051 1051 ///Function type interface for Dfs algorithm. 1052 1052 /// … … 1175 1175 /// %DFS Visit algorithm class. 1176 1176 1177 /// \ingroup flowalgs1177 /// \ingroup search 1178 1178 /// This class provides an efficient implementation of the %DFS algorithm 1179 1179 /// with visitor interface. -
lemon/dijkstra.h
r2358 r2376 20 20 #define LEMON_DIJKSTRA_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup shortest_path 23 23 ///\file 24 24 ///\brief Dijkstra algorithm. … … 141 141 ///%Dijkstra algorithm class. 142 142 143 /// \ingroup flowalgs143 /// \ingroup shortest_path 144 144 ///This class provides an efficient implementation of %Dijkstra algorithm. 145 145 ///The edge lengths are passed to the algorithm using a … … 1108 1108 ///Function type interface for Dijkstra algorithm. 1109 1109 1110 /// \ingroup flowalgs1110 /// \ingroup shortest_path 1111 1111 ///Function type interface for Dijkstra algorithm. 1112 1112 /// -
lemon/edmonds_karp.h
r2151 r2376 21 21 22 22 /// \file 23 /// \ingroup flowalgs23 /// \ingroup max_flow 24 24 /// \brief Implementation of the Edmonds-Karp algorithm. 25 25 … … 30 30 namespace lemon { 31 31 32 /// \ingroup flowalgs32 /// \ingroup max_flow 33 33 /// \brief Edmonds-Karp algorithms class. 34 34 /// -
lemon/floyd_warshall.h
r2335 r2376 20 20 #define LEMON_FLOYD_WARSHALL_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup shortest_path 23 23 /// \file 24 24 /// \brief FloydWarshall algorithm. … … 148 148 /// \brief %FloydWarshall algorithm class. 149 149 /// 150 /// \ingroup flowalgs150 /// \ingroup shortest_path 151 151 /// This class provides an efficient implementation of \c Floyd-Warshall 152 152 /// algorithm. The edge lengths are passed to the algorithm using a -
lemon/hao_orlin.h
r2340 r2376 35 35 36 36 /// \file 37 /// \ingroup flowalgs37 /// \ingroup min_cut 38 38 /// \brief Implementation of the Hao-Orlin algorithm. 39 39 /// … … 43 43 namespace lemon { 44 44 45 /// \ingroup flowalgs45 /// \ingroup min_cut 46 46 /// 47 47 /// \brief %Hao-Orlin algorithm to find a minimum cut in directed graphs. -
lemon/johnson.h
r2335 r2376 20 20 #define LEMON_JOHNSON_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup shortest_path 23 23 /// \file 24 24 /// \brief Johnson algorithm. … … 181 181 /// \brief %Johnson algorithm class. 182 182 /// 183 /// \ingroup flowalgs183 /// \ingroup shortest_path 184 184 /// This class provides an efficient implementation of \c %Johnson 185 185 /// algorithm. The edge lengths are passed to the algorithm using a -
lemon/matrix_maps.h
r2305 r2376 552 552 ///"ReferenceMatrixMap". 553 553 /// 554 ///\warning Do not use this map type when the two item sets are 555 ///equal or based on the same item set. 556 /// 554 557 ///\param _FirstContainer the desired type of first container. It is 555 558 ///ususally a Graph type, but can be any type with alteration -
lemon/nagamochi_ibaraki.h
r2337 r2376 19 19 20 20 21 /// \ingroup topology21 /// \ingroup min_cut 22 22 /// \file 23 23 /// \brief Maximum cardinality search and minimum cut in undirected … … 157 157 }; 158 158 159 /// \ingroup topology159 /// \ingroup search 160 160 /// 161 161 /// \brief Maximum Cardinality Search algorithm class. … … 833 833 }; 834 834 835 /// \ingroup topology835 /// \ingroup min_cut 836 836 /// 837 837 /// \brief Calculates the minimum cut in an undirected graph. -
lemon/preflow.h
r2350 r2376 30 30 31 31 /// \file 32 /// \ingroup flowalgs32 /// \ingroup max_flow 33 33 /// \brief Implementation of the preflow algorithm. 34 34 35 35 namespace lemon { 36 36 37 ///\ingroup flowalgs37 ///\ingroup max_flow 38 38 ///\brief %Preflow algorithms class. 39 39 /// … … 891 891 }; 892 892 893 ///\ingroup flowalgs893 ///\ingroup max_flow 894 894 ///\brief Function type interface for Preflow algorithm. 895 895 /// -
lemon/ssp_min_cost_flow.h
r2350 r2376 20 20 #define LEMON_MIN_COST_FLOW_H 21 21 22 ///\ingroup flowalgs22 ///\ingroup min_cost_flow 23 23 /// 24 24 ///\file … … 34 34 namespace lemon { 35 35 36 /// \addtogroup flowalgs36 /// \addtogroup min_cost_flow 37 37 /// @{ 38 38 -
lemon/suurballe.h
r2335 r2376 32 32 namespace lemon { 33 33 34 /// \addtogroup flowalgs34 /// \addtogroup shortest_path 35 35 /// @{ 36 36
Note: See TracChangeset
for help on using the changeset viewer.