C++ Min Heap where you can change the priority of the node and it reorders itself in the heap. I couldn't find a STL equivalent for use in my Dijkstra's algorithm.
Features
- log(n) priority change
- Used it in my Dijkstra's algorithm
License
GNU General Public License version 3.0 (GPLv3)Follow Mutable Min Heap
Other Useful Business Software
Our Free Plans just got better! | Auth0
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Mutable Min Heap!