adt_utilit 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 5e8ee1f39f314d0f7ca04f595bd4b474d361aa2f
-  data.tar.gz: 9e26d7ba45ad54ddb0bff7b5f4860e146957a415
+  metadata.gz: 24a8c1885ed5a72b48d7407890a5ba8258eddb41
+  data.tar.gz: 91762ad975b58dd73ad3e817b832a39d9946f778
 SHA512:
-  metadata.gz: e13664fee3e3cfcf5b2587d966accf1f2c7ab520d921109a161fae1f57098a2c57b1389c6a35994866713f10955890497afab20353b547f15030dcadc7a47a3f
-  data.tar.gz: cf2dfcd78512d7de2110ab393c3acb621a5d97b97deb12baa38d27c57af897c8e26bf3da5e9a8ad1f8290369855ef25ca8e86ea635e9641784ef74d39f798880
+  metadata.gz: 033d3b191e848a08d2aed9aee6880a23a8b85690d196b462a3f32ce0e28c79c871392d79a247dcbb8d89fbfc938923067e570a1e4c18401984878fcd1b9595a3
+  data.tar.gz: 5a962e15cdd3a06ab893465262e99a402ac5636b1a7f5c7c020de415f483426263d4b6aa229962ede029853cf68bdb76ed25ca7960bc1132d9a98969ad47ad1a

data/lib/adt_utilit.rb

@@ -1,5 +1,6 @@
 require 'adt_utilit/linked_list'
 require 'adt_utilit/stack_queue'
+require 'adt_utilit/binary_tree_node'
 
 class AdtUtilit
 

data/lib/adt_utilit/binary_tree_node.rb

@@ -0,0 +1,125 @@
+require_relative "graph_node"
+require 'byebug'
+
+class BinaryTreeNode < GraphNode
+  attr_reader :parent
+
+  protected
+  attr_writer :parent
+
+  public
+  def initialize(value)
+    super(value)
+  end
+
+  def left_child
+    @children[0]
+  end
+
+  def right_child
+    @children[1]
+  end
+
+  def connect(node)
+    if @children.length >= 2
+      raise "BinaryTreeNode can have only two children"
+    end
+    if node.children.include?(self)
+      raise "Undirected edges are not allowed in binary tree"
+    end
+    super(node)
+  end
+
+  # def switch(node)
+  #   unless self.children.include?(node)
+  #     raise "No parent-child relationship exists"
+  #   end
+  #   replace_idx = self.children.find_index(node)
+  #   self.children, node.children = node.children, self.children
+  #   node.children[replace_idx] = self
+  #
+  #   if self.parent.nil?
+  #     node.parent = nil
+  #   else
+  #     replace_idx = self.parent.children.find_index(self)
+  #     self.parent, node.parent = node, self.parent
+  #     node.parent.children[replace_idx] = node
+  #   end
+  #   node.children.each{|child| child.parent = node}
+  #   # debugger
+  # end
+
+  def filled?
+    !!(left_child && right_child)
+  end
+
+  def trav_in_order(search_value = nil, &prc)
+    if (search_value.nil? && !block_given?) || (search_value && block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    result = left_child ? left_child.trav_in_order(nil, &prc) : nil
+    return result unless result.nil?
+
+    result = prc.call(self.value) ? self : nil
+    return result unless result.nil?
+
+    result = right_child ? right_child.trav_in_order(nil, &prc) : nil
+    return result unless result.nil?
+
+    nil
+  end
+
+  def trav_pre_order(search_value = nil, &prc)
+    if (search_value.nil? && !block_given?) || (search_value && block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    result = prc.call(self.value) ? self : nil
+    return result unless result.nil?
+
+    result = left_child ? left_child.trav_pre_order(nil, &prc) : nil
+    return result unless result.nil?
+
+    result = right_child ? right_child.trav_pre_order(nil, &prc) : nil
+    return result unless result.nil?
+
+    nil
+  end
+
+  def trav_post_order(search_value = nil, &prc)
+    if (search_value.nil? && !block_given?) || (search_value && block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    result = left_child ? left_child.trav_post_order(nil, &prc) : nil
+    return result unless result.nil?
+
+    result = right_child ? right_child.trav_post_order(nil, &prc) : nil
+    return result unless result.nil?
+
+    result = prc.call(self.value) ? self : nil
+    return result unless result.nil?
+    nil
+  end
+
+  def _trav_right_first(search_value = nil, &prc)
+    if (search_value.nil? && !block_given?) || (search_value && block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    result = right_child ? right_child._trav_right_first(nil, &prc) : nil
+    return result unless result.nil?
+
+    result = left_child ? left_child._trav_right_first(nil, &prc) : nil
+    return result unless result.nil?
+
+    result = prc.call(self) ? self : nil
+    return result unless result.nil?
+    nil
+  end
+end

data/lib/adt_utilit/graph_node.rb

@@ -0,0 +1,96 @@
+require 'set'
+require 'byebug'
+class GraphNode
+  attr_reader :children, :value
+
+  protected
+  attr_writer :children
+
+  public
+  def initialize(value)
+    @value = value
+    @children = []
+  end
+
+  def connect(node)
+    @children << node
+  end
+
+  def remove(node)
+    result = @children.delete(node){nil}
+    result.nil? ? nil : node
+  end
+
+  def remove_all
+    @children = []
+  end
+
+  def dfs(search_value = nil, searched = Set.new, &prc)
+    if (search_value && block_given?) || (search_value.nil? && !block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    if prc.call(self.value)
+      return self
+    else
+      searched.add(self)
+    end
+
+    return nil if @children.empty?
+
+    @children.each do |child_node|
+      return nil if searched.include?(child_node)
+      result = child_node.dfs(nil, searched, &prc)
+      return result if !result.nil?
+      searched.add(child_node)
+    end
+    return nil
+  end
+
+  def bfs(search_value = nil, searched = Set.new, &prc)
+    if (search_value && block_given?) || (search_value.nil? && !block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    search_queue = [self]
+    until search_queue.empty?
+      node = search_queue.shift
+      return node if prc.call(node.value)
+      searched.add(node)
+
+      if node.children.length > 0
+        node.children.each do |child|
+          search_queue << child unless searched.include?(child)
+        end
+      end
+    end
+    return nil
+
+  end
+
+  def _bfs(search_value = nil, searched = Set.new, &prc)
+    if (search_value && block_given?) || (search_value.nil? && !block_given?)
+      raise "Wrong number of argument"
+    end
+    prc = Proc.new{ |val| val == search_value } if search_value
+
+    search_queue = [self]
+    until search_queue.empty?
+      node = search_queue.shift
+      return node if prc.call(node)
+      searched.add(node)
+
+      if node.children.length > 0
+        node.children.each do |child|
+          search_queue << child unless searched.include?(child)
+        end
+      end
+    end
+    return nil
+
+  end
+
+
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: adt_utilit
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Hirosvk
@@ -19,6 +19,8 @@ extensions: []
 extra_rdoc_files: []
 files:
 - lib/adt_utilit.rb
+- lib/adt_utilit/binary_tree_node.rb
+- lib/adt_utilit/graph_node.rb
 - lib/adt_utilit/linked_list.rb
 - lib/adt_utilit/linked_list_node.rb
 - lib/adt_utilit/queue.rb