shortest-path 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4176937cca1a506176ab30d3b0657ae6634d0852
-  data.tar.gz: 086449d097a560ec5f436fdf295105c68827029c
+  metadata.gz: 55f2e617f1bb69175440dd880744b84a5b0ed480
+  data.tar.gz: 575c55362f1987c38b1984457eab7c5314785f25
 SHA512:
-  metadata.gz: 1e354fcf51cb029e4803ac1815aefd7eb0cdfb0a45f32fbb6dd47e39a4b95843500522de771568aa20c4b3bf8853bce59fccc5f2ed2ee158e73028dff66c94f2
-  data.tar.gz: 04db5931140667647adffe7ddf2ab49419657b468379ea4830f0b76234996e3f13f153efac6c3381fb66ec207163085f8b8e160b547f9732509c74f9b9a8e8e7
+  metadata.gz: 2a6870f838329f9890c6094e1bf26457bb42312f01a093b02c5ab450c64093dd7f5b20ee6c5824085ab30005624a053a6d143dd0a3257356e9dc41e97b8f8b41
+  data.tar.gz: e7933a68e0c285de39138690130658171fb9bf230a4261bbaa4f6e87c5836132fe18eb92b92756af07f2ce21b6d5e8d176e3392b44b5033608709a9a0f5e825c

data/.rspec

@@ -0,0 +1 @@
+--colour

data/lib/shortest/path.rb

@@ -1,7 +1,4 @@
 require "shortest/path/version"
-
-module Shortest
-  module Path
-    # Your code goes here...
-  end
-end
+require "shortest/path/general"
+require "shortest/path/priority_queue"
+require "shortest/path/astar"

data/lib/shortest/path/astar.rb

@@ -0,0 +1,60 @@
+module Shortest
+  module Path
+    class AStar
+      def initialize(dist,heur,graph,start,goal)
+        @dist=dist ; @heur=heur ; @graph=graph
+        @start=start ; @goal=goal
+      end
+
+      def search
+        closedset=[] ; openset=Shortest::Path::PriorityQueue.new ; came_from={}
+        start_g_score=0 ; start_f_score=start_g_score+@heur.call(@start,@goal)
+        g_score={@start => start_g_score} ; f_score={@start => start_f_score}
+        openset.add_with_priority(@start, start_f_score)
+        until openset.empty?
+          current=openset.pop
+          return reconstruct_path(came_from,@goal) if current==@goal
+          closedset<<current
+          @graph.neighbors(current).each do |neighbor|
+            next if closedset.include?(neighbor)
+            tentative_g_score=g_score[current]+@dist.call(current,neighbor)
+            if (not openset.include?(neighbor)) or (tentative_g_score < (g_score[neighbor]||Float::INFINITY))
+              came_from[neighbor]=current
+              g_score[neighbor]=tentative_g_score
+              f_score[neighbor]=tentative_g_score+@heur.call(neighbor,@goal)
+              if not openset.include?(neighbor)
+                openset.add_with_priority(neighbor, f_score[neighbor])
+              else
+                openset.change_priority(neighbor, f_score[neighbor])
+              end
+            end
+          end
+        end
+        return [] # failure!
+      end
+
+      private
+
+      def reconstruct_path(came_from, current_node)
+        if came_from.include?(current_node)
+          p = reconstruct_path(came_from, came_from[current_node])
+          p << current_node
+          p
+        else
+          [current_node]
+        end
+      end
+    end
+
+    # `dist` function which calculates distance between two points
+    # `heur` heuristic function
+    # `graph` graph structure
+    # `start` start node
+    # `goal` goal node
+    def astar(dist,heur,graph,start,goal)
+      Shortest::Path::AStar.new(dist,heur,graph,start,goal).search
+    end
+
+    module_function :astar
+  end
+end

data/lib/shortest/path/general.rb

@@ -0,0 +1,38 @@
+module Shortest
+  module Path
+    class Edge
+      attr_accessor :src, :dst, :length
+
+      def initialize(src, dst, length)
+        @src=src
+        @dst=dst
+        @length=length
+      end
+    end
+
+    class Graph < Array
+      attr_reader :edges
+
+      def initialize
+        @edges=[]
+      end
+
+      def connect(src, dst, length)
+        raise "No such vertex: #{src}" unless self.include?(src)
+        raise "No such vertex: #{dst}" unless self.include?(dst)
+        @edges.push Edge.new(src, dst, length)
+      end
+
+      def connect_mutually(vertex1, vertex2, length)
+        self.connect(vertex1, vertex2, length)
+        self.connect(vertex2, vertex1, length)
+      end
+
+      def neighbors(vertex)
+        neighbors = []
+        @edges.each{|edge| neighbors.push edge.dst if edge.src==vertex }
+        neighbors.uniq
+      end
+    end
+  end
+end

data/lib/shortest/path/priority_queue.rb

@@ -0,0 +1,33 @@
+module Shortest
+  module Path
+    class PriorityQueueItem
+      attr_reader :item, :priority
+
+      def initialize(item,priority)
+        @item = item ; @priority = priority
+      end
+    end
+
+    class PriorityQueue
+      def initialize; @heap = [] end
+
+      def add_with_priority(object, priority)
+        item = PriorityQueueItem.new(object,priority)
+        @heap << item
+        sort_by_priority
+      end
+
+      def change_priority(object, priority)
+        @heap.select{|x| x.item==object}.first.priority=priority
+        sort_by_priority
+      end
+
+      def pop; @heap.delete_at(0).item end
+      def empty?; @heap.empty? end
+      def include?(object); @heap.select{|x| x.item==object}.any? end
+
+      private
+      def sort_by_priority; @heap.sort!{ |x,y| x.priority <=> y.priority } end
+    end
+  end
+end

data/lib/shortest/path/version.rb

@@ -1,5 +1,5 @@
 module Shortest
   module Path
-    VERSION = "0.0.1"
+    VERSION = "0.0.2"
   end
 end

data/shortest-path.gemspec

@@ -19,5 +19,6 @@ Gem::Specification.new do |spec|
   spec.require_paths = ["lib"]
 
   spec.add_development_dependency "bundler", "~> 1.6"
-  spec.add_development_dependency "rake"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "debugger"
 end

data/spec/astar_spec.rb

@@ -0,0 +1,41 @@
+require 'spec_helper'
+
+class Point
+  attr_reader :x, :y
+
+  def initialize(x,y)
+    @x=x ; @y=y
+  end
+end
+
+def build_graph(n)
+  graph=Shortest::Path::Graph.new
+  (0..n-1).each do |x|
+    (0..n-1).each do |y|
+      graph.push Point.new(x,y)
+    end
+  end
+  (0..n*n-1).each do |i|
+    graph.connect_mutually(graph[i], graph[i+1], 1) unless (i+1)%n == 0
+    graph.connect_mutually(graph[i], graph[i+n], 1) unless i+1 > n*(n-1)
+  end
+  graph
+end
+
+describe 'AStar' do
+  before(:all) do
+    @graph=build_graph(3)
+    @p1=@graph[0] ; @p2=@graph[8]
+    dist = heur = ->(p1,p2){ dx=p1.x-p2.x ; dy=p1.y-p2.y ; Math.sqrt(dx*dx + dy*dy) }
+    @shortest=Shortest::Path.astar(dist, heur, @graph, @p1, @p2)
+  end
+
+  specify{ expect(@graph.size).to eq(9) }
+  specify{ expect(@graph.edges.size).to eq(24) }
+  specify{ expect(@shortest.size).to eq(5) }
+  specify{ expect(@shortest[0]).to eq(@graph[0]) }
+  specify{ expect(@shortest[1]).to eq(@graph[1]) }
+  specify{ expect(@shortest[2]).to eq(@graph[4]) }
+  specify{ expect(@shortest[3]).to eq(@graph[5]) }
+  specify{ expect(@shortest[4]).to eq(@graph[8]) }
+end

data/spec/general_spec.rb

@@ -0,0 +1,23 @@
+require 'spec_helper'
+
+describe 'Graph' do
+  before(:all) do
+    @graph=Shortest::Path::Graph.new
+    (1..4).each{|x| @graph.push x}
+    expect(@graph.size).to eq(4)
+    @graph.connect_mutually 1, 2, 10
+    @graph.connect_mutually 1, 3, 10
+    @graph.connect_mutually 1, 4, 10
+    @graph.connect_mutually 2, 4, 10
+
+    @first_edge=@graph.edges.first
+  end
+
+  specify{ expect(@graph.neighbors(1).size).to eq(3) }
+  specify{ expect(@graph.neighbors(2).size).to eq(2) }
+  specify{ expect(@graph.neighbors(3).size).to eq(1) }
+  specify{ expect(@graph.neighbors(4).size).to eq(2) }
+
+  specify{ expect(@first_edge.src).to eq(1) }
+  specify{ expect(@first_edge.dst).to eq(2) }
+end

data/spec/priority_queue_spec.rb

@@ -0,0 +1,20 @@
+require 'spec_helper'
+
+describe 'PriorityQueue' do
+  before(:all) do
+    @queue=Shortest::Path::PriorityQueue.new
+    @queue.add_with_priority("A",1)
+    @queue.add_with_priority("D",4)
+    @queue.add_with_priority("C",3)
+    @queue.add_with_priority("B",2)
+  end
+
+  specify{ expect(@queue).not_to be_empty }
+  specify{ expect(@queue.include?("A")).to eq(true) }
+  specify{ expect(@queue.pop).to eq("A") }
+  specify{ expect(@queue.pop).to eq("B") }
+  specify{ expect(@queue.pop).to eq("C") }
+  specify{ expect(@queue.pop).to eq("D") }
+  specify{ expect(@queue).to be_empty }
+  specify{ expect(@queue.include?("A")).to eq(false) }
+end

data/spec/spec_helper.rb

@@ -0,0 +1,3 @@
+require 'rspec'
+require 'debugger'
+require 'shortest/path'

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: shortest-path
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Dimitri Kurashvili
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-06-19 00:00:00.000000000 Z
+date: 2014-07-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -25,7 +25,21 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '1.6'
 - !ruby/object:Gem::Dependency
-  name: rake
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: debugger
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - '>='
@@ -46,13 +60,21 @@ extensions: []
 extra_rdoc_files: []
 files:
 - .gitignore
+- .rspec
 - Gemfile
 - LICENSE.txt
 - README.md
 - Rakefile
 - lib/shortest/path.rb
+- lib/shortest/path/astar.rb
+- lib/shortest/path/general.rb
+- lib/shortest/path/priority_queue.rb
 - lib/shortest/path/version.rb
 - shortest-path.gemspec
+- spec/astar_spec.rb
+- spec/general_spec.rb
+- spec/priority_queue_spec.rb
+- spec/spec_helper.rb
 homepage: http://github.com/georgian-se/shortest-path
 licenses:
 - MIT
@@ -77,4 +99,8 @@ rubygems_version: 2.3.0
 signing_key: 
 specification_version: 4
 summary: finding shortest path
-test_files: []
+test_files:
+- spec/astar_spec.rb
+- spec/general_spec.rb
+- spec/priority_queue_spec.rb
+- spec/spec_helper.rb