[Lemon-commits] Balazs Dezso: Port remaining heaps from SVN -r 3...
Lemon HG
hg at lemon.cs.elte.hu
Thu Jun 25 14:55:59 CEST 2009
details: http://lemon.cs.elte.hu/hg/lemon/rev/532697c9fa53
changeset: 729:532697c9fa53
user: Balazs Dezso <deba [at] inf.elte.hu>
date: Thu Jun 11 22:11:29 2009 +0200
description:
Port remaining heaps from SVN -r 3509 (#50)
- FibHeap
- RadixHeap
- BucketHeap
- SimpleBucketHeap
diffstat:
lemon/Makefile.am | 3 +
lemon/bucket_heap.h | 831 +++++++++++++++++++++++++++++++++++++++++++++++++++++++
lemon/fib_heap.h | 467 +++++++++++++++++++++++++++++++
lemon/radix_heap.h | 433 ++++++++++++++++++++++++++++
test/heap_test.cc | 37 ++
5 files changed, 1771 insertions(+), 0 deletions(-)
diffs (truncated from 1826 to 300 lines):
diff --git a/lemon/Makefile.am b/lemon/Makefile.am
--- a/lemon/Makefile.am
+++ b/lemon/Makefile.am
@@ -59,6 +59,7 @@
lemon/assert.h \
lemon/bfs.h \
lemon/bin_heap.h \
+ lemon/bucket_heap.h \
lemon/cbc.h \
lemon/circulation.h \
lemon/clp.h \
@@ -76,6 +77,7 @@
lemon/elevator.h \
lemon/error.h \
lemon/euler.h \
+ lemon/fib_heap.h \
lemon/full_graph.h \
lemon/glpk.h \
lemon/gomory_hu.h \
@@ -99,6 +101,7 @@
lemon/network_simplex.h \
lemon/path.h \
lemon/preflow.h \
+ lemon/radix_heap.h \
lemon/radix_sort.h \
lemon/random.h \
lemon/smart_graph.h \
diff --git a/lemon/bucket_heap.h b/lemon/bucket_heap.h
new file mode 100644
--- /dev/null
+++ b/lemon/bucket_heap.h
@@ -0,0 +1,831 @@
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
+ *
+ * This file is a part of LEMON, a generic C++ optimization library.
+ *
+ * Copyright (C) 2003-2009
+ * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
+ * (Egervary Research Group on Combinatorial Optimization, EGRES).
+ *
+ * Permission to use, modify and distribute this software is granted
+ * provided that this copyright notice appears in all copies. For
+ * precise terms see the accompanying LICENSE file.
+ *
+ * This software is provided "AS IS" with no warranty of any kind,
+ * express or implied, and with no claim as to its suitability for any
+ * purpose.
+ *
+ */
+
+#ifndef LEMON_BUCKET_HEAP_H
+#define LEMON_BUCKET_HEAP_H
+
+///\ingroup auxdat
+///\file
+///\brief Bucket Heap implementation.
+
+#include <vector>
+#include <utility>
+#include <functional>
+
+namespace lemon {
+
+ /// \ingroup auxdat
+ ///
+ /// \brief A Bucket Heap implementation.
+ ///
+ /// This class implements the \e bucket \e heap data structure. A \e heap
+ /// is a data structure for storing items with specified values called \e
+ /// priorities in such a way that finding the item with minimum priority is
+ /// efficient. The bucket heap is very simple implementation, it can store
+ /// only integer priorities and it stores for each priority in the
+ /// \f$ [0..C) \f$ range a list of items. So it should be used only when
+ /// the priorities are small. It is not intended to use as dijkstra heap.
+ ///
+ /// \param _ItemIntMap A read and writable Item int map, used internally
+ /// to handle the cross references.
+ /// \param minimize If the given parameter is true then the heap gives back
+ /// the lowest priority.
+ template <typename _ItemIntMap, bool minimize = true >
+ class BucketHeap {
+
+ public:
+ /// \e
+ typedef typename _ItemIntMap::Key Item;
+ /// \e
+ typedef int Prio;
+ /// \e
+ typedef std::pair<Item, Prio> Pair;
+ /// \e
+ typedef _ItemIntMap ItemIntMap;
+
+ /// \brief Type to represent the items states.
+ ///
+ /// Each Item element have a state associated to it. It may be "in heap",
+ /// "pre heap" or "post heap". The latter two are indifferent from the
+ /// heap's point of view, but may be useful to the user.
+ ///
+ /// The ItemIntMap \e should be initialized in such way that it maps
+ /// PRE_HEAP (-1) to any element to be put in the heap...
+ enum State {
+ IN_HEAP = 0,
+ PRE_HEAP = -1,
+ POST_HEAP = -2
+ };
+
+ public:
+ /// \brief The constructor.
+ ///
+ /// The constructor.
+ /// \param _index should be given to the constructor, since it is used
+ /// internally to handle the cross references. The value of the map
+ /// should be PRE_HEAP (-1) for each element.
+ explicit BucketHeap(ItemIntMap &_index) : index(_index), minimal(0) {}
+
+ /// The number of items stored in the heap.
+ ///
+ /// \brief Returns the number of items stored in the heap.
+ int size() const { return data.size(); }
+
+ /// \brief Checks if the heap stores no items.
+ ///
+ /// Returns \c true if and only if the heap stores no items.
+ bool empty() const { return data.empty(); }
+
+ /// \brief Make empty this heap.
+ ///
+ /// Make empty this heap. It does not change the cross reference
+ /// map. If you want to reuse a heap what is not surely empty you
+ /// should first clear the heap and after that you should set the
+ /// cross reference map for each item to \c PRE_HEAP.
+ void clear() {
+ data.clear(); first.clear(); minimal = 0;
+ }
+
+ private:
+
+ void relocate_last(int idx) {
+ if (idx + 1 < int(data.size())) {
+ data[idx] = data.back();
+ if (data[idx].prev != -1) {
+ data[data[idx].prev].next = idx;
+ } else {
+ first[data[idx].value] = idx;
+ }
+ if (data[idx].next != -1) {
+ data[data[idx].next].prev = idx;
+ }
+ index[data[idx].item] = idx;
+ }
+ data.pop_back();
+ }
+
+ void unlace(int idx) {
+ if (data[idx].prev != -1) {
+ data[data[idx].prev].next = data[idx].next;
+ } else {
+ first[data[idx].value] = data[idx].next;
+ }
+ if (data[idx].next != -1) {
+ data[data[idx].next].prev = data[idx].prev;
+ }
+ }
+
+ void lace(int idx) {
+ if (int(first.size()) <= data[idx].value) {
+ first.resize(data[idx].value + 1, -1);
+ }
+ data[idx].next = first[data[idx].value];
+ if (data[idx].next != -1) {
+ data[data[idx].next].prev = idx;
+ }
+ first[data[idx].value] = idx;
+ data[idx].prev = -1;
+ }
+
+ public:
+ /// \brief Insert a pair of item and priority into the heap.
+ ///
+ /// Adds \c p.first to the heap with priority \c p.second.
+ /// \param p The pair to insert.
+ void push(const Pair& p) {
+ push(p.first, p.second);
+ }
+
+ /// \brief Insert an item into the heap with the given priority.
+ ///
+ /// Adds \c i to the heap with priority \c p.
+ /// \param i The item to insert.
+ /// \param p The priority of the item.
+ void push(const Item &i, const Prio &p) {
+ int idx = data.size();
+ index[i] = idx;
+ data.push_back(BucketItem(i, p));
+ lace(idx);
+ if (p < minimal) {
+ minimal = p;
+ }
+ }
+
+ /// \brief Returns the item with minimum priority.
+ ///
+ /// This method returns the item with minimum priority.
+ /// \pre The heap must be nonempty.
+ Item top() const {
+ while (first[minimal] == -1) {
+ ++minimal;
+ }
+ return data[first[minimal]].item;
+ }
+
+ /// \brief Returns the minimum priority.
+ ///
+ /// It returns the minimum priority.
+ /// \pre The heap must be nonempty.
+ Prio prio() const {
+ while (first[minimal] == -1) {
+ ++minimal;
+ }
+ return minimal;
+ }
+
+ /// \brief Deletes the item with minimum priority.
+ ///
+ /// This method deletes the item with minimum priority from the heap.
+ /// \pre The heap must be non-empty.
+ void pop() {
+ while (first[minimal] == -1) {
+ ++minimal;
+ }
+ int idx = first[minimal];
+ index[data[idx].item] = -2;
+ unlace(idx);
+ relocate_last(idx);
+ }
+
+ /// \brief Deletes \c i from the heap.
+ ///
+ /// This method deletes item \c i from the heap, if \c i was
+ /// already stored in the heap.
+ /// \param i The item to erase.
+ void erase(const Item &i) {
+ int idx = index[i];
+ index[data[idx].item] = -2;
+ unlace(idx);
+ relocate_last(idx);
+ }
+
+
+ /// \brief Returns the priority of \c i.
+ ///
+ /// This function returns the priority of item \c i.
+ /// \pre \c i must be in the heap.
+ /// \param i The item.
+ Prio operator[](const Item &i) const {
+ int idx = index[i];
+ return data[idx].value;
+ }
+
+ /// \brief \c i gets to the heap with priority \c p independently
+ /// if \c i was already there.
+ ///
+ /// This method calls \ref push(\c i, \c p) if \c i is not stored
+ /// in the heap and sets the priority of \c i to \c p otherwise.
+ /// \param i The item.
+ /// \param p The priority.
+ void set(const Item &i, const Prio &p) {
+ int idx = index[i];
+ if (idx < 0) {
+ push(i,p);
+ } else if (p > data[idx].value) {
+ increase(i, p);
+ } else {
+ decrease(i, p);
+ }
+ }
+
+ /// \brief Decreases the priority of \c i to \c p.
+ ///
+ /// This method decreases the priority of item \c i to \c p.
+ /// \pre \c i must be stored in the heap with priority at least \c
+ /// p relative to \c Compare.
+ /// \param i The item.
+ /// \param p The priority.
+ void decrease(const Item &i, const Prio &p) {
+ int idx = index[i];
+ unlace(idx);
+ data[idx].value = p;
+ if (p < minimal) {
+ minimal = p;
+ }
+ lace(idx);
+ }
+
+ /// \brief Increases the priority of \c i to \c p.
+ ///
+ /// This method sets the priority of item \c i to \c p.
+ /// \pre \c i must be stored in the heap with priority at most \c
+ /// p relative to \c Compare.
+ /// \param i The item.
More information about the Lemon-commits
mailing list