# -*- encoding: utf-8 -*-
# stub: lazy_priority_queue 0.1.1 ruby lib

Gem::Specification.new do |s|
  s.name = "lazy_priority_queue".freeze
  s.version = "0.1.1".freeze

  s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
  s.require_paths = ["lib".freeze]
  s.authors = ["Mat\u00EDas Battocchia".freeze]
  s.date = "2016-04-06"
  s.description = "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.".freeze
  s.email = "matias@riseup.net".freeze
  s.homepage = "https://github.com/matiasbattocchia/lazy_priority_queue".freeze
  s.licenses = ["FreeBSD".freeze]
  s.rubygems_version = "3.5.22".freeze
  s.summary = "A priority queue implemented using a lazy binomial heap. It allows change priority operation.".freeze

  s.installed_by_version = "3.5.22".freeze

  s.specification_version = 4

  s.add_development_dependency(%q<bundler>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<minitest>.freeze, [">= 0".freeze])
end
