blob: ad9e85b124ee9e575cb6cb91bd9fac5cd17c5d93 (
plain)
1
2
3
4
5
|
This is a fibonacci-heap priority-queue implementation. This project
is different from K. Kodamas PQueue in that it allows a decrease key
operation. That makes PriorityQueue usable for algorithms like
dijkstras shortest path algorithm, while PQueue is more suitable for
Heapsort and the like.
|
