Mutable Priority Queue Container
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/1395
When dealing with functional minimization, or maximization, it can sometimes be solved by a greedy algorithm. To implement greedy algorithm one needs priority queue container, i.e. get for a very low cost the lowest or highest element present in a sorted container. Whenever the priority of one element present in the queue needs to be modified, standard implementations, like code{std::priority_queue}, can not be applied directly. VTK has is own implementation code{vtkPriorityQueue} which is not templated and can only be applied for code{vtkIdType} and for the minimizing the functional. We propose here an implementation of a mutable priority queue container where element, priority, and objective (minimization or maximization) are given by template arguments. Our implementation allows to minimize or maximize a given functional, and any element can be modified, deleted at any time, and with a low cost.
Data
minus 2 Files (150Kb)
Code
minus Automatic Testing Results by Insight-Journal Dashboard on Sat Oct 25 23:19:40 2008 for revision #5
starstarstarstarstar expertise: 5 sensitivity: 5
yellow This project passed all of its tests.
Click here for more details.

Go here to access the main testing dashboard.
plus Automatic Testing Results by Insight-Journal Dashboard on Mon Jun 30 13:54:06 2008 for revision #4
starstarstarstarstar expertise: 5 sensitivity: 5
plus Automatic Testing Results by Insight-Journal Dashboard on Mon Jun 30 13:41:20 2008 for revision #3
starstarstarstarstar expertise: 5 sensitivity: 5
plus Automatic Testing Results by Insight-Journal Dashboard on Mon Jun 30 13:38:18 2008 for revision #2
starstarstarstarstar expertise: 5 sensitivity: 5
plus Automatic Testing Results by Insight-Journal Dashboard on Sun Jun 29 21:08:54 2008 for revision #1
starstarstarstarstar expertise: 5 sensitivity: 5

Reviews
There is no review at this time. Be the first to review this publication!

Quick Comments


Resources
backyellow
Download All
Github

Statistics more
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating: starstarstarstarstar
Paper Quality: plus minus

Information more
backyellow
Categories: Code speed optimization, Generic Programming
Keywords: priority queue, mutable
Toolkits: ITK (moved into the toolkit), CMake
Export citation:

Share
backyellow
Share

Linked Publications more
backyellow
A Tutorial on Combining Nonlinear Optimization with CUDA A Tutorial on Combining Nonlinear Optimization with CUDA
by Hatt C.
Higher Order Accurate Derivative and Gradient Calculation in ITK Higher Order Accurate Derivative and Gradient Calculation in ITK
by McCormick M.

View license
Loading license...

Send a message to the author
main_flat
Powered by Midas