# -*- encoding: utf-8 -*-
# stub: dijkstra_fast 1.5.3 ruby lib
# stub: ext/dijkstra_fast/extconf.rb

Gem::Specification.new do |s|
  s.name = "dijkstra_fast".freeze
  s.version = "1.5.3".freeze

  s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
  s.metadata = { "rubygems_mfa_required" => "true" } if s.respond_to? :metadata=
  s.require_paths = ["lib".freeze]
  s.authors = ["David McCullars".freeze]
  s.bindir = "exe".freeze
  s.date = "2022-01-04"
  s.description = "Native implementation of Dijkstra algorithm for finding the shortest path\nbetween two vertices in a large, sparse graphs. Underlying algorithm is\nimplemented in C using a priority queue.  Edges are represented using linked\nlists rather than an adjacency matrix to reduce memory footprint when operating\non very large graphs where the average number of edges between nodes is\nrelatively small (e.g. < 1/10 the number of nodes). See\nhttps://en.wikipedia.org/wiki/Dijkstra's_algorithm for additional information.\n".freeze
  s.email = ["david.mccullars@gmail.com".freeze]
  s.extensions = ["ext/dijkstra_fast/extconf.rb".freeze]
  s.files = [".codeclimate.yml".freeze, ".github/workflows/ci.yml".freeze, ".gitignore".freeze, ".rspec".freeze, ".rubocop.yml".freeze, ".ruby-version".freeze, ".yardopts".freeze, "CODE_OF_CONDUCT.md".freeze, "Gemfile".freeze, "LICENSE".freeze, "README.md".freeze, "Rakefile".freeze, "dijkstra_fast.gemspec".freeze, "ext/dijkstra_fast/dijkstra_fast.c".freeze, "ext/dijkstra_fast/errors.c".freeze, "ext/dijkstra_fast/errors.h".freeze, "ext/dijkstra_fast/expand_capacity.h".freeze, "ext/dijkstra_fast/extconf.rb".freeze, "ext/dijkstra_fast/native.c".freeze, "ext/dijkstra_fast/native.h".freeze, "ext/dijkstra_fast/native_shortest_path.c".freeze, "ext/dijkstra_fast/priority_queue.c".freeze, "ext/dijkstra_fast/priority_queue.h".freeze, "lib/dijkstra_fast.rb".freeze, "lib/dijkstra_fast/graph.rb".freeze, "lib/dijkstra_fast/native.rb".freeze, "lib/dijkstra_fast/no_path_exists_error.rb".freeze, "lib/dijkstra_fast/shortest_path.rb".freeze, "lib/dijkstra_fast/version.rb".freeze]
  s.homepage = "https://github.com/david-mccullars/dijkstra_fast".freeze
  s.licenses = ["MIT".freeze]
  s.required_ruby_version = Gem::Requirement.new(">= 3.0.0".freeze)
  s.rubygems_version = "3.5.10".freeze
  s.summary = "(Native) implementation of Dijkstra algorithm for large, sparse graphs".freeze

  s.specification_version = 4

  s.add_development_dependency(%q<bundler>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<github-markup>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<rake>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<rake-compiler>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<redcarpet>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<rspec>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<rubocop>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<rubocop-rake>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<rubocop-rspec>.freeze, [">= 0".freeze])
  s.add_development_dependency(%q<simplecov>.freeze, ["~> 0.17.0".freeze])
  s.add_development_dependency(%q<yard>.freeze, [">= 0".freeze])
end