r710:f1fe0ddad6f7
Wed, 08 Jul 2009 17:22:36
[Not Reviewed]
0 comments (0 inline)
0
6
0
| ... | ... |
@@ -226,14 +226,6 @@ |
| 226 | 226 |
*/ |
| 227 | 227 |
|
| 228 | 228 |
/** |
| 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 |
/** |
|
| 237 | 229 |
@defgroup paths Path Structures |
| 238 | 230 |
@ingroup datas |
| 239 | 231 |
\brief %Path structures implemented in LEMON. |
| ... | ... |
@@ -246,7 +238,36 @@ |
| 246 | 238 |
efficient to have e.g. the Dijkstra algorithm to store its result in |
| 247 | 239 |
any kind of path structure. |
| 248 | 240 |
|
| 249 |
\sa |
|
| 241 |
\sa \ref concepts::Path "Path concept" |
|
| 242 |
*/ |
|
| 243 |
|
|
| 244 |
/** |
|
| 245 |
@defgroup heaps Heap Structures |
|
| 246 |
@ingroup datas |
|
| 247 |
\brief %Heap structures implemented in LEMON. |
|
| 248 |
|
|
| 249 |
This group contains the heap structures implemented in LEMON. |
|
| 250 |
|
|
| 251 |
LEMON provides several heap classes. They are efficient implementations |
|
| 252 |
of the abstract data type \e priority \e queue. They store items with |
|
| 253 |
specified values called \e priorities in such a way that finding and |
|
| 254 |
removing the item with minimum priority are efficient. |
|
| 255 |
The basic operations are adding and erasing items, changing the priority |
|
| 256 |
of an item, etc. |
|
| 257 |
|
|
| 258 |
Heaps are crucial in several algorithms, such as Dijkstra and Prim. |
|
| 259 |
The heap implementations have the same interface, thus any of them can be |
|
| 260 |
used easily in such algorithms. |
|
| 261 |
|
|
| 262 |
\sa \ref concepts::Heap "Heap concept" |
|
| 263 |
*/ |
|
| 264 |
|
|
| 265 |
/** |
|
| 266 |
@defgroup matrices Matrices |
|
| 267 |
@ingroup datas |
|
| 268 |
\brief Two dimensional data storages implemented in LEMON. |
|
| 269 |
|
|
| 270 |
This group contains two dimensional data storages implemented in LEMON. |
|
| 250 | 271 |
*/ |
| 251 | 272 |
|
| 252 | 273 |
/** |
| ... | ... |
@@ -19,7 +19,7 @@ |
| 19 | 19 |
#ifndef LEMON_BIN_HEAP_H |
| 20 | 20 |
#define LEMON_BIN_HEAP_H |
| 21 | 21 |
|
| 22 |
///\ingroup |
|
| 22 |
///\ingroup heaps |
|
| 23 | 23 |
///\file |
| 24 | 24 |
///\brief Binary heap implementation. |
| 25 | 25 |
|
| ... | ... |
@@ -29,7 +29,7 @@ |
| 29 | 29 |
|
| 30 | 30 |
namespace lemon {
|
| 31 | 31 |
|
| 32 |
/// \ingroup |
|
| 32 |
/// \ingroup heaps |
|
| 33 | 33 |
/// |
| 34 | 34 |
/// \brief Binary heap data structure. |
| 35 | 35 |
/// |
| ... | ... |
@@ -19,7 +19,7 @@ |
| 19 | 19 |
#ifndef LEMON_BUCKET_HEAP_H |
| 20 | 20 |
#define LEMON_BUCKET_HEAP_H |
| 21 | 21 |
|
| 22 |
///\ingroup |
|
| 22 |
///\ingroup heaps |
|
| 23 | 23 |
///\file |
| 24 | 24 |
///\brief Bucket heap implementation. |
| 25 | 25 |
|
| ... | ... |
@@ -53,7 +53,7 @@ |
| 53 | 53 |
|
| 54 | 54 |
} |
| 55 | 55 |
|
| 56 |
/// \ingroup |
|
| 56 |
/// \ingroup heaps |
|
| 57 | 57 |
/// |
| 58 | 58 |
/// \brief Bucket heap data structure. |
| 59 | 59 |
/// |
| ... | ... |
@@ -371,7 +371,7 @@ |
| 371 | 371 |
|
| 372 | 372 |
}; // class BucketHeap |
| 373 | 373 |
|
| 374 |
/// \ingroup |
|
| 374 |
/// \ingroup heaps |
|
| 375 | 375 |
/// |
| 376 | 376 |
/// \brief Simplified bucket heap data structure. |
| 377 | 377 |
/// |
| ... | ... |
@@ -36,7 +36,7 @@ |
| 36 | 36 |
/// \brief The heap concept. |
| 37 | 37 |
/// |
| 38 | 38 |
/// This concept class describes the main interface of heaps. |
| 39 |
/// The various heap structures are efficient |
|
| 39 |
/// The various \ref heaps "heap structures" are efficient |
|
| 40 | 40 |
/// implementations of the abstract data type \e priority \e queue. |
| 41 | 41 |
/// They store items with specified values called \e priorities |
| 42 | 42 |
/// in such a way that finding and removing the item with minimum |
| ... | ... |
@@ -20,7 +20,7 @@ |
| 20 | 20 |
#define LEMON_FIB_HEAP_H |
| 21 | 21 |
|
| 22 | 22 |
///\file |
| 23 |
///\ingroup |
|
| 23 |
///\ingroup heaps |
|
| 24 | 24 |
///\brief Fibonacci heap implementation. |
| 25 | 25 |
|
| 26 | 26 |
#include <vector> |
| ... | ... |
@@ -30,7 +30,7 @@ |
| 30 | 30 |
|
| 31 | 31 |
namespace lemon {
|
| 32 | 32 |
|
| 33 |
/// \ingroup |
|
| 33 |
/// \ingroup heaps |
|
| 34 | 34 |
/// |
| 35 | 35 |
/// \brief Fibonacci heap data structure. |
| 36 | 36 |
/// |
| ... | ... |
@@ -19,7 +19,7 @@ |
| 19 | 19 |
#ifndef LEMON_RADIX_HEAP_H |
| 20 | 20 |
#define LEMON_RADIX_HEAP_H |
| 21 | 21 |
|
| 22 |
///\ingroup |
|
| 22 |
///\ingroup heaps |
|
| 23 | 23 |
///\file |
| 24 | 24 |
///\brief Radix heap implementation. |
| 25 | 25 |
|
| ... | ... |
@@ -29,7 +29,7 @@ |
| 29 | 29 |
namespace lemon {
|
| 30 | 30 |
|
| 31 | 31 |
|
| 32 |
/// \ingroup |
|
| 32 |
/// \ingroup heaps |
|
| 33 | 33 |
/// |
| 34 | 34 |
/// \brief Radix heap data structure. |
| 35 | 35 |
/// |
0 comments (0 inline)