heap.hpp

 
#ifndef FMM_HEAP_HPP
#define FMM_HEAP_HPP
 
#include "network/type.hpp"
#include "fiboheap/fiboheap.h"
 
namespace FMM {
namespace NETWORK{
struct HeapNode
{
  NodeIndex index; 
  double value; 
  bool operator<(const HeapNode &rhs) const {
    if (value == rhs.value) return (index < rhs.index);
    return value < rhs.value;
  };
};
 
class Heap{
public:
  inline void push(NodeIndex index, double value){
    HeapNodeHandle handle = heap.push({index,value});
    handle_data.insert({index,handle});
  };
  inline void pop(){
    HeapNode &node = heap.top();
    handle_data.erase(node.index);
    heap.pop();
  };
  inline HeapNode top(){
    return heap.top();
  };
  inline bool empty(){
    return heap.empty();
  };
  inline unsigned int size(){
    return heap.size();
  };
  inline bool contain_node(NodeIndex index){
    return handle_data.find(index)!=handle_data.end();
  };
  inline void decrease_key(NodeIndex index,double value){
    HeapNodeHandle handle = handle_data[index];
    heap.decrease_key(handle,{index,value});
  };
 
private:
  typedef FibHeap<HeapNode>::FibNode *HeapNodeHandle;
  FibHeap<HeapNode> heap;
  std::unordered_map<NodeIndex,HeapNodeHandle> handle_data;
}; // Heap
}; // NETWORK
}; //FMM
 
#endif