Efficient implementation of prioritized sweeping requires a mutable heap (e.g. Fibonacci heap)

Open beniz opened this issue 11 years ago • 1 comments

A priority queue based Fibonacci heap appears to be the best solution as at least one direction of the mutation of the priority (increase or decrease depending on implementation) is O(1) while the other is O(log N), see http://www.boost.org/doc/libs/1_52_0/doc/html/heap/data_structures.html

Mar 19 '14 17:03 beniz

http://stackoverflow.com/questions/17823495/how-do-i-get-elements-from-boostfibonacci-heap-by-handle

Mar 20 '14 07:03 beniz