dijkstraruby 0.0.2

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--format progress

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in dijkstraruby.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,35 @@
+PATH
+  remote: .
+  specs:
+    dijkstraruby (0.0.2)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    coderay (1.0.9)
+    diff-lcs (1.2.4)
+    method_source (0.8.2)
+    pry (0.9.12.2)
+      coderay (~> 1.0.5)
+      method_source (~> 0.8)
+      slop (~> 3.4)
+    rake (10.1.0)
+    rspec (2.14.1)
+      rspec-core (~> 2.14.0)
+      rspec-expectations (~> 2.14.0)
+      rspec-mocks (~> 2.14.0)
+    rspec-core (2.14.6)
+    rspec-expectations (2.14.3)
+      diff-lcs (>= 1.1.3, < 2.0)
+    rspec-mocks (2.14.4)
+    slop (3.4.6)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.3)
+  dijkstraruby!
+  pry
+  rake
+  rspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 Heriberto Perez
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,29 @@
+# Dijkstraruby
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'dijkstraruby'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install dijkstraruby
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1,29 @@
+require "bundler/gem_tasks"
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec
+
+#require_relative 'graph.rb'
+
+#desc "Find shortest path"
+#task(:get_path) do
+  #new_graph =
+    #[
+      #[:a, :b, 7],
+      #[:a, :c, 9],
+      #[:a, :f, 14],
+      #[:b, :c, 10],
+      #[:b, :d, 15],
+      #[:c, :d, 11],
+      #[:c, :f, 2],
+      #[:d, :e, 6],
+      #[:e, :f, 9]
+    #]
+
+  #graph = Graph.new(new_graph)
+  #result = graph.shortest_path(:a, :e)
+  #puts "the shorthest cost is: #{result[1]} and the movements are: "
+  #puts result[0].join(' -> ')
+#end

data/dijkstraruby.gemspec

@@ -0,0 +1,25 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'dijkstraruby/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "dijkstraruby"
+  spec.version       = Dijkstraruby::VERSION
+  spec.authors       = ["Heriberto Perez"]
+  spec.email         = ["heriberto.perez@crowdint.com"]
+  spec.description   = %q{This gem is an implementation of the dijkstra algorithm}
+  spec.summary       = %q{dijkstra algorithm in ruby}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency "rspec"
+  spec.add_development_dependency "pry"
+end

data/lib/dijkstraruby.rb

@@ -0,0 +1,6 @@
+require "dijkstraruby/version"
+
+module Dijkstraruby
+  autoload :Graph, 'dijkstraruby/graph'
+  autoload :Vertex, 'dijkstraruby/vertex'
+end

data/lib/dijkstraruby/graph.rb

@@ -0,0 +1,66 @@
+# encoding: UTF-8
+#
+# this class is responsible to calculate the shorthest path
+module Dijkstraruby
+  class Graph
+
+    attr_reader :vertices
+
+    def initialize(graph)
+      initialize_vertices
+      @edges = {}
+      format_graph_values graph
+      @dijkstra_source = nil
+    end
+
+    def dijkstra(source)
+      vertex_values = @vertices.values
+      @vertices[source].set_zero_for_initial_vertice
+
+      until vertex_values.empty?
+        initial_vertice = get_vertices_distances vertex_values
+        break if initial_vertice.distance == Float::INFINITY
+        vertex_values.delete(initial_vertice)
+      end
+
+      @dijkstra_source = source
+    end
+
+    def shortest_path(start, finish)
+      dijkstra(start) unless @dijkstra_source == start
+      path = []
+      first_array_element = finish
+      while first_array_element
+        path.unshift(first_array_element)
+        first_array_element = @vertices[first_array_element].prev_vertice
+      end
+      [path, @vertices[finish].distance]
+    end
+
+    private
+
+    def get_vertices_distances(vertex_values)
+      initial_vertice = vertex_values.min_by { |vertex| vertex.distance }
+      initial_vertice.neighbours.each do |v|
+        vv = @vertices[v]
+        alt = initial_vertice.distance + @edges[[initial_vertice.name, v]]
+        if vertex_values.include?(vv) && alt < vv.distance
+          vv.change_distance_and_previous alt, initial_vertice
+        end
+      end
+      initial_vertice
+    end
+
+    def format_graph_values(graph)
+      graph.each do |(v1, v2, dist)|
+        @vertices[v1].neighbours << v2
+        @vertices[v2].neighbours << v1
+        @edges[[v1, v2]] = @edges[[v2, v1]] = dist
+      end
+    end
+
+    def initialize_vertices
+      @vertices = Hash.new { |h, k| h[k] = Vertex.new(k, [], Float::INFINITY) }
+    end
+  end
+end

data/lib/dijkstraruby/version.rb

@@ -0,0 +1,3 @@
+module Dijkstraruby
+  VERSION = "0.0.2"
+end

data/lib/dijkstraruby/vertex.rb

@@ -0,0 +1,24 @@
+# encoding: UTF-8
+# class reponsible for vertices
+#
+module Dijkstraruby
+  class Vertex
+    attr_accessor :name, :neighbours, :distance, :prev_vertice
+
+    def initialize(name, neighbours, distance, prev = nil)
+      @name = name
+      @neighbours = neighbours
+      @distance = distance
+      @prev_vertice = prev
+    end
+
+    def set_zero_for_initial_vertice
+      @distance = 0
+    end
+
+    def change_distance_and_previous(distance, previous_vertice)
+      @distance = distance
+      @prev_vertice = previous_vertice.name
+    end
+  end
+end

data/spec/dijkstraruby/graph_spec.rb

@@ -0,0 +1,39 @@
+# encoding: UTF-8
+require 'spec_helper'
+
+module Dijkstraruby
+  describe Graph do
+
+    let(:graph) do
+      Graph.new(
+        [
+          [:a, :b, 7],
+          [:a, :c, 9],
+          [:a, :f, 14],
+          [:b, :c, 10],
+          [:b, :d, 15],
+          [:c, :d, 11],
+          [:c, :f, 2],
+          [:d, :e, 6],
+          [:e, :f, 9]]
+      )
+    end
+
+    let(:graph_result) { graph.shortest_path(:a, :e) }
+
+    it 'should contain its neighbours for some vertices' do
+      expect(graph.vertices[:a].neighbours).to eq([:b, :c, :f ])
+      expect(graph.vertices[:b].neighbours).to eq([:a, :c, :d ])
+    end
+
+    it 'should return the shorthest cost value' do
+      expect(graph_result[1]).to eq(20)
+    end
+
+    it 'should return shorthesth route nodes ' do
+      format_result = graph_result[0].join(' -> ')
+      expect(format_result).to eq('a -> c -> f -> e')
+    end
+
+  end
+end

data/spec/dijkstraruby/vertex_spec.rb

@@ -0,0 +1,18 @@
+# encoding: UTF-8
+require 'spec_helper'
+
+module Dijkstraruby
+  describe Vertex do
+
+    let(:vertex) { Vertex.new('heriberto', [], 99_999) }
+
+    it 'should create a vertex class' do
+      expect(vertex.class).to eq Vertex
+    end
+
+    it 'should have a getter and setter for name' do
+      expect(vertex.name).to eq 'heriberto'
+    end
+
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,10 @@
+$:<< File.realpath('./lib')
+
+require 'dijkstraruby'
+
+RSpec.configure do |config|
+  config.treat_symbols_as_metadata_keys_with_true_values = true
+  config.run_all_when_everything_filtered = true
+  config.filter_run :focus
+  config.order = 'random'
+end

metadata

@@ -0,0 +1,128 @@
+--- !ruby/object:Gem::Specification
+name: dijkstraruby
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+  prerelease: 
+platform: ruby
+authors:
+- Heriberto Perez
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-10-26 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: This gem is an implementation of the dijkstra algorithm
+email:
+- heriberto.perez@crowdint.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .rspec
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- dijkstraruby.gemspec
+- lib/dijkstraruby.rb
+- lib/dijkstraruby/graph.rb
+- lib/dijkstraruby/version.rb
+- lib/dijkstraruby/vertex.rb
+- spec/dijkstraruby/graph_spec.rb
+- spec/dijkstraruby/vertex_spec.rb
+- spec/spec_helper.rb
+homepage: ''
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: dijkstra algorithm in ruby
+test_files:
+- spec/dijkstraruby/graph_spec.rb
+- spec/dijkstraruby/vertex_spec.rb
+- spec/spec_helper.rb
+has_rdoc: