{"name":"PriorityQueue","downloads":332287,"version":"0.1.2","version_created_at":"2009-07-25T18:36:59.000Z","version_downloads":323811,"platform":"ruby","authors":"Brian Schroeder","info":"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.","licenses":null,"metadata":{"homepage_uri":"http://ruby.brian-schroeder.de/priority_queue"},"yanked":false,"sha":"3f69849f5db09516fe117b3f98f583ca6fa064f231f83c9ea58a791945dda8f1","spec_sha":"6a9524a8b5edb224031c336d78df14008e3142b05b7daf05675efd982f34505a","project_uri":"https://rubygems.org/gems/PriorityQueue","gem_uri":"https://rubygems.org/gems/PriorityQueue-0.1.2.gem","homepage_uri":"http://ruby.brian-schroeder.de/priority_queue","wiki_uri":null,"documentation_uri":null,"mailing_list_uri":null,"source_code_uri":null,"bug_tracker_uri":null,"changelog_uri":null,"funding_uri":null,"dependencies":{"development":[],"runtime":[]}}