[{"authors":"Brian Schroeder","built_at":"2005-10-29T22:00:00.000Z","created_at":"2009-07-25T18:36:59.000Z","description":"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.","downloads_count":324221,"metadata":{"homepage_uri":"http://ruby.brian-schroeder.de/priority_queue"},"number":"0.1.2","summary":"This is a fibonacci-heap priority-queue implementation","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"licenses":null,"requirements":null,"sha":"3f69849f5db09516fe117b3f98f583ca6fa064f231f83c9ea58a791945dda8f1","spec_sha":"6a9524a8b5edb224031c336d78df14008e3142b05b7daf05675efd982f34505a"},{"authors":"Brian Schroeder","built_at":"2005-10-25T22:00:00.000Z","created_at":"2009-07-25T18:36:59.000Z","description":"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.","downloads_count":4316,"metadata":{"homepage_uri":"http://ruby.brian-schroeder.de/priority_queue"},"number":"0.1.1","summary":"This is a fibonacci-heap priority-queue implementation","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"licenses":null,"requirements":null,"sha":"b06c3753278620e16c25ef508f5b14a4dda5fbf9ea5a703425313325283b28b1","spec_sha":"da1c33a53642b33e65cff3312757934c171db5c14bb2fcd3b6de6b43e0a45a28"},{"authors":"Brian Schroeder","built_at":"2005-10-25T22:00:00.000Z","created_at":"2009-07-25T18:36:59.000Z","description":"This is a fibonacy 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.","downloads_count":4175,"metadata":{"homepage_uri":"http://ruby.brian-schroeder.de/priority_queue"},"number":"0.1.0","summary":"This is a fibonacy heap priority queue implementation","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"licenses":null,"requirements":null,"sha":"ebaae32ce48836e91e549bbbf73dd41b93bbeb1d122ad4f04cd1c40032b77c77","spec_sha":"75034cf63f1395e5f2a3f8602c08f1392ac2830aa7e20566b4760ed22892e2c2"}]