cvut_mi_rub_nodes_distance_solver 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 37a4eebd2a9637c18e096d34657976b795b083a8
+  data.tar.gz: 573bbe11f8bc1ff62939945bae8f74892587031a
+SHA512:
+  metadata.gz: b00731d0e5174e71831f3b138131fc6c690f706eb208cc79af23cda84822009b6e0f1036cdbdb20cc5fc3edb857c9bdaa1c344af52268fe67002ca5f8477b66e
+  data.tar.gz: 24df050e9474d88435d2acfab335aab3547a370d005bcf2f140345bc1447450cf0de0bef024bb488bf715db946ef8610886b1dc181c38e530bb36916d86c9d1e

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Bc. Petr Janouch
+
+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 @@
+# CvutMiRubNodesDistanceSolver
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'cvut_mi_rub_nodes_distance_solver'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install cvut_mi_rub_nodes_distance_solver
+
+## 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 @@
+require "bundler/gem_tasks"

data/bin/cvut_mi_rub_nodes_distance_solver

@@ -0,0 +1,5 @@
+#!/usr/bin/env ruby
+
+require 'nodesDistanceSolver/cli'
+
+NodesDistance::CLI.start(ARGV)

data/cvut_mi_rub_nodes_distance_solver.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'cvut_mi_rub_nodes_distance_solver/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "cvut_mi_rub_nodes_distance_solver"
+  spec.version       = CvutMiRubNodesDistanceSolver::VERSION
+  spec.authors       = ["Bc. Petr Janouch"]
+  spec.email         = ["janoupe8@fit.cvut.cz"]
+  spec.description   = "A gem that is used to compute distances between all nodes in graph"
+  spec.summary       = "A gem that is used to compute distances between all nodes in graph"
+  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"
+end

data/lib/cvut_mi_rub_nodes_distance_solver.rb

@@ -0,0 +1,5 @@
+require "cvut_mi_rub_nodes_distance_solver/version"
+
+module CvutMiRubNodesDistanceSolver
+  # Your code goes here...
+end

data/lib/cvut_mi_rub_nodes_distance_solver/cli.rb

@@ -0,0 +1,59 @@
+#!/usr/bin/env ruby
+require 'cvut_mi_rub_nodes_distance_solver/dijkstra'
+require 'cvut_mi_rub_nodes_distance_solver/multiplication'
+require 'cvut_mi_rub_nodes_distance_solver/floyd'
+require 'cvut_mi_rub_nodes_distance_solver/distance_matrix'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+require 'thor'
+
+module NodesDistance
+
+  class CLI < Thor
+    desc "floyd FILE", "finds shortest distance between all nodes in a graph using Floid's algorithm"
+    def floyd(file)
+      matrix = get_matrix(file)
+      solver = Floyd.new(matrix)
+      result = solver.solve
+      puts result.to_s
+    end
+
+    desc "dijkstra FILE", "finds shortest distance between all nodes in a graph using Dijkstra's algorithm"
+    def dijkstra(file)
+      matrix = get_matrix(file)
+      solver = Dijkstra.new(matrix)
+      result = solver.solve
+      puts result.to_s
+    end
+
+    desc "multiplication FILE", "finds shortest distance between all nodes in a graph using min-plus product"
+    def multiplication(file)
+      matrix = get_solver(file)
+      solver = Multiplication.new(matrix)
+      result = solver.solve
+      puts result.to_s
+    end
+
+    private
+
+    def get_matrix(file)
+      input = get_input_from_file(file)
+      input_parser = InputParser.new(input)
+      unless input_parser.is_valid?
+        puts 'incorrect input format'
+        exit
+      end
+      matrix = input_parser.create_matrix
+      matrix
+    end
+
+    def get_input_from_file(file_path)
+      str = ''
+      File.open(file_path, "r") do |f|
+        f.readlines.each do |line|
+          str += line
+        end
+      end
+      str
+    end
+  end
+end

data/lib/cvut_mi_rub_nodes_distance_solver/dijkstra.rb

@@ -0,0 +1,68 @@
+#!/bin/ruby
+require 'cvut_mi_rub_nodes_distance_solver/distance_matrix'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+
+module NodesDistance
+
+  # class containing algorithms for shortest distances computation
+  class NodesDistance::Dijkstra
+
+    def initialize(input_matrix)
+      @input_matrix = input_matrix
+    end
+
+    # returns a matrix of shortest distances between all nodes
+    # computed using dijkstra algorithm from each node
+    def solve
+      matrix = DistanceMatrix.new(@input_matrix.dimension)
+      @input_matrix.dimension.times do |i|
+        distance_vector = dijkstra_for_one_node(i)
+        matrix[i] = distance_vector
+      end
+      matrix
+    end
+
+    private
+
+    # calculates shortest distances between the starting_node and all other nodes
+    # Arguments: starting_node: (int) index of the node shortes path is calculated from
+    def dijkstra_for_one_node(starting_node)
+      distance_vector = Array.new(@input_matrix.dimension) do
+        INFINITY
+      end
+      distance_vector[starting_node] = 0
+
+      node_queue = []
+      @input_matrix.dimension.times do |i|
+        node_queue << i
+      end
+
+      until node_queue.empty?
+        node = remove_node_with_smallest_distance_from_queue(distance_vector, node_queue)
+        break if distance_vector[node] == INFINITY
+        neighbours = @input_matrix[node]
+        neighbours.each_with_index do |neighbour_distance, neighbour|
+          if distance_vector[neighbour] > distance_vector[node] + neighbour_distance
+            distance_vector[neighbour] = distance_vector[node] + neighbour_distance
+          end
+        end
+      end
+      distance_vector
+    end
+
+    # remove node with smallest distence from queue
+    # Arguments: distance_vector (Array) vector of distances
+    def remove_node_with_smallest_distance_from_queue(distance_vector, node_queue)
+      min_value = INFINITY
+      min_index = 0
+      node_queue.each_with_index do |node, index|
+        value = distance_vector[node]
+        if value < min_value
+          min_value = value
+          min_index = index
+        end
+      end
+      node_queue.delete_at(min_index)
+    end
+  end
+end

data/lib/cvut_mi_rub_nodes_distance_solver/distance_matrix.rb

@@ -0,0 +1,170 @@
+#!/usr/bin/env ruby
+
+module NodesDistance
+
+  INFINITY = Float::INFINITY
+  INFINITY_SYMBOL = 'I'
+
+  # class that represents the matrix of distances between nodes
+  # it also defines multiplication of matrixes using min-sum product
+  class DistanceMatrix
+
+    attr_reader :dimension
+
+    # expect a dimesion of the matrix
+    # Arguments: dimension (String)
+    def initialize(dimension)
+      @dimension = dimension
+      @matrix = Array.new(dimension) do
+        Array.new(dimension) { INFINITY }
+      end
+    end
+
+    # prints matrix in human-readible form
+    def to_s
+      res = ''
+      @matrix.each_with_index do |row, row_index|
+        res += horizontal_gap unless row_index == 0
+        row.each_with_index do |item, item_index|
+          res += ' ' unless item_index == 0
+          res += print_item(item)
+        end
+        res += "\n"
+      end
+      res
+    end
+
+    # accesses matrix item or row based on # of arguments
+    def [](*args)
+      return @matrix[args[0]] if args.length == 1
+      @matrix[args[0]][args[1]]
+    end
+
+    # sets matrix item or row based on # of arguments
+    def []=(*args)
+      if args.length == 2
+        @matrix[args[0]] = args[1]
+      else
+        @matrix[args[0]][args[1]] = args[2]
+      end
+    end
+
+    # returns min-sum product of the two matrixes
+    # Arguments: other_matrix (DistanceMatrix)
+    def *(other_matrix)
+      result = DistanceMatrix.new(@dimension)
+      @dimension.times do |i|
+        @dimension.times do |j|
+          sum_vector = []
+          @dimension.times do |k|
+            sum = @matrix[i][k] + other_matrix[k, j]
+            sum_vector << sum
+          end
+          min = minimum(sum_vector)
+          result[i, j] = min
+        end
+      end
+      result
+    end
+
+    # returns power of the matrix
+    
+    def ^(power)
+      result = copy
+      (power - 1).times do |i|
+        result *= result
+      end
+      result
+    end
+
+    # test if the two matrixes are equal
+    # Arguments: other (DistanceMatrix)
+    def ==(other)
+      return false unless @dimension == other.dimension
+      @dimension.times do |x|
+        @dimension.times do |y|
+          return false unless @matrix[x][y] == other[x, y]
+        end
+      end
+      true
+    end
+
+    # returs a copy of the matrix
+    def copy
+      result = DistanceMatrix.new(@dimension)
+      iterate_all do |item, x, y|
+        result[x, y] = item
+      end
+      result
+    end
+
+    # iterates over all intems in matrix and also yields their coordinates
+    def iterate_all
+      @matrix.each_with_index do |row, x|
+        row.each_with_index do |item, y|
+          yield(item, x, y)
+        end
+      end
+    end
+
+    private
+
+    # prints empty line
+    def horizontal_gap
+      line = ''
+      max_digits = max_digits()
+      line_width = @dimension * (max_digits + 1) - 1
+      line_width.times do
+        line += ' '
+      end
+      line += "\n"
+      line
+    end
+
+    # returns number of digits in provided number
+    # Arguments: number (int)
+    def digits(number)
+      number.to_s.size
+    end
+
+    def max_digits
+      max = 1
+      @matrix.each do |row|
+        row.each do |item|
+          next if item == INFINITY
+          item_digits = digits(item)
+          max = item_digits if item_digits > max
+        end
+      end
+      max
+    end
+
+    # prints an item of the matrix
+    # Arguments: item (int)
+    def print_item(item)
+      res = ''
+      max_digits = max_digits()
+      item_digits = digits(item)
+      digits_diferrence = max_digits - item_digits
+      digits_diferrence.times do
+        res += ' '
+      end
+      if item == INFINITY
+        res += INFINITY_SYMBOL
+      else
+        res += item.to_s
+      end
+      res
+    end
+
+    # returns the smallest item from provided vector
+    # Arguments: vector (Array<int>)
+    def minimum(vector)
+      min = INFINITY
+      vector.each do |item|
+        min = item if item < min
+      end
+      min
+    end
+  end
+end

data/lib/cvut_mi_rub_nodes_distance_solver/floyd.rb

@@ -0,0 +1,29 @@
+#!/bin/ruby
+require 'cvut_mi_rub_nodes_distance_solver/distance_matrix'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+
+module NodesDistance
+
+  # class containing algorithms for shortest distances computation
+  class NodesDistance::Floyd
+
+    def initialize(input_matrix)
+      @input_matrix = input_matrix
+    end
+
+    # returns a matrix of shortest distances between all nodes
+    # computed using Floyd algorithm
+    def solve
+      matrix = @input_matrix.copy
+      matrix.dimension.times do |k|
+        matrix.dimension.times do |i|
+          matrix.dimension.times do |j|
+            matrix[i, j] = [matrix[i, j], matrix[i, k] + matrix[k, j]].min
+          end
+        end
+      end
+      matrix
+    end
+
+  end
+end

data/lib/cvut_mi_rub_nodes_distance_solver/input_parser.rb

@@ -0,0 +1,116 @@
+#!/bin/ruby
+require 'cvut_mi_rub_nodes_distance_solver/distance_matrix'
+
+module NodesDistance
+
+  class InputParser
+
+    def initialize(input)
+      @input = input
+    end
+
+    # returns true if input is valid - is square matrix,
+    # contains non-negative numbers or signs for infinit distance,
+    # the distance of each node to self is 0
+    def is_valid?
+      # is square matrix
+      return false unless dimensions_valid?
+      # non-negative numbers or signs for infinit distance
+      return false unless is_valid_symbol?
+      # the distance to self is
+      return false unless zeros_on_diagonal?
+      true
+    end
+
+    def create_matrix
+      dimension = number_of_rows
+      matrix = DistanceMatrix.new(dimension)
+      iterate_elements do |item, row_index, col_index|
+        if item == INFINITY_SYMBOL
+          item = INFINITY
+        else
+          item = item.to_i
+        end
+        matrix[row_index, col_index] = item
+      end
+      matrix
+    end
+
+    private
+
+    # iterates over all ellements in the input
+    def iterate_elements
+      iterate_rows do |row, row_index|
+        iterate_row_items(row) do |item, item_index|
+          yield(item, row_index, item_index)
+        end
+      end
+    end
+
+    # iterates over all rows in the input
+    def iterate_rows
+      @input.split(/\n/).each_with_index do |row, row_index|
+        row = row.strip
+        yield(row, row_index)
+      end
+    end
+
+    # returns number of rows in the input
+    def number_of_rows
+      row_counter = 0
+      iterate_rows do
+        row_counter += 1
+      end
+      row_counter
+    end
+
+    # non-negative numbers or signs for infinit distance
+    def is_valid_symbol?
+      iterate_elements do |item|
+        next if item == INFINITY_SYMBOL
+        begin
+          item = Float(item)
+        rescue ArgumentError, TypeError
+          return false
+        end
+        return false if item < 0
+      end
+      true
+    end
+
+    # is square matrix
+    def dimensions_valid?
+      row_number = number_of_rows
+      iterate_rows do |row|
+        return false unless row_size(row) == row_number
+      end
+      true
+    end
+
+    # returns number of items in the given row
+    # Arguments: row (Array)
+    def row_size(row)
+      counter = 0
+      iterate_row_items(row) do |item, index|
+        counter += 1
+      end
+      counter
+    end
+
+    # itertes over all row items
+    # Arguments: row (Array)
+    def iterate_row_items(row)
+      row.split(/ /).each_with_index do |item, index|
+        yield(item, index)
+      end
+    end
+
+    # the distance to self is
+    def zeros_on_diagonal?
+      iterate_elements do |item, row_index, col_index|
+        return false if row_index == col_index && item != '0'
+      end
+      true
+    end
+  end
+end

data/lib/cvut_mi_rub_nodes_distance_solver/multiplication.rb

@@ -0,0 +1,22 @@
+#!/bin/ruby
+require 'cvut_mi_rub_nodes_distance_solver/distance_matrix'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+
+module NodesDistance
+
+  # class containing algorithms for shortest distances computation
+  class NodesDistance::Multiplication
+
+    def initialize(input_matrix)
+      @input_matrix = input_matrix
+    end
+
+    # returns a matrix of shortest distances between all nodes
+    # computed using min-plus matrix product
+    def solve
+      matrix = @input_matrix.copy
+      matrix = matrix ^ matrix.dimension
+      matrix
+    end
+  end
+end

data/lib/cvut_mi_rub_nodes_distance_solver/version.rb

@@ -0,0 +1,3 @@
+module CvutMiRubNodesDistanceSolver
+  VERSION = "0.0.1"
+end

data/sample inputs/input1

@@ -0,0 +1,6 @@
+0 I I 2 I 7
+I 0 2 I I I
+I I 0 I 3 I
+I 7 I 0 1 I
+I I I I 0 3
+I I 1 I I 0

data/sample inputs/input2

@@ -0,0 +1,7 @@
+0 10 I 35 I I I
+I 0 15 I 40 I I
+I I 0 5 20 I I
+10 I I 0 I I I
+I I I I 0 20 10
+I I I I I 0 5
+I I I 25 I I 0

data/sample inputs/input3

@@ -0,0 +1,8 @@
+0 5 8 I I 6 I 3
+11 0 5 I I I 9 4
+7 I 0 I I 3 I I
+I I 4 0 8 3 I I
+I 5 3 I 0 8 I I
+2 1 I I I 0 4 6
+5 4 I I 3 2 0 I
+I I 12 7 8 I 5 0

data/spec/dijkstra_spec.rb

@@ -0,0 +1,63 @@
+#!/usr/bin/env ruby
+
+$LOAD_PATH << './'
+require 'rspec'
+require 'spec_helper'
+require 'spec_data'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+require 'cvut_mi_rub_nodes_distance_solver/dijkstra'
+
+describe NodesDistance::Dijkstra do
+
+  subject do
+    input_parser = NodesDistance::InputParser.new(input)
+    matrix = input_parser.create_matrix
+    shortest = NodesDistance::Dijkstra.new(matrix)
+    shortest
+  end
+
+  describe 'shortest paths 1' do
+    input, result = SpecData.first
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using dijkstra algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+
+  describe 'shortest paths 2' do
+    input, result = SpecData.second
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using dijkstra algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+
+  describe 'shortest paths 3' do
+    input, result = SpecData.third
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using dijkstra algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+end

data/spec/distance_matrix_spec.rb

@@ -0,0 +1,85 @@
+#!/usr/bin/env ruby
+
+$LOAD_PATH << './'
+require 'rspec'
+require 'spec_helper'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+
+describe NodesDistance::DistanceMatrix do
+
+  subject do
+    input_parser = NodesDistance::InputParser.new(input)
+    input_parser.create_matrix
+  end
+
+  describe 'output format' do
+    let(:input) do
+      '0 5 22
+       0 0 42
+       99 0 33'
+    end
+
+    it 'should print formated matrix' do
+      expected_result = " 0  5 22\n"\
+                        "        \n"\
+                        " 0  0 42\n"\
+                        "        \n"\
+                        "99  0 33\n"
+      expect(subject.to_s).to eq expected_result
+    end
+  end
+
+  describe 'accessing values' do
+    let(:input) do
+      '0 5 22
+       0 0 42
+       99 0 33'
+    end
+
+    it 'should get values' do
+      expect(subject[0, 0]).to eq 0
+      expect(subject[0, 2]).to eq 22
+      expect(subject[2, 2]).to eq 33
+    end
+  end
+
+  describe 'multiplication' do
+    let(:input) do
+      '1 -3 7
+       I 5 I
+       8 2 -5'
+    end
+
+    it 'should do modified multiplication' do
+      b_input = '8 I -4
+                -3 0 -7
+                 5 -2 1'
+      b_ip = NodesDistance::InputParser.new(b_input)
+      b = b_ip.create_matrix
+      c_input = '-6 -3 -10
+                  2 5 -2
+                 -1 -7 -5'
+      c_ip =  NodesDistance::InputParser.new(c_input)
+      c = c_ip.create_matrix
+      expect(subject * b).to eq c
+    end
+  end
+
+  describe 'square' do
+    let(:input) do
+      '1 -3 7
+       I 5 I
+       8 2 -5'
+    end
+
+    it 'should square matrix' do
+      res_input = '2 -2 2
+                   I 10 I
+                   3 -3 -10'
+      res_ip = NodesDistance::InputParser.new(res_input)
+      res = res_ip.create_matrix
+      expect(subject ^ 2).to eq res
+    end
+  end
+
+end

data/spec/floyd_spec.rb

@@ -0,0 +1,63 @@
+#!/usr/bin/env ruby
+
+$LOAD_PATH << './'
+require 'rspec'
+require 'spec_helper'
+require 'spec_data'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+require 'cvut_mi_rub_nodes_distance_solver/floyd'
+
+describe NodesDistance::Floyd do
+
+  subject do
+    input_parser = NodesDistance::InputParser.new(input)
+    matrix = input_parser.create_matrix
+    shortest = NodesDistance::Floyd.new(matrix)
+    shortest
+  end
+
+  describe 'shortest paths 1' do
+    input, result = SpecData.first
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using floyd algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+
+  describe 'shortest paths 2' do
+    input, result = SpecData.second
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using floyd algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+
+  describe 'shortest paths 3' do
+    input, result = SpecData.third
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using floyd algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+end

data/spec/input_parser_spec.rb

@@ -0,0 +1,80 @@
+#!/usr/bin/env ruby
+$LOAD_PATH << './'
+require 'spec_helper'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+
+describe NodesDistance::InputParser do
+  subject do
+    NodesDistance::InputParser.new(input)
+  end
+
+  describe 'incorrect dimensions' do
+    let(:input) do
+      '0 0 0
+       0 0'
+    end
+
+    it 'should not pass rows of different sizes' do
+      expect(subject.is_valid?).to eq false
+    end
+  end
+
+  describe 'incorrect dimensions' do
+    let(:input) do
+      '0 0 0
+       0 0 0'
+    end
+
+    it 'should not pass matrix that has width larger than height' do
+      expect(subject.is_valid?).to eq false
+    end
+  end
+
+  describe 'incorrect dimensions' do
+    let(:input) do
+      '0 0
+       0 0
+       0 0'
+    end
+
+    it 'should not pass matrix that has haight larger than width' do
+      expect(subject.is_valid?).to eq false
+    end
+  end
+
+  describe 'input values' do
+    let(:input) do
+      '0 0 0
+       0 2 0
+       0 0 3'
+    end
+
+    it 'should not pass if a node has the distance to itself other than 0' do
+      expect(subject.is_valid?).to eq false
+    end
+  end
+
+  describe 'input values' do
+    let(:input) do
+      '0 -5 f
+       ? 0 8
+       0 . 0'
+    end
+
+    it 'should not pass if there are not possitive numbers, infinity symbols or zeros on the input' do
+      expect(subject.is_valid?).to eq false
+    end
+  end
+
+  describe 'input values' do
+    let(:input) do
+      '0 5 2.2
+       4 0 1
+       3 7 0'
+    end
+
+    it 'should recognize correct input' do
+      expect(subject.is_valid?).to eq true
+    end
+  end
+end

data/spec/multiplication_spec.rb

@@ -0,0 +1,63 @@
+#!/usr/bin/env ruby
+
+$LOAD_PATH << './'
+require 'rspec'
+require 'spec_helper'
+require 'spec_data'
+require 'cvut_mi_rub_nodes_distance_solver/input_parser'
+require 'cvut_mi_rub_nodes_distance_solver/multiplication'
+
+describe NodesDistance::Multiplication do
+
+  subject do
+    input_parser = NodesDistance::InputParser.new(input)
+    matrix = input_parser.create_matrix
+    shortest = NodesDistance::Multiplication.new(matrix)
+    shortest
+  end
+
+  describe 'shortest paths 1' do
+    input, result = SpecData.first
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using multiplication algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+
+  describe 'shortest paths 2' do
+    input, result = SpecData.second
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using multipliation algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+
+  describe 'shortest paths 3' do
+    input, result = SpecData.third
+    let(:input) do
+      input
+    end
+
+    rip = NodesDistance::InputParser.new(result)
+    result_matrix = rip.create_matrix
+
+    it 'should find the shortest paths using multiplication algorithm' do
+      expect(subject.solve).to eq result_matrix
+    end
+
+  end
+end

data/spec/spec_data.rb

@@ -0,0 +1,59 @@
+
+# contains data for test cases
+class SpecData
+
+  def self.first
+    input = '0 I I 2 I 7
+             I 0 2 I I I
+             I I 0 I 3 I
+             I 7 I 0 1 I
+             I I I I 0 3
+             I I 1 I I 0'
+    result = '0 9 7 2 3 6
+              I 0 2 I 5 8
+              I I 0 I 3 6
+              I 7 5 0 1 4
+              I I 4 I 0 3
+              I I 1 I 4 0'
+    return input, result
+  end
+
+  def self.second
+    input = '0 10 I 35 I I I
+             I 0 15 I 40 I I
+             I I 0 5 20 I I
+             10 I I 0 I I I
+             I I I I 0 20 10
+             I I I I I 0 5
+             I I I 25 I I 0'
+    result = '0 10 25 30 45 65 55
+              30 0 15 20 35 55 45
+               15 25 0 5 20 40 30
+              10 20 35 0 55 75 65
+              45 55 70 35 0 20 10
+               40 50 65 30 85 0 5
+             35 45 60 25 80 100 0'
+    return input, result
+  end
+
+  def self.third
+    input = '0 5 8 I I 6 I 3
+            11 0 5 I I I 9 4
+             7 I 0 I I 3 I I
+             I I 4 0 8 3 I I
+             I 5 3 I 0 8 I I
+             2 1 I I I 0 4 6
+             5 4 I I 3 2 0 I
+             I I 12 7 8 I 5 0'
+    result = '0 5 8 10 11 6 8 3
+              10 0 5 11 12 8 9 4
+              5 4 0 15 10 3 7 8
+              5 4 4 0 8 3 7 8
+              8 5 3 16 0 6 10 9
+              2 1 6 12 7 0 4 5
+              4 3 6 14 3 2 0 7
+              9 8 11 7 8 7 5 0'
+    return input, result
+  end
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1,6 @@
+#!/usr/bin/env ruby
+
+RSpec.configure do |config|
+  config.color_enabled = true
+  config.formatter = :documentation
+end

metadata

@@ -0,0 +1,107 @@
+--- !ruby/object:Gem::Specification
+name: cvut_mi_rub_nodes_distance_solver
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Bc. Petr Janouch
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-02-07 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: A gem that is used to compute distances between all nodes in graph
+email:
+- janoupe8@fit.cvut.cz
+executables:
+- cvut_mi_rub_nodes_distance_solver
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/cvut_mi_rub_nodes_distance_solver
+- cvut_mi_rub_nodes_distance_solver.gemspec
+- lib/cvut_mi_rub_nodes_distance_solver.rb
+- lib/cvut_mi_rub_nodes_distance_solver/cli.rb
+- lib/cvut_mi_rub_nodes_distance_solver/dijkstra.rb
+- lib/cvut_mi_rub_nodes_distance_solver/distance_matrix.rb
+- lib/cvut_mi_rub_nodes_distance_solver/floyd.rb
+- lib/cvut_mi_rub_nodes_distance_solver/input_parser.rb
+- lib/cvut_mi_rub_nodes_distance_solver/multiplication.rb
+- lib/cvut_mi_rub_nodes_distance_solver/version.rb
+- sample inputs/input1
+- sample inputs/input2
+- sample inputs/input3
+- spec/.DS_Store
+- spec/dijkstra_spec.rb
+- spec/distance_matrix_spec.rb
+- spec/floyd_spec.rb
+- spec/input_parser_spec.rb
+- spec/multiplication_spec.rb
+- spec/spec_data.rb
+- spec/spec_helper.rb
+homepage: ''
+licenses:
+- MIT
+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.1.5
+signing_key: 
+specification_version: 4
+summary: A gem that is used to compute distances between all nodes in graph
+test_files:
+- spec/.DS_Store
+- spec/dijkstra_spec.rb
+- spec/distance_matrix_spec.rb
+- spec/floyd_spec.rb
+- spec/input_parser_spec.rb
+- spec/multiplication_spec.rb
+- spec/spec_data.rb
+- spec/spec_helper.rb