RubyGems Navigation menu

PriorityQueue 0.1.2

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.

Gemfile
          gem 'PriorityQueue', '~> 0.1.2'
  
  
  
  
  
  
  

install
          gem install PriorityQueue
  
  
  
  
  
  
  

Authors:

  • Brian Schroeder

Owners:

Total downloads 91,924

For this version 89,241

Required Ruby Version: None

Links:

Versions:

  1. 0.1.2 - October 29, 2005 (58 KB)
  2. 0.1.1 - October 25, 2005 (42 KB)
  3. 0.1.0 - October 25, 2005 (60 KB)