ruby_structures 2.4.0 → 2.5.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA256:
-  metadata.gz: 8a9f58e9e0fb04f0a297238643bc9ea12408a8b81e7ee3f962ecb34b30e4c410
-  data.tar.gz: cdcd58cb09e29f012ded1af3a8dd1cb839343cc7c39f5810ec0b5d4c42c32ffa
+SHA1:
+  metadata.gz: d9595ecd23f26afb21d717b31f2620c8d7b44b8a
+  data.tar.gz: 1d108a896a40f3401136c5e38c72bf2d5725488a
 SHA512:
-  metadata.gz: 02c69ae62556ae04a058e5bc8d03e2db59cfb46e72b62717db46b1e7a2e44230f72e22dd05e8c4870dd1f946e71c0adf0605933bdcbe60f44bedc9ce58cdd2d8
-  data.tar.gz: fac9c9fcc1c6da0ffc1d7d43f1cfe1d6bd2b25c28d61a38707c6eea3a03b5279b327443b47a7d3f462b1410e1f8ce9d4fa719d01c0d91d28379584f6496f586d
+  metadata.gz: 0c692328d3fa5f6dc0d8772a0ee0bbc1dd823a894a0ce62c48582aa2fbd6231969a415483e4e32a019b6855af069c715c4c02a2a4dff50ae8703bb53560b807e
+  data.tar.gz: 21cd8059926f31e911d7cae202d56a01820bfd2c17f303df5338ca6088f662e9778fc3d413f975940d85d4546639748a9dcb95f2c434ee2b434a9384998d106d

data/lib/data_structures/directed_graph.rb

@@ -0,0 +1,11 @@
+require_relative 'graph'
+
+class DirectedGraph < Graph
+  def create_edge(origin_id, end_id)
+    @adjacency_list[origin_id].add(end_id)
+  end
+
+  def delete_edge(origin_id, end_id)
+    @adjacency_list[origin_id].delete(end_id)
+  end
+end

data/lib/data_structures/graph.rb

@@ -0,0 +1,98 @@
+require 'set'
+
+class Graph
+  def initialize
+    @adjacency_list = Hash.new { |h, k| h[k] = Set.new }
+  end
+
+  def [](id)
+    @adjacency_list[id]
+  end
+
+  def add_vertex(id)
+    raise RuntimeError.new("#{id} is already a Vertex") if @adjacency_list.include?(id)
+    @adjacency_list[id]
+  end
+
+  def delete_vertex(id)
+    raise RuntimeError.new("#{id} is not a Vertex") unless @adjacency_list.include?(id)
+    @adjacency_list.delete(id)
+  end
+
+  def create_edge(id1, id2)
+    raise RuntimeError.new("#{id1} is not a Vertex") unless @adjacency_list.include?(id1)
+    raise RuntimeError.new("#{id2} is not a Vertex") unless @adjacency_list.include?(id2)
+    @adjacency_list[id1].add(id2)
+    @adjacency_list[id2].add(id1)
+  end
+
+  def delete_edge(id1, id2)
+    raise RuntimeError.new("#{id1} is not a Vertex") unless @adjacency_list.include?(id1)
+    raise RuntimeError.new("#{id1} is not connected to #{id2}") unless @adjacency_list[id1].include?(id2)
+    @adjacency_list[id1].delete(id2)
+    @adjacency_list[id2].delete(id1)
+  end
+
+  def adjacent?(id1, id2)
+    raise RuntimeError.new("#{id1} is not a Vertex") unless @adjacency_list.include?(id1)
+    raise RuntimeError.new("#{id2} is not a Vertex") unless @adjacency_list.include?(id2)
+    @adjacency_list[id1].include?(id2)
+  end
+
+  def adjacent_vertices(id)
+    raise RuntimeError.new("#{id} is not a Vertex") unless @adjacency_list.include?(id)
+    @adjacency_list[id]
+  end
+
+  def depth_first_search(target_id=nil, start_id=nil, &prc)
+    raise ArgumentError.new('Must pass either a target value or a block') unless (target_id || prc) && !(target_id && prc)
+    prc ||= Proc.new { |vertex| vertex == target_id }
+
+    return false if @adjacency_list.empty?
+    current_vertex = start_id || @adjacency_list.first.first
+    @memo = Set.new unless start_id
+    @memo ||= Set.new
+
+    unless @memo.include?(current_vertex)
+      return true if prc.call(current_vertex)
+      @memo.add(current_vertex)
+    end
+
+    current_adjacency_list = @adjacency_list[current_vertex]
+    current_adjacency_list.each do |vertex|
+      if @memo.include?(vertex)
+        next
+      else
+        @memo.add(vertex)
+      end
+
+      return true if prc.call(vertex)
+      result = depth_first_search(nil, vertex, &prc)
+      return result if result
+    end
+
+    false
+  end
+
+  def breadth_first_search(target_id=nil, start_id=nil, &prc)
+    raise ArgumentError.new('Must pass either a target value or a block') unless (target_id || prc) && !(target_id && prc)
+    prc ||= Proc.new { |vertex| vertex == target_id }
+
+    return false if @adjacency_list.empty?
+    start_id ||= @adjacency_list.first.first
+    vertex_queue = [start_id]
+
+    memo = Set.new
+    until vertex_queue.empty?
+      current_vertex = vertex_queue.shift
+      return true if prc.call(current_vertex)
+
+      current_adjacency_list = @adjacency_list[current_vertex]
+
+      vertex_queue += current_adjacency_list.to_a.reject { |vertex| memo.include?(vertex) }
+      memo.add(current_vertex)
+    end
+
+    false
+  end
+end

data/lib/data_structures/heap.rb

@@ -15,6 +15,16 @@ class Heap
     @store = []
   end
 
+  def to_a
+    arr = []
+    copy = self.dup
+    copy.instance_variable_set(:@store, @store.dup)
+    until copy.empty?
+      arr << copy.extract
+    end
+    arr
+  end
+
   def to_s
     "Heap: head=#{self.peek || 'nil'}, length=#{self.length}"
   end

data/lib/data_structures/weighted_directed_graph.rb

@@ -0,0 +1,11 @@
+require_relative 'weighted_graph'
+
+class WeightedDirectedGraph < WeightedGraph
+  def create_edge(origin_id, end_id, weight)
+    @adjacency_list[origin_id][end_id] = weight
+  end
+
+  def delete_edge(origin_id, end_id)
+    @adjacency_list[origin_id].delete(end_id)
+  end
+end

data/lib/data_structures/weighted_graph.rb

@@ -0,0 +1,71 @@
+class WeightedGraph
+  def initialize
+    @adjacency_list = Hash.new { |h, k| h[k] = {} }
+  end
+
+  def [](id)
+    @adjacency_list[id]
+  end
+
+  def add_vertex(id)
+    @adjacency_list[id]
+  end
+
+  def delete_vertex(id)
+    @adjacency_list.delete(id)
+  end
+
+  def create_edge(id1, id2, weight)
+    @adjacency_list[id1][id2] = weight
+    @adjacency_list[id2][id1] = weight
+  end
+
+  def delete_edge(id1, id2)
+    @adjacency_list[id1].delete(id2)
+    @adjacency_list[id2].delete(id1)
+  end
+
+  def adjacent?(id1, id2)
+    raise RuntimeError.new("#{id1} is not a Vertex") unless @adjacency_list.include?(id1)
+    raise RuntimeError.new("#{id2} is not a Vertex") unless @adjacency_list.include?(id2)
+    @adjacency_list[id1].include?(id2)
+  end
+
+  def adjacent_vertices(id)
+    raise RuntimeError.new("#{id} is not a Vertex") unless @adjacency_list.include?(id)
+    @adjacency_list[id]
+  end
+
+  def highest_weight_adjacent(id)
+    adjacent_vertices = self.adjacent_vertices(id)
+    return nil if adjacent_vertices.empty?
+
+    highest = nil
+    highest_weight = nil
+    adjacent_vertices.each do |vertex, weight|
+      if highest_weight == nil || weight > highest_weight
+        highest = vertex
+        highest_weight = weight
+      end
+    end
+
+    highest
+  end
+
+  def lowest_weight_adjacent(id)
+    adjacent_vertices = self.adjacent_vertices(id)
+    return nil if adjacent_vertices.empty?
+
+    lowest = nil
+    lowest_weight = nil
+    adjacent_vertices.each do |vertex, weight|
+      if lowest_weight == nil || weight < lowest_weight
+        lowest = vertex
+        lowest_weight = weight
+      end
+    end
+
+    lowest
+  end
+
+end

data/lib/ruby_structures.rb

@@ -5,3 +5,7 @@ require 'data_structures/binary_tree'
 require 'data_structures/lru_cache'
 require 'data_structures/heap'
 require 'data_structures/priority_queue'
+require 'data_structures/graph'
+require 'data_structures/directed_graph'
+require 'data_structures/weighted_graph'
+require 'data_structures/weighted_directed_graph'

metadata

@@ -1,29 +1,33 @@
 --- !ruby/object:Gem::Specification
 name: ruby_structures
 version: !ruby/object:Gem::Version
-  version: 2.4.0
+  version: 2.5.0
 platform: ruby
 authors:
 - Jason Numeroff
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-05-12 00:00:00.000000000 Z
+date: 2018-05-17 00:00:00.000000000 Z
 dependencies: []
 description: Ruby implementations of a Stack, Queue, Linked List, Binary Tree, LRU
-  Cache, Heap and Priority Queue. More to come!
+  Cache, Heap, Priority Queue, Graph and Weighted Graph. More to come!
 email: jnumeroff@hotmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - lib/data_structures/binary_tree.rb
+- lib/data_structures/directed_graph.rb
+- lib/data_structures/graph.rb
 - lib/data_structures/heap.rb
 - lib/data_structures/linked_list.rb
 - lib/data_structures/lru_cache.rb
 - lib/data_structures/priority_queue.rb
 - lib/data_structures/queue.rb
 - lib/data_structures/stack.rb
+- lib/data_structures/weighted_directed_graph.rb
+- lib/data_structures/weighted_graph.rb
 - lib/ruby_structures.rb
 homepage: https://github.com/Numie/RubyStructures
 licenses:
@@ -45,7 +49,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.7.3
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
 summary: Ruby Data Structures