equal
deleted
inserted
replaced
25 #include <functional> |
25 #include <functional> |
26 #include <cmath> |
26 #include <cmath> |
27 |
27 |
28 namespace lemon { |
28 namespace lemon { |
29 |
29 |
30 /// \addtogroup auxdat |
30 /// \ingroup auxdat |
31 /// @{ |
|
32 |
31 |
33 /// Fibonacci Heap. |
32 /// Fibonacci Heap. |
34 |
33 |
35 ///This class implements the \e Fibonacci \e heap data structure. A \e heap |
34 ///This class implements the \e Fibonacci \e heap data structure. A \e heap |
36 ///is a data structure for storing items with specified values called \e |
35 ///is a data structure for storing items with specified values called \e |
505 int rightn=container[a].right_neighbor; |
504 int rightn=container[a].right_neighbor; |
506 container[leftn].right_neighbor=rightn; |
505 container[leftn].right_neighbor=rightn; |
507 container[rightn].left_neighbor=leftn; |
506 container[rightn].left_neighbor=leftn; |
508 } |
507 } |
509 |
508 |
510 ///@} |
|
511 |
509 |
512 } //namespace lemon |
510 } //namespace lemon |
513 |
511 |
514 #endif //LEMON_FIB_HEAP_H |
512 #endif //LEMON_FIB_HEAP_H |
515 |
513 |