summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc/groups.dox

changeset 762 | ece80147fb08 |

parent 761 | 98a30824fe36 |

parent 757 | f1fe0ddad6f7 |

child 789 | 8e68671af789 |

1.1 --- a/doc/groups.dox Fri Jul 24 11:07:52 2009 +0200 1.2 +++ b/doc/groups.dox Fri Sep 25 09:06:32 2009 +0200 1.3 @@ -238,7 +238,36 @@ 1.4 efficient to have e.g. the Dijkstra algorithm to store its result in 1.5 any kind of path structure. 1.6 1.7 -\sa lemon::concepts::Path 1.8 +\sa \ref concepts::Path "Path concept" 1.9 +*/ 1.10 + 1.11 +/** 1.12 +@defgroup heaps Heap Structures 1.13 +@ingroup datas 1.14 +\brief %Heap structures implemented in LEMON. 1.15 + 1.16 +This group contains the heap structures implemented in LEMON. 1.17 + 1.18 +LEMON provides several heap classes. They are efficient implementations 1.19 +of the abstract data type \e priority \e queue. They store items with 1.20 +specified values called \e priorities in such a way that finding and 1.21 +removing the item with minimum priority are efficient. 1.22 +The basic operations are adding and erasing items, changing the priority 1.23 +of an item, etc. 1.24 + 1.25 +Heaps are crucial in several algorithms, such as Dijkstra and Prim. 1.26 +The heap implementations have the same interface, thus any of them can be 1.27 +used easily in such algorithms. 1.28 + 1.29 +\sa \ref concepts::Heap "Heap concept" 1.30 +*/ 1.31 + 1.32 +/** 1.33 +@defgroup matrices Matrices 1.34 +@ingroup datas 1.35 +\brief Two dimensional data storages implemented in LEMON. 1.36 + 1.37 +This group contains two dimensional data storages implemented in LEMON. 1.38 */ 1.39 1.40 /**