shortest_path 0.0.4 → 0.0.5

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    MzcwZTljMmViZTdmMDQxMWNlNWY4ODEyNGFkYTA2NDNhY2ZlZmFkYQ==
+  data.tar.gz: !binary |-
+    YzZkODI5Nzg4NzkwYmNkZGY1NWMzZTFlODFlYzUwNTI5YzczYmEzNg==
+SHA512:
+  metadata.gz: !binary |-
+    M2M5ZmE4MDFhY2ZkYjdjN2EzMmZjMmY0MTM2Nzc4OGY5YzVjYzNkODhiYjkw
+    OTcxMDEyMzYwZGI1MTIzN2Y0ZTExNWU3NTg0ODg5OWFiM2EzOWM0ZmI3Nzkw
+    NWQ0NTg4MjU2MWY0MzA3NWFkN2E4NDE0MDMyMTUyZmYzZTYyYjI=
+  data.tar.gz: !binary |-
+    ZDdiYmVmMWFkM2UyMzY1NWFlNDNjNWNlMDYwYjE5ZmZhMzVhZDg0NTI5MDFk
+    OWQ5NmEwZWY3NjE1NWVmMTIwNWQxYWFkNjk1ZDUyYWI0NjkxODAyNzgwODJk
+    ZDQwYzYwMzk3ZjlhMjMzNTFmNjlhNDczOGU4ZDgzNGVhMjkwMjM=

data/.rspec

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

data/README.md

@@ -1,5 +1,5 @@
 # Shortest Path
-[![Build Status](https://travis-ci.org/dryade/shortest_path.png)](http://travis-ci.org/dryade/shortest_path?branch=master) [![Dependency Status](https://gemnasium.com/dryade/shortest_path.png)](https://gemnasium.com/dryade/shortest_path) [![Code Climate](https://codeclimate.com/github/dryade/shortest_path.png)](https://codeclimate.com/github/dryade/shortest_path) [![Coverage Status](https://img.shields.io/coveralls/dryade/shortest_path.svg)](https://coveralls.io/r/dryade/shortest_path)
+[![Build Status](https://travis-ci.org/cityway-transdev/shortest_path.svg?branch=master)](http://travis-ci.org/cityway-transdev/shortest_path) [![Dependency Status](https://gemnasium.com/cityway-transdev/shortest_path.png)](https://gemnasium.com/cityway-transdev/shortest_path) [![Code Climate](https://codeclimate.com/github/cityway-transdev/shortest_path.png)](https://codeclimate.com/github/cityway-transdev/shortest_path) [![Coverage Status](https://img.shields.io/coveralls/cityway-transdev/shortest_path.svg)](https://coveralls.io/r/cityway-transdev/shortest_path)
 
 A* ruby implementation to find shortest path and map in a graph with :
  - a timeout to stop research when duration > timeout

data/lib/shortest_path/finder.rb

@@ -68,7 +68,7 @@ module ShortestPath
     end
 
     def found?(node)
-      node == destination
+      node == destination      
     end
 
     def path_without_cache
@@ -84,13 +84,15 @@ module ShortestPath
 
       not_found = !found?(source)
 
-      while !pq.empty? && not_found
+      while pq.size != 0 && not_found
         raise TimeoutError if timeout?
 
         v = pq.pop
         not_found = !found?(v)
+        visit v
 
         weights = ways(v)
+
         if weights
           weights.keys.each do |w|
             w_distance = shortest_distances[v] + weights[w]

data/lib/shortest_path/version.rb

@@ -1,3 +1,3 @@
 module ShortestPath
-  VERSION = "0.0.4"
+  VERSION = "0.0.5"
 end

data/spec/shortest_path/finder_spec.rb

@@ -54,11 +54,11 @@ describe ShortestPath::Finder do
   end
 
   it "should produce test graph" do
-      my_graph = graph_sample(600)
-      start = Time.now
-      result = expect(shortest_path( "150-150", "300-300", my_graph))
-      puts "cost= #{Time.now-start}"
-      puts result.inspect
+    my_graph = graph_sample(600)
+    start = Time.now
+    result = shortest_path( "150-150", "300-300", my_graph)
+    #puts result.inspect
+    expect(Time.now-start).to be < 5    
   end
 
   context "when using an edge_count filter in context " do

metadata

@@ -1,8 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: shortest_path
 version: !ruby/object:Gem::Version
-  version: 0.0.4
-  prerelease: 
+  version: 0.0.5
 platform: ruby
 authors:
 - Alban Peignier
@@ -11,12 +10,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-05-14 00:00:00.000000000 Z
+date: 2015-01-12 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: guard
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -24,7 +22,6 @@ dependencies:
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -32,7 +29,6 @@ dependencies:
 - !ruby/object:Gem::Dependency
   name: guard-bundler
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -40,7 +36,6 @@ dependencies:
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -48,7 +43,6 @@ dependencies:
 - !ruby/object:Gem::Dependency
   name: guard-rspec
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -56,7 +50,6 @@ dependencies:
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -64,7 +57,6 @@ dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -72,7 +64,6 @@ dependencies:
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -80,7 +71,6 @@ dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -88,7 +78,6 @@ dependencies:
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -96,7 +85,6 @@ dependencies:
 - !ruby/object:Gem::Dependency
   name: priority_queue_cxx
   requirement: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -104,7 +92,6 @@ dependencies:
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
@@ -119,6 +106,7 @@ extensions: []
 extra_rdoc_files: []
 files:
 - .gitignore
+- .rspec
 - .rvmrc
 - .travis.yml
 - Gemfile
@@ -136,32 +124,25 @@ files:
 - spec/spec_helper.rb
 homepage: http://github.com/dryade/shortest_path
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
-      segments:
-      - 0
-      hash: 1341351258851856295
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
-      segments:
-      - 0
-      hash: 1341351258851856295
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.23
+rubygems_version: 2.4.2
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Ruby library to find shortest path(s) in a graph
 test_files: []