algorithmable 0.1.0 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0dfae481af55f0814906035338566941f6fcfaa5
-  data.tar.gz: f26f40b975a6dee84e3139b28da2297b3021254f
+  metadata.gz: faa2cfc1ad0200b15adfbfa778a72b89d605e15f
+  data.tar.gz: 4b4a5326da1e136fb0513e35a29bae2b1171dfe0
 SHA512:
-  metadata.gz: 7a9e436a366de2922dfa888d82e46a9d2ebb18ff163f7fe11aa0181e1b640cad9df860a4358e01f98467bb1601730e77cc3f76fdc1ca8600e17cfe67fa515f20
-  data.tar.gz: 3438f7922c2cd0ec507a89289185d1121f0139933d89bd03abd3ba14137f338a254cc8cd16406a73d02c8440447368adcd47c3ceef8eea2bd89c8f05da957b7d
+  metadata.gz: 2a79e522c0901adb9fbbc434eb0dc760556ba27d932f8036d124ad6bce9e4145f77c4a1cae96c2dd5f806add3b5f5a94f7580d8597a79f96c65c05a7b8f37d7c
+  data.tar.gz: c22a35a53cf69acd26b10f5c127da3f6bc5e92ab053c795fa74877410c91b2bbcafc3b484fe9fa226ce10bf61093fab3851389ecb92e757259170bea0bd64603

data/README.md

@@ -1,6 +1,8 @@
+[![Build Status](https://travis-ci.org/rlishtaba/algorithmable.svg?branch=master)](https://travis-ci.org/rlishtaba/algorithmable)
+
 # Algorithmable
 
-Useful algorithms for everyday usage implemented using Ruby.
+Useful algorithms such as Sorting, Searches, Graph Traversal strategies & data structures such as Symbol Tables, BST, Hash Tables, Bag, Linked List, Queue, Stack, Graphs for everyday usage. Implemented using Ruby, for fun.
 
 ## Installation
 

data/lib/algorithmable.rb

@@ -5,6 +5,9 @@ require 'pathname'
 require 'English'
 
 module Algorithmable
+  autoload :Sort, 'algorithmable/sort'
+  autoload :Graphs, 'algorithmable/graphs'
+
   class << self
     def logger
       @logger ||= Logger.new $stdout

data/lib/algorithmable/graphs.rb

@@ -0,0 +1,16 @@
+module Algorithmable
+  module Graphs
+    autoload :Undirected, 'algorithmable/graphs/undirected'
+    autoload :Traversals, 'algorithmable/graphs/traversals'
+
+    class << self
+      def new_undirected_graph(vertices = [])
+        graph = Undirected.new(vertices.size)
+        vertices.each do |left, right|
+          graph.add_edge left, right
+        end
+        graph
+      end
+    end
+  end
+end

data/lib/algorithmable/graphs/traversals.rb

@@ -0,0 +1,13 @@
+module Algorithmable
+  module Graphs
+    module Traversals
+      autoload :Errors, 'algorithmable/graphs/traversals/errors'
+      autoload :DepthFirst, 'algorithmable/graphs/traversals/depth_first'
+      autoload :BreathFirst, 'algorithmable/graphs/traversals/breath_first'
+
+      def traverse_with_depth_first(graph, source)
+        DepthFirst.new(graph, source)
+      end
+    end
+  end
+end

data/lib/algorithmable/graphs/traversals/depth_first.rb

@@ -0,0 +1,44 @@
+module Algorithmable
+  module Graphs
+    module Traversals
+      class DepthFirst
+        include Algorithmable::Graphs::Traversals::Errors
+
+        def initialize(graph, source)
+          @visited = []
+          @edge_to = []
+          @source = source
+          traverse graph, source
+        end
+
+        def visited?(vertex)
+          @visited[vertex]
+        end
+
+        def path_to(vertex)
+          fail UnvisitedVertexError, vertex unless visited?(vertex)
+          path = []
+          finish = vertex
+          while finish != @source
+            path.push finish
+            finish = @edge_to[finish]
+          end
+          path.push @source
+          path
+        end
+
+        private
+
+        def traverse(graph, vertex)
+          @visited[vertex] = true
+          graph.adjacency(vertex).each do |neighbour_vertex|
+            unless visited? neighbour_vertex
+              @edge_to[neighbour_vertex] = vertex
+              traverse graph, neighbour_vertex
+            end
+          end
+        end
+      end
+    end
+  end
+end

data/lib/algorithmable/graphs/traversals/errors.rb

@@ -0,0 +1,10 @@
+module Algorithmable
+  module Graphs
+    module Traversals
+      module Errors
+        TraversalError = Class.new RuntimeError
+        UnvisitedVertexError = Class.new TraversalError
+      end
+    end
+  end
+end

data/lib/algorithmable/graphs/undirected.rb

@@ -0,0 +1,26 @@
+module Algorithmable
+  module Graphs
+    class Undirected
+      attr_reader :vertices, :edges
+
+      def initialize(vertices = 0)
+        @vertices = vertices
+        @edges = 0
+        @adj = []
+        @vertices.times { |i| @adj[i] = [] }
+      end
+
+      def add_edge(left_vertex, right_vertex)
+        @adj[left_vertex] ||= []
+        @adj[right_vertex] ||= []
+        @adj[left_vertex].push right_vertex
+        @adj[right_vertex].push left_vertex
+        @edges = @edges.next
+      end
+
+      def adjacency(vertex)
+        @adj[vertex]
+      end
+    end
+  end
+end

data/lib/algorithmable/sort.rb

@@ -0,0 +1,16 @@
+module Algorithmable
+  module Sort
+    autoload :Merge, 'algorithmable/sort/merge'
+    autoload :Bubble, 'algorithmable/sort/bubble'
+
+    class << self
+      def merge(collection)
+        Merge.sort(collection)
+      end
+
+      def bubble(collection)
+        Bubble.sort(collection)
+      end
+    end
+  end
+end

data/lib/algorithmable/sort/bubble.rb

@@ -0,0 +1,32 @@
+module Algorithmable
+  module Sort
+    class Bubble
+      def self.sort(collection)
+        new.sort(collection)
+      end
+
+      def sort(collection)
+        loop do
+          swapped = false
+          (collection.size.pred).times do |index|
+            if (collection[index] <=> collection[index.next]) == 1
+              collection = swap(index, collection)
+              swapped = true
+            end
+          end
+          break unless swapped
+        end
+        collection
+      end
+
+      private
+
+      def swap(index, collection)
+        current = collection[index]
+        collection[index] = collection[index.next]
+        collection[index.next] = current
+        collection
+      end
+    end
+  end
+end

data/lib/algorithmable/sort/merge.rb

@@ -0,0 +1,27 @@
+module Algorithmable
+  module Sort
+    class Merge
+      def self.sort(collection)
+        new.sort(collection)
+      end
+
+      def sort(collection)
+        return collection if collection.size <= 1
+        mid = collection.size / 2
+        left = collection[0...mid]
+        right = collection[mid...collection.size]
+        merge(sort(left), sort(right))
+      end
+
+      private
+
+      def merge(left, right)
+        sorted = []
+        until left.empty? || right.empty?
+          left.first <= right.first ? sorted << left.shift : sorted << right.shift
+        end
+        sorted + left + right
+      end
+    end
+  end
+end

data/lib/algorithmable/version.rb

@@ -1,3 +1,3 @@
 module Algorithmable
-  VERSION = '0.1.0'
+  VERSION = '0.3.0'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: algorithmable
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.3.0
 platform: ruby
 authors:
 - Roman Lishtaba
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-12-09 00:00:00.000000000 Z
+date: 2015-12-29 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -140,6 +140,14 @@ files:
 - algorithmable.gemspec
 - cucumber.yml
 - lib/algorithmable.rb
+- lib/algorithmable/graphs.rb
+- lib/algorithmable/graphs/traversals.rb
+- lib/algorithmable/graphs/traversals/depth_first.rb
+- lib/algorithmable/graphs/traversals/errors.rb
+- lib/algorithmable/graphs/undirected.rb
+- lib/algorithmable/sort.rb
+- lib/algorithmable/sort/bubble.rb
+- lib/algorithmable/sort/merge.rb
 - lib/algorithmable/version.rb
 - script/console
 homepage: ''