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:
=

installieren:
=

Versionen:

  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)

Besitzer:

Autoren:

  • Brian Schroeder

SHA 256-Prüfsumme:

=

Downloads insgesamt 295.172

Für diese Version 287.987

Version veröffentlicht:

Lizenzen:

k.A.

Erforderliche Ruby-Version: > 0.0.0

Links: