equal
deleted
inserted
replaced
1 // -*- C++ -*- |
1 // -*- C++ -*- |
2 |
2 |
3 #ifndef HUGO_FIB_HEAP_H |
3 #ifndef HUGO_FIB_HEAP_H |
4 #define HUGO_FIB_HEAP_H |
4 #define HUGO_FIB_HEAP_H |
5 |
5 |
|
6 ///ingroup auxdat |
6 ///\file |
7 ///\file |
7 ///\brief Fibonacci Heap implementation. |
8 ///\brief Fibonacci Heap implementation. |
8 |
9 |
9 #include <vector> |
10 #include <vector> |
10 #include <functional> |
11 #include <functional> |
11 #include <math.h> |
12 #include <math.h> |
12 |
13 |
13 namespace hugo { |
14 namespace hugo { |
14 |
15 |
|
16 /// \addtogroup auxdat |
|
17 /// @{ |
|
18 |
15 /// An implementation of the Fibonacci Heap. |
19 /// An implementation of the Fibonacci Heap. |
16 |
20 |
17 /** |
21 /** |
18 This class implements the \e Fibonacci \e heap data structure. A \e heap |
22 This class implements the \e Fibonacci \e heap data structure. A \e heap |
19 is a data structure for storing items with specified values called \e |
23 is a data structure for storing items with specified values called \e |
488 int rightn=container[a].right_neighbor; |
492 int rightn=container[a].right_neighbor; |
489 container[leftn].right_neighbor=rightn; |
493 container[leftn].right_neighbor=rightn; |
490 container[rightn].left_neighbor=leftn; |
494 container[rightn].left_neighbor=leftn; |
491 } |
495 } |
492 |
496 |
|
497 ///@} |
|
498 |
493 } //namespace hugo |
499 } //namespace hugo |
494 #endif |
500 #endif |