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.

Versions:

  1. 0.1.2 - July 25, 2009 (58 KB)
  2. 0.1.1 - July 25, 2009 (42 KB)
  3. 0.1.0 - July 25, 2009 (60 KB)

Authors:

  • Brian Schroeder

Owners:

SHA 256 checksum:

3f69849f5db09516fe117b3f98f583ca6fa064f231f83c9ea58a791945dda8f1

Total downloads 247,067

For this version 242,662

Gemfile:
= Copy to clipboard Copied!

install:
=

Licenses:

N/A

Required Ruby Version: None

Links: