RubyGems Navigation menu

PriorityQueue 0.1.0

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.

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)

Authors:

  • Brian Schroeder

Owners:

50f981ff37f4abfc1d3a420aae4f6513

Sha 256 checksum:

ebaae32ce48836e91e549bbbf73dd41b93bbeb1d122ad4f04cd1c40032b77c77

Total downloads 97,854

For this version 1,402

Required Ruby Version: None

Licenses:

N/A

Gemfile:
= Copy to clipboard Copied!

install:
= Copy to clipboard Copied!

Links: