equal
deleted
inserted
replaced
28 #include <cmath> |
28 #include <cmath> |
29 |
29 |
30 namespace lemon { |
30 namespace lemon { |
31 |
31 |
32 /// \ingroup auxdat |
32 /// \ingroup auxdat |
33 |
33 /// |
34 /// Fibonacci Heap. |
34 ///\brief Fibonacci Heap. |
35 |
35 /// |
36 ///This class implements the \e Fibonacci \e heap data structure. A \e heap |
36 ///This class implements the \e Fibonacci \e heap data structure. A \e heap |
37 ///is a data structure for storing items with specified values called \e |
37 ///is a data structure for storing items with specified values called \e |
38 ///priorities in such a way that finding the item with minimum priority is |
38 ///priorities in such a way that finding the item with minimum priority is |
39 ///efficient. \c Compare specifies the ordering of the priorities. In a heap |
39 ///efficient. \c Compare specifies the ordering of the priorities. In a heap |
40 ///one can change the priority of an item, add or erase an item, etc. |
40 ///one can change the priority of an item, add or erase an item, etc. |