RubyGems Navigation menu

lazy_priority_queue 0.1.1

A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.

Versions:

  1. 0.1.1 - April 06, 2016 (5.5 KB)
  2. 0.1.0 - January 12, 2016 (5.5 KB)
  3. 0.0.0 - January 11, 2016 (5.5 KB)

Development Dependencies (2):

Owners:

Authors:

  • Matías Battocchia

SHA 256 checksum:

e5d4ea8d037e8743afc91019fc23f5f6858372fea73e05e8244f8964f0634337

Total downloads 529,482

For this version 527,330

Gemfile:
= Copy to clipboard Copied!

install:
=

License:

FreeBSD

Required Ruby Version: >= 0

Links: