Simon Dirmeier

Hey, the latest [release](https://github.com/dirmeier/datastructures/releases/tag/v0.2.2) adds a decrease-key method. If you have a look at the vignette, you can see how the method is used. Let me know if this works...

Hey, in the [amortized complexity table](http://www.boost.org/doc/libs/1_66_0/doc/html/heap/data_structures.html#heap.data_structures.data_structure_configuration) you can see the data structures that `boost::heap` implements and their respective runtimes. For the `heap` namespace such a data structure does not exist....

So, from a quick look into the [stl](http://www.cplusplus.com/reference/stl/) and [Boost](http://www.boost.org/doc/libs/1_66_0/?view=category_data) data structures I couldn't find something that would suit you. However, my plan in the beginning was anyway to implement...

Hey, yeah that works. If you call `handle` you also get the value of the node. So you'd look at the value and take the handle to decrease the key,...

Sure, good idea, I'll add this. Thanks for the feedback.

Hey, I've added this feature preliminarily with [v0.2.3](https://github.com/dirmeier/datastructures/releases/tag/v0.2.3). I'll further optimize/modularize the code on the weekend, currently I am rather busy... Hope that works. From the vignette: ```r h

Ill submit this to CRAN once I've added some more methods for all the classes. Shouldn't take too long though..

Usually, this is not a function common for Fibonacci heaps, because it somewhat hurts the purpose of a priority queue, but if helps, I'll add it. Thanks for all the...

Hey, this shouldn't be an issue. I think if we choose a compiler version that supports C++14 for travis, it will be fine. If travis does not have, returning to...

Hey, this [tag](https://github.com/dirmeier/datastructures/releases/tag/v0.2.5) added getting all `values` from a fibonacci heap. Furthermore, in order to make the package suitable to randy3k's question https://github.com/dirmeier/datastructures/issues/5 I needed to modify the `handle` method...