dijkstra_gem 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 5899d8ec631e0010f0f9cf81aa9f339321e2506a
+  data.tar.gz: 1ad81af26af9a6c54245028cd0ff01b76bdeed81
+SHA512:
+  metadata.gz: 3e33e21b0cf0cde96dee7ef4bc7e5d6a4440846c7fc60a6eeff3e79c567987dd622905072b409b6edb5c96c754f4611796ee4006b3d476893242b89a74f6d302
+  data.tar.gz: f735b7b5a1bea33c0c925990c62a992b0ece1216b12aa6841816bfe4870e864fcbba9d2e8d8ce48c48242d6034063e0bf70a3612cd480dc115e8c62eb497764e

data/lib/dijkstra_gem.rb

@@ -0,0 +1,83 @@
+class DijkstraGem
+
+  def initialize(nodos)
+    @nodos = {}
+    @nodes_visited = {}
+    @best_way = []
+    @best_way_test = []
+    @final = 0
+    @way = []
+    (1..nodos).each do |i|
+      @nodos[i] = []
+      @nodes_visited[i] = i == 1
+    end
+  end
+
+
+  def add_distance nodo, points = []
+    points.each do |pnt|
+      return nil unless pnt.class == Array
+      self.distance nodo, pnt[0], pnt[1]
+    end
+  end
+
+  def search_best_way a , b
+    @final = b
+    @way << a
+    @best_way = [a,0]
+    @best_way_test = [a,0]
+    dijkstra(@nodos[a])
+    @way.join(" - ")
+  end
+
+  protected
+
+  def distance nodo, point, dist
+    @nodos[nodo] << [point, dist]
+  end
+
+  def dijkstra nodo
+    return true if nodo == @nodos[@final]
+    begin
+      best_nodo = {}
+      nodo.each {|n| best_nodo[n[1]] = n[0] unless @nodes_visited[n[0]]}
+      _best_nodo = good_way(best_nodo.sort)
+      _nodo = _best_nodo[1]
+      _dist = _best_nodo[0]
+      @nodes_visited[@best_way[0]] = true
+      @best_way = [_nodo, _dist]
+      @way << _nodo
+      dijkstra(@nodos[_nodo])
+    rescue Exception => e
+      return false
+    end
+  end
+
+  def good_way best_nodo
+    bn = []
+    best_nodo.each do |bst|
+      if test_dijkstra(@nodos[bst[1]])
+        bn = bst
+        break
+      end
+    end
+    @best_way_test = []
+    bn
+  end
+
+  def test_dijkstra nodo
+    return true if nodo == @nodos[@final]
+    begin
+      best_nodo = {}
+      nodo.each {|n| best_nodo[n[1]] = n[0] unless @nodes_visited[n[0]]}
+      best_nodo = best_nodo.sort.to_h
+      _nodo = best_nodo.values[0]
+      _dist = best_nodo.keys[0]
+      @best_way_test = [_nodo, _dist]
+      test_dijkstra(@nodos[_nodo])
+    rescue Exception => e
+      return false
+    end
+  end
+
+end

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: dijkstra_gem
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- José Núñez
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2018-01-03 00:00:00.000000000 Z
+dependencies: []
+description: dijkstra algorithm
+email:
+- josnunezg@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/dijkstra_gem.rb
+homepage: https://github.com/josnunezg/DijkstraGem.git
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.6.12
+signing_key: 
+specification_version: 4
+summary: My first gem
+test_files: []