This is a fibonacci-heap priority-queue implementation. That means insert: O(1) decrease_priority: Amortized O(1) delete_min: Amortized O(log n) 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.
Required Ruby Version
> 0.0.0
Authors
Brian Schroeder
Versions
-
0.1.2
-
source
- 0.1.2 source October 29, 2005This gem version was imported to RubyGems.org on July 25, 2009. The date displayed was specified by the author in the gemspec. (58 KB)
-
-
0.1.1
-
source
- 0.1.1 source October 25, 2005This gem version was imported to RubyGems.org on July 25, 2009. The date displayed was specified by the author in the gemspec. (42 KB)
-
-
0.1.0
-
source
- 0.1.0 source October 25, 2005This gem version was imported to RubyGems.org on July 25, 2009. The date displayed was specified by the author in the gemspec. (60 KB)
-