# -*- encoding: utf-8 -*-
# stub: gratr19 0.4.4 ruby lib

Gem::Specification.new do |s|
  s.name = "gratr19".freeze
  s.version = "0.4.4".freeze

  s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
  s.require_paths = ["lib".freeze]
  s.authors = ["Shawn Garbett".freeze, "Ankur Sethi".freeze]
  s.date = "2012-03-28"
  s.description = "GRATR is a framework for graph data structures and algorithms.\n\nThis library is a fork of RGL. This version utilizes\nRuby blocks and duck typing to greatly simplfy the code. It also supports\nexport to DOT format for display as graphics.\n\nGRATR currently contains a core set of algorithm patterns:\n\n * Breadth First Search \n * Depth First Search \n * A* Search\n * Floyd-Warshall\n * Best First Search\n * Djikstra's Algorithm\n * Lexicographic Search\n\nThe algorithm patterns by themselves do not compute any meaningful quantities\nover graphs, they are merely building blocks for constructing graph\nalgorithms. The graph algorithms in GRATR currently include:\n\n * Topological Sort \n * Strongly Connected Components \n * Transitive Closure\n * Rural Chinese Postman\n * Biconnected\n".freeze
  s.email = ["shawn@garbett.org".freeze, "ankursethi108@gmail.com".freeze]
  s.extra_rdoc_files = ["README".freeze]
  s.files = ["README".freeze, "examples/graph_self.rb".freeze, "examples/module_graph.jpg".freeze, "examples/module_graph.rb".freeze, "examples/self_graph.jpg".freeze, "examples/visualize.jpg".freeze, "examples/visualize.rb".freeze, "install.rb".freeze, "lib/gratr.rb".freeze, "lib/gratr/adjacency_graph.rb".freeze, "lib/gratr/base.rb".freeze, "lib/gratr/biconnected.rb".freeze, "lib/gratr/chinese_postman.rb".freeze, "lib/gratr/common.rb".freeze, "lib/gratr/comparability.rb".freeze, "lib/gratr/digraph.rb".freeze, "lib/gratr/digraph_distance.rb".freeze, "lib/gratr/dot.rb".freeze, "lib/gratr/edge.rb".freeze, "lib/gratr/graph.rb".freeze, "lib/gratr/graph_api.rb".freeze, "lib/gratr/import.rb".freeze, "lib/gratr/labels.rb".freeze, "lib/gratr/maximum_flow.rb".freeze, "lib/gratr/rdot.rb".freeze, "lib/gratr/search.rb".freeze, "lib/gratr/strong_components.rb".freeze, "lib/gratr/undirected_graph.rb".freeze, "lib/gratr/version.rb".freeze, "lib/priority-queue/benchmark/dijkstra.rb".freeze, "lib/priority-queue/compare_comments.rb".freeze, "lib/priority-queue/ext/priority_queue/CPriorityQueue/extconf.rb".freeze, "lib/priority-queue/lib/priority_queue.rb".freeze, "lib/priority-queue/lib/priority_queue/c_priority_queue.rb".freeze, "lib/priority-queue/lib/priority_queue/poor_priority_queue.rb".freeze, "lib/priority-queue/lib/priority_queue/ruby_priority_queue.rb".freeze, "lib/priority-queue/setup.rb".freeze, "lib/priority-queue/test/priority_queue_test.rb".freeze, "tests/TestBiconnected.rb".freeze, "tests/TestChinesePostman.rb".freeze, "tests/TestComplement.rb".freeze, "tests/TestDigraph.rb".freeze, "tests/TestDigraphDistance.rb".freeze, "tests/TestDot.rb".freeze, "tests/TestEdge.rb".freeze, "tests/TestInspection.rb".freeze, "tests/TestMultiEdge.rb".freeze, "tests/TestNeighborhood.rb".freeze, "tests/TestProperties.rb".freeze, "tests/TestSearch.rb".freeze, "tests/TestStrongComponents.rb".freeze, "tests/TestTriagulated.rb".freeze, "tests/TestUndirectedGraph.rb".freeze]
  s.homepage = "https://github.com/amalagaura/gratr".freeze
  s.rdoc_options = ["--title".freeze, "GRATR - Ruby Graph Library".freeze, "--main".freeze, "README".freeze, "--line-numbers".freeze]
  s.rubygems_version = "3.5.10".freeze
  s.summary = "Graph Theory Ruby library".freeze
end