Fibonacchi-Heap(フィボナッチヒープ) (structure/heap/fibonacchi-heap.hpp)

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Include: #include "structure/heap/fibonacchi-heap.hpp"
• Link: https://www.cs.princeton.edu/~wayne/teaching/fibonacci-heap.pdf

Required by

• Prim Fibonacchi Heap(最小全域木) (graph/mst/prim-fibonacchi-heap.hpp)
• Dijkstra-Fibonacchi-Heap(単一始点最短路) (graph/shortest-path/dijkstra-fibonacchi-heap.hpp)

Verified with

• test/verify/aoj-grl-1-a-2.test.cpp
• test/verify/aoj-grl-2-a-4.test.cpp

Code

/**
 * @brief Fibonacchi-Heap(フィボナッチヒープ)
 * @see https://www.cs.princeton.edu/~wayne/teaching/fibonacci-heap.pdf
 */
template <typename key_t, typename val_t>
struct FibonacchiHeap {
  struct Node {
    key_t key;
    val_t val;
    Node *left, *right, *child, *par;
    int sz;
    bool mark;

    Node(const key_t &key, const val_t &val)
        : key(key),
          val(val),
          left(this),
          right(this),
          par(nullptr),
          child(nullptr),
          sz(0),
          mark(false) {}
  };

  Node *root;
  size_t sz;
  vector<Node *> rank;

  FibonacchiHeap() : root(nullptr), sz(0) {}

  size_t size() const { return sz; }

  bool empty() const { return sz == 0; }

  void update_min(Node *t) {
    if (!root || t->key < root->key) {
      root = t;
    }
  }

  void concat(Node *&r, Node *t) {
    if (!r) {
      r = t;
    } else {
      t->left->right = r->right;
      r->right->left = t->left;
      t->left = r;
      r->right = t;
    }
  }

  void delete_node(Node *t) {
    t->left->right = t->right;
    t->right->left = t->left;
    t->left = t;
    t->right = t;
  }

  Node *push(const key_t &key, const val_t &val) {
    ++sz;
    auto node = new Node(key, val);
    concat(root, node);
    update_min(node);
    return node;
  }

  Node *consolidate(Node *s, Node *t) {
    if (root == s || s->key < t->key) {
      delete_node(t);
      ++s->sz;
      t->par = s;
      concat(s->child, t);
      return s;
    } else {
      delete_node(s);
      ++t->sz;
      s->par = t;
      concat(t->child, s);
      return t;
    }
  }

  pair<key_t, val_t> pop() {
    --sz;

    Node *rem = root;

    auto ret = make_pair(rem->key, rem->val);

    {
      root = root->left == root ? nullptr : root->left;
      delete_node(rem);
    }

    if (rem->child) {
      concat(root, rem->child);
    }

    if (root) {
      {
        Node *base = root, *cur = base;
        do {
          cur->par = nullptr;
          update_min(cur);
          cur = cur->right;
        } while (cur != base);
      }

      {
        Node *base = root;
        int last = -1;
        do {
          Node *nxt = base->right;
          while (base->sz < rank.size() && rank[base->sz]) {
            Node *u = rank[base->sz];
            rank[base->sz] = nullptr;
            base = consolidate(u, base);
          }
          if (base->sz >= rank.size()) rank.resize(base->sz + 1);
          last = max(last, base->sz);
          rank[base->sz] = base;
          base = nxt;
        } while (base != root);

        for (int i = last; i >= 0; i--) rank[i] = nullptr;
      }
    }

    return ret;
  }

  inline void mark_dfs(Node *t) {
    if (!t->par) {
      t->mark = false;
    } else if (t->mark) {
      mark_dfs(t->par);
      t->par->child = t->left == t ? nullptr : t->left;
      delete_node(t);
      t->sz--;
      t->mark = false;
      t->par = nullptr;
      concat(root, t);
    } else {
      t->mark = true;
      t->sz--;
    }
  }

  void decrease_key(Node *t, const key_t &d) {
    t->key -= d;

    if (!t->par) {
      update_min(t);
      return;
    }

    if (t->par->key <= t->key) {
      return;
    }

    t->sz++;
    t->mark = true;
    mark_dfs(t);
    update_min(t);
  }
};

#line 1 "structure/heap/fibonacchi-heap.hpp"
/**
 * @brief Fibonacchi-Heap(フィボナッチヒープ)
 * @see https://www.cs.princeton.edu/~wayne/teaching/fibonacci-heap.pdf
 */
template <typename key_t, typename val_t>
struct FibonacchiHeap {
  struct Node {
    key_t key;
    val_t val;
    Node *left, *right, *child, *par;
    int sz;
    bool mark;

    Node(const key_t &key, const val_t &val)
        : key(key),
          val(val),
          left(this),
          right(this),
          par(nullptr),
          child(nullptr),
          sz(0),
          mark(false) {}
  };

  Node *root;
  size_t sz;
  vector<Node *> rank;

  FibonacchiHeap() : root(nullptr), sz(0) {}

  size_t size() const { return sz; }

  bool empty() const { return sz == 0; }

  void update_min(Node *t) {
    if (!root || t->key < root->key) {
      root = t;
    }
  }

  void concat(Node *&r, Node *t) {
    if (!r) {
      r = t;
    } else {
      t->left->right = r->right;
      r->right->left = t->left;
      t->left = r;
      r->right = t;
    }
  }

  void delete_node(Node *t) {
    t->left->right = t->right;
    t->right->left = t->left;
    t->left = t;
    t->right = t;
  }

  Node *push(const key_t &key, const val_t &val) {
    ++sz;
    auto node = new Node(key, val);
    concat(root, node);
    update_min(node);
    return node;
  }

  Node *consolidate(Node *s, Node *t) {
    if (root == s || s->key < t->key) {
      delete_node(t);
      ++s->sz;
      t->par = s;
      concat(s->child, t);
      return s;
    } else {
      delete_node(s);
      ++t->sz;
      s->par = t;
      concat(t->child, s);
      return t;
    }
  }

  pair<key_t, val_t> pop() {
    --sz;

    Node *rem = root;

    auto ret = make_pair(rem->key, rem->val);

    {
      root = root->left == root ? nullptr : root->left;
      delete_node(rem);
    }

    if (rem->child) {
      concat(root, rem->child);
    }

    if (root) {
      {
        Node *base = root, *cur = base;
        do {
          cur->par = nullptr;
          update_min(cur);
          cur = cur->right;
        } while (cur != base);
      }

      {
        Node *base = root;
        int last = -1;
        do {
          Node *nxt = base->right;
          while (base->sz < rank.size() && rank[base->sz]) {
            Node *u = rank[base->sz];
            rank[base->sz] = nullptr;
            base = consolidate(u, base);
          }
          if (base->sz >= rank.size()) rank.resize(base->sz + 1);
          last = max(last, base->sz);
          rank[base->sz] = base;
          base = nxt;
        } while (base != root);

        for (int i = last; i >= 0; i--) rank[i] = nullptr;
      }
    }

    return ret;
  }

  inline void mark_dfs(Node *t) {
    if (!t->par) {
      t->mark = false;
    } else if (t->mark) {
      mark_dfs(t->par);
      t->par->child = t->left == t ? nullptr : t->left;
      delete_node(t);
      t->sz--;
      t->mark = false;
      t->par = nullptr;
      concat(root, t);
    } else {
      t->mark = true;
      t->sz--;
    }
  }

  void decrease_key(Node *t, const key_t &d) {
    t->key -= d;

    if (!t->par) {
      update_min(t);
      return;
    }

    if (t->par->key <= t->key) {
      return;
    }

    t->sz++;
    t->mark = true;
    mark_dfs(t);
    update_min(t);
  }
};

Back to top page