kruskal 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: dd20b4362b6c5fcf9efdcc723244b8df836ec8c8
+  data.tar.gz: 11f27c690c65a0b9846267025544fe4cc2ccff95
+SHA512:
+  metadata.gz: f87b054d690151fce0bb4dbbb8184c892540de7b13c5e78e6473c693f6eee76f8e7d1a4ae5401e1a240cecde6377fdbb58496e879566201bef5772a8de064b37
+  data.tar.gz: 446324a2b11da1deaa56faffe592d8e96276b3d0ccf10eeff47c2fc6077bb5c54d46bf3710d11104af59eb66a8b2a8ed27e89818a14ee2bc1445b298bebcc80d

data/.gitignore

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

data/.ruby-gemset

@@ -0,0 +1 @@
+kruskal

data/.ruby-version

@@ -0,0 +1 @@
+ruby-2.1

data/Gemfile

@@ -0,0 +1,3 @@
+source "https://rubygems.org"
+
+gemspec

data/Guardfile

@@ -0,0 +1,6 @@
+guard :rspec do
+  watch(%r{^spec/.+_spec\.rb$})
+  watch(%r{^lib/(.+)\.rb$})     { |m| "spec/lib/#{m[1]}_spec.rb" }
+  watch('spec/spec_helper.rb')  { "spec" }
+  watch('lib/kruskal.rb')  { "spec" }
+end

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Ronie Uliana
+
+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 @@
+# .
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem '.'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install .
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/./fork )
+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 a new Pull Request

data/Rakefile

@@ -0,0 +1,2 @@
+require "bundler/gem_tasks"
+

data/bin/kruskal

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+require 'kruskal'
+
+kruskal = Kruskal::MinimumSpanningTree.new
+reader = Kruskal::JsonIO.new(ARGF)
+
+kruskal.run(reader)
+
+writer = Kruskal::JsonIO.new(STDOUT)
+kruskal.forest.each do |tree|
+  tree.each do |relation|
+    writer << relation
+  end
+end

data/kruskal.gemspec

@@ -0,0 +1,25 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'kruskal/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'kruskal'
+  spec.version       = Kruskal::VERSION
+  spec.authors       = ['Ronie Uliana']
+  spec.email         = ['ronie.uliana@gmail.com']
+  spec.summary       = %q{Kruskal Minimum Spanning Tree algorithm}
+  spec.description   = %q{Graph Minimum Spanning Tree implementation using a variation of Kruskal algorithm. Intended to be used directly from command line or as a lib.}
+  spec.homepage      = 'http://github.com/ruliana/kruskal'
+  spec.license       = 'MIT'
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  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_dependency 'json', '~> 1.8'
+
+  spec.add_development_dependency 'bundler', '~> 1.6'
+  spec.add_development_dependency 'guard-rspec', '~> 4.2'
+end

data/lib/..rb

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

data/lib/kruskal.rb

@@ -0,0 +1,4 @@
+require 'kruskal/tree'
+require 'kruskal/forest'
+require 'kruskal/minimum_spanning_tree'
+require 'kruskal/json_io'

data/lib/kruskal/forest.rb

@@ -0,0 +1,40 @@
+module Kruskal
+  class Forest
+    include Enumerable
+
+    def initialize
+      @trees = {}
+    end
+
+    def index(node, tree)
+      @trees[node] = tree
+      @cached_to_a = nil
+    end
+
+    def new_tree(value = 0, source, target)
+      Tree.new(self, [[value, source, target]])
+    end
+
+    def to_a
+      @cached_to_a ||= @trees.values.uniq
+    end
+
+    def find_tree_for(node)
+      @trees[node]
+    end
+
+    def [](position)
+      to_a[position]
+    end
+
+    def each
+      to_a.each do |tree|
+        yield tree
+      end
+    end
+
+    def size
+      to_a.size
+    end
+  end
+end

data/lib/kruskal/json_io.rb

@@ -0,0 +1,28 @@
+require 'json'
+
+module Kruskal
+  class JsonIO
+    include Enumerable
+
+    def initialize(an_io)
+      @origin = an_io
+      @first = true
+    end
+
+    def each
+      @origin.each_line do |it|
+        yield JSON.parse(it)
+      end
+    end
+
+    def <<(object)
+      a_string = if @first
+                   @first = false
+                   JSON.generate(object)
+                 else
+                   "\n#{JSON.generate(object)}"
+                 end
+      @origin << a_string
+    end
+  end
+end

data/lib/kruskal/minimum_spanning_tree.rb

@@ -0,0 +1,40 @@
+module Kruskal
+  class MinimumSpanningTree
+    attr_accessor :forest
+
+    def initialize
+      @forest = Forest.new
+    end
+
+    def add(value = 0, source, target)
+      # Here is the full algorithm
+      tree_source = find_tree_for(source)
+      tree_target = find_tree_for(target)
+      if tree_source.nil? && tree_target.nil?
+        new_tree(value, source, target)
+      elsif tree_source && tree_target.nil?
+        tree_source.add(value, source, target)
+      elsif tree_source.nil? && tree_target
+        tree_target.add(value, source, target)
+      elsif tree_source != tree_target
+        tree_source.merge!(tree_target)
+        tree_source.add(value, source, target)
+      end
+    end
+
+    def run(data)
+      data.each do |relation|
+        add(*relation)
+      end
+    end
+
+    private
+    def find_tree_for(node)
+      @forest.find_tree_for(node)
+    end
+
+    def new_tree(value, source, target)
+      @forest.new_tree(value, source, target)
+    end
+  end
+end

data/lib/kruskal/tree.rb

@@ -0,0 +1,67 @@
+module Kruskal
+  class Tree
+    extend Forwardable
+    include Enumerable
+
+    def_delegators :@relations, :each
+
+    def initialize(index, relations = [])
+      @index, @relations = index, relations
+      reindex
+    end
+
+    def eql?(other)
+      if other.is_a?(self.class)
+        other.relations_equal_to(@relations)
+      elsif other.is_a?(Array)
+        @relations == other
+      else
+        false
+      end
+    end
+
+    alias == eql?
+
+    def hash
+      @relations.hash
+    end
+
+    def add(value, source, target)
+      @relations << [value, source, target]
+      index(target)
+    end
+
+    def merge!(other_tree)
+      other_tree.add_relations_to(@relations)
+      other_tree.each do |(v, s, t)|
+        index(s, t)
+      end
+    end
+
+    def inspect
+      "Tree#{@relations.inspect}"
+    end
+
+    protected
+    def add_relations_to(an_array)
+      an_array.concat(@relations)
+    end
+
+    def relations_equal_to(an_array)
+      an_array == @relations
+    end
+
+    private
+    def index(*nodes)
+      nodes.each do |it|
+        @index.index(it, self)
+      end
+    end
+
+    def reindex
+      @relations.each do |(v, s, t)|
+        index(s, t)
+      end
+    end
+  end
+end

data/lib/kruskal/version.rb

@@ -0,0 +1,3 @@
+module Kruskal
+  VERSION = '0.1.0'
+end

data/spec/lib/kruskal/json_io_spec.rb

@@ -0,0 +1,20 @@
+require 'spec_helper'
+
+describe Kruskal::JsonIO do
+  it 'reads JSON in lines, outputs Ruby objects' do
+    input = StringIO.new("[1, 2]\n[3, 4]\n[5, 6]")
+    reader = Kruskal::JsonIO.new(input)
+    objects = reader.map { |it| it }
+    expect(objects.size).to eq 3
+    expect(objects.first).to eq [1, 2]
+    expect(objects.last).to eq [5, 6]
+  end
+
+  it 'writes object as JSON' do
+    output = StringIO.new
+    writer = Kruskal::JsonIO.new(output)
+    writer << [1, 2]
+    writer << [3, 4]
+    expect(output.string).to eq "[1,2]\n[3,4]"
+  end
+end

data/spec/lib/kruskal/minimum_spanning_tree_spec.rb

@@ -0,0 +1,93 @@
+require 'spec_helper'
+
+describe Kruskal::MinimumSpanningTree do
+  let (:kruskal) { Kruskal::MinimumSpanningTree.new }
+
+  describe '#add' do
+    it 'creates a forest' do
+      kruskal.add('a', 'b')
+      expect(kruskal.forest.size).to eq 1
+      expect(kruskal.forest.first).to eq [[0, 'a', 'b']]
+    end
+
+    it 'creates more forests' do
+      kruskal.add('a', 'b')
+      kruskal.add('c', 'd')
+      expect(kruskal.forest.size).to eq 2
+      expect(kruskal.forest).to include [[0, 'a', 'b']]
+      expect(kruskal.forest).to include [[0, 'c', 'd']]
+    end
+
+    it 'expands a forest' do
+      kruskal.add('a', 'b')
+      kruskal.add('b', 'c')
+      expect(kruskal.forest.size).to eq 1
+      expect(kruskal.forest.first).to eq [[0, 'a', 'b'], [0, 'b', 'c']]
+    end
+
+    it 'joins forests' do
+      kruskal.add('a', 'b')
+      kruskal.add('c', 'd')
+      kruskal.add('d', 'a')
+      expect(kruskal.forest.size).to eq 1
+      tree = kruskal.forest.first
+      expect(tree).to include [0, 'a', 'b']
+      expect(tree).to include [0, 'c', 'd']
+      expect(tree).to include [0, 'd', 'a']
+    end
+
+    it 'ignores connections in the same forest' do
+      kruskal.add('a', 'b')
+      kruskal.add('c', 'd')
+      kruskal.add('d', 'a')
+      kruskal.add('a', 'c')
+      tree = kruskal.forest.first
+      expect(tree).to include [0, 'd', 'a']
+      expect(tree).to_not include [0, 'a', 'c']
+    end
+  end
+
+  describe '#run' do
+    it 'creates a single minimum spanning tree' do
+      data = [[10, 'a', 'b'],
+              [9, 'c', 'd'],
+              [8, 'b', 'c'],
+              [7, 'b', 'd']]
+      kruskal.run(data)
+      expect(kruskal.forest.size).to eq 1
+
+      tree = kruskal.forest.first
+      expect(tree).to include [10, 'a', 'b']
+      expect(tree).to include [9, 'c', 'd']
+      expect(tree).to include [8, 'b', 'c']
+      expect(tree).to_not include [7, 'b', 'd']
+    end
+
+    it 'creates more trees when not nodes do not connecte' do
+      data = [[10, 'a', 'b'],
+              [9, 'c', 'd'],
+              [8, 'e', 'f'],
+              [7, 'g', 'h'],
+              [6, 'd', 'a'],
+              [5, 'e', 'g']]
+      kruskal.run(data)
+      expect(kruskal.forest.size).to eq 2
+
+      tree1 = kruskal.forest[0]
+      expect(tree1).to include [10, 'a', 'b']
+      expect(tree1).to include [9, 'c', 'd']
+      expect(tree1).to include [6, 'd', 'a']
+      expect(tree1).to_not include [8, 'e', 'f']
+      expect(tree1).to_not include [7, 'g', 'h']
+      expect(tree1).to_not include [5, 'e', 'g']
+
+      tree2 = kruskal.forest[1]
+      expect(tree2).to_not include [10, 'a', 'b']
+      expect(tree2).to_not include [9, 'c', 'd']
+      expect(tree2).to_not include [6, 'd', 'a']
+      expect(tree2).to include [8, 'e', 'f']
+      expect(tree2).to include [7, 'g', 'h']
+      expect(tree2).to include [5, 'e', 'g']
+    end
+  end
+end

data/spec/lib/kruskal/tree_spec.rb

@@ -0,0 +1,46 @@
+require 'spec_helper'
+
+describe Kruskal::Tree do
+  let(:forest) { Kruskal::Forest.new }
+
+  describe '#==' do
+    it 'compares content' do
+      t1 = forest.new_tree('a', 'b')
+      t2 = forest.new_tree('a', 'b')
+      t3 = forest.new_tree('a', 'c')
+
+      expect(t1).to eq t1
+      expect(t1).to eq t2
+      expect(t1).to_not eq t3
+    end
+
+    it 'compares with Array' do
+      t1 = forest.new_tree('a', 'b')
+
+      expect(t1).to eq [[0, 'a', 'b']]
+    end
+  end
+
+  describe '#hash' do
+    it 'is the same for same content' do
+      t1 = forest.new_tree('a', 'b')
+      t2 = forest.new_tree('a', 'b')
+      t3 = forest.new_tree('a', 'c')
+
+      expect(t1.hash).to eq t2.hash
+      expect(t1.hash).to_not eq t3.hash
+    end
+  end
+
+  describe 'merge!' do
+    it 'adds the content of one tree to the other' do
+      t1 = forest.new_tree('a', 'b')
+      t2 = forest.new_tree('b', 'c')
+
+      t1.merge!(t2)
+
+      expect(t1).to include [0, 'a', 'b']
+      expect(t1).to include [0, 'b', 'c']
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1 @@
+require 'kruskal'

metadata

@@ -0,0 +1,113 @@
+--- !ruby/object:Gem::Specification
+name: kruskal
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Ronie Uliana
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-05-05 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: json
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.8'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.8'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.6'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.6'
+- !ruby/object:Gem::Dependency
+  name: guard-rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4.2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4.2'
+description: Graph Minimum Spanning Tree implementation using a variation of Kruskal
+  algorithm. Intended to be used directly from command line or as a lib.
+email:
+- ronie.uliana@gmail.com
+executables:
+- kruskal
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".ruby-gemset"
+- ".ruby-version"
+- Gemfile
+- Guardfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/kruskal
+- kruskal.gemspec
+- lib/..rb
+- lib/kruskal.rb
+- lib/kruskal/forest.rb
+- lib/kruskal/json_io.rb
+- lib/kruskal/minimum_spanning_tree.rb
+- lib/kruskal/tree.rb
+- lib/kruskal/version.rb
+- spec/lib/kruskal/json_io_spec.rb
+- spec/lib/kruskal/minimum_spanning_tree_spec.rb
+- spec/lib/kruskal/tree_spec.rb
+- spec/spec_helper.rb
+homepage: http://github.com/ruliana/kruskal
+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.2.2
+signing_key: 
+specification_version: 4
+summary: Kruskal Minimum Spanning Tree algorithm
+test_files:
+- spec/lib/kruskal/json_io_spec.rb
+- spec/lib/kruskal/minimum_spanning_tree_spec.rb
+- spec/lib/kruskal/tree_spec.rb
+- spec/spec_helper.rb