victory 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: a5e64928d031b6be133644fd849867f1d46e75f7e0108be66a67cf467c0f9c9a
-  data.tar.gz: d3c34f8ce085866f68156fcd74511e4cbf291a45bccb9806d97cbbea31c0a61d
+  metadata.gz: b16cdc713345fce798e6fc148c348cac1b0f0d0e0e108c9fa5d57f6ea1c287af
+  data.tar.gz: 8ea12344ad30454d80bf0117ed4473fe760f7cbd30aac7731e0d6fc9d5f81696
 SHA512:
-  metadata.gz: ddf907234d226d92f3c8ff17718d7815b29867a65bcb2c80421b875d5d2f66d90078257c67fd38df838c38b49e983b7b4448a347873220ccb22ca90d309add98
-  data.tar.gz: c1571c770798a8f97b1ae258876a5913c20c26d6cd66035ee2e9666407811005ef93b54bcd6163938965f24babf5d05c0f407ca34502d5f57e6764c59e6b3f7c
+  metadata.gz: 674bec3c86ced7d31427151b8988970c0f7cf79d061f0c1a3c28f7ee5474ffd8db4694b2125ed4d26131ce869e16f1db0e897526a5db62f3b597bb9dda9ca9b5
+  data.tar.gz: e4b93c1c9809b4c094f847392d9b4caf08277afb9dcacfe1c166c513bbd5991a025800f54d0d48fe10a7f1d63878cbf827636c47189433882802dd7f399dbaeb

data/USAGE.md

@@ -10,6 +10,7 @@ In this markdown you will see the usage of all the datastructures and algorithms
 * [Struct](#struct)
 * [OpenStruct](#openstruct)
 * [Tuple](#tuple)
+* [Graph](#graph)
 
 <a name="array" />
 
@@ -137,6 +138,8 @@ x
 # => #<OpenStruct a=0, b=123>
 ```
 
+For the following datastructures you will need to include `Containers` or prefix every container with it. 
+
 <a name="tuple" />
 
 ## Tuple
@@ -153,6 +156,24 @@ t[2]
 # => 2
 ```
 
+<a name="graph" />
+
+## Graph
+
+### Graph (undirected)
+```ruby
+g = Graph[1,2, 2,3, 2,4]
+g.to_s
+# => "(1=2)(2=3)(2=4)"
+```
+
+### Directed Graph
+```ruby
+dg = DirectedGraph[1,2 ,2,3 ,2,4, 4,5, 6,4, 1,6]
+dg.to_s
+# => "(1-2)(1-6)(2-3)(2-4)(4-5)(6-4)"
+```
+
 # Other useful links
 
 * https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/

data/lib/containers/list.rb

@@ -1,81 +1,83 @@
-class List
-  Node = Struct.new(:data, :prev, :next)
-  def initialize
-    @first = nil
-    @last = nil
-  end
-
-  def self.[](*arr)
-    from_a(arr)
-  end
+module Containers
+  class List
+    Node = Struct.new(:data, :prev, :next)
+    def initialize
+      @first = nil
+      @last = nil
+    end
 
-  def self.from_a(arr)
-    l = new
-    arr.each(&l.method(:push_front))
-    l
-  end
+    def self.[](*arr)
+      from_a(arr)
+    end
 
-  def empty?
-    @first == @last && @first.nil?
-  end
+    def self.from_a(arr)
+      l = new
+      arr.each(&l.method(:push_front))
+      l
+    end
 
-  def push_front(element)
-    node = Node.new(element, nil, @first)
-    if @first.nil?
-      @last = node
-    else
-      @first.prev = node
+    def empty?
+      @first == @last && @first.nil?
     end
-    @first = node
-  end
 
-  def pop_front
-    to_return = @first&.data
-    unless @first.nil?
-      @first = @first.next
+    def push_front(element)
+      node = Node.new(element, nil, @first)
       if @first.nil?
-        @last = nil
+        @last = node
       else
-        @first.prev = nil unless @first.nil?
+        @first.prev = node
       end
+      @first = node
     end
-    to_return
-  end
 
-  def push_back(element)
-    node = Node.new(element, @last, nil)
-    if @last.nil?
-      @first = node
-    else
-      @last.next = node
+    def pop_front
+      to_return = @first&.data
+      unless @first.nil?
+        @first = @first.next
+        if @first.nil?
+          @last = nil
+        else
+          @first.prev = nil unless @first.nil?
+        end
+      end
+      to_return
     end
-    @last = node
-  end
 
-  def pop_back
-    to_return = @last&.data
-    unless @last.nil?
-      @last = @last.prev
+    def push_back(element)
+      node = Node.new(element, @last, nil)
       if @last.nil?
-        @first = nil
+        @first = node
       else
-        @last.next = nil unless @last.nil?
+        @last.next = node
       end
+      @last = node
     end
-    to_return
-  end
 
-  def peek_front
-    @first&.data
-  end
+    def pop_back
+      to_return = @last&.data
+      unless @last.nil?
+        @last = @last.prev
+        if @last.nil?
+          @first = nil
+        else
+          @last.next = nil unless @last.nil?
+        end
+      end
+      to_return
+    end
 
-  def peek_back
-    @last&.data
-  end
+    def peek_front
+      @first&.data
+    end
 
-  alias push push_back
-  alias pop pop_back
-  alias unshift push_front
-  alias shift pop_front
-end
-L = List
+    def peek_back
+      @last&.data
+    end
+
+    alias push push_back
+    alias pop pop_back
+    alias unshift push_front
+    alias shift pop_front
+  end
+  L = List
+end

data/lib/containers/prefix_tree.rb

@@ -1,61 +1,61 @@
-require 'containers/list'
-
-class PrefixTree
-  class Node
-    attr_accessor :data, :children
+module Containers
+  class PrefixTree
+    class Node
+      attr_accessor :data, :children
+
+      def initialize
+        @data = nil
+        @children = {}
+      end
+    end
 
     def initialize
-      @data = nil
-      @children = {}
+      @root = Node.new
     end
-  end
 
-  def initialize
-    @root = Node.new
-  end
-
-  def <<(str, value = true)
-    insert(str, value)
-  end
+    def <<(str, value = true)
+      insert(str, value)
+    end
 
-  def insert(str, value = true)
-    current = @root
-    str.each_char do |c|
-      current.children[c] = Node.new if current.children[c].nil?
-      current = current.children[c]
+    def insert(str, value = true)
+      current = @root
+      str.each_char do |c|
+        current.children[c] = Node.new if current.children[c].nil?
+        current = current.children[c]
+      end
+      current.data = value
     end
-    current.data = value
-  end
 
-  def [](str)
-    find(str)
-  end
+    def [](str)
+      find(str)
+    end
 
-  def find(str)
-    current = @root
-    str.each_char do |c|
-      return nil if current.children[c].nil?
+    def find(str)
+      current = @root
+      str.each_char do |c|
+        return nil if current.children[c].nil?
 
-      current = current.children[c]
+        current = current.children[c]
+      end
+      current.data
     end
-    current.data
-  end
 
-  def count_partial(str)
-    current = @root
-    str.each_char do |c|
-      return 0 if current.children[c].nil?
+    def count_partial(str)
+      current = @root
+      str.each_char do |c|
+        return 0 if current.children[c].nil?
 
-      current = current.children[c]
-    end
-    stack = List.new
-    count = 0
-    current.children.each_value(&stack.method(:push))
-    until stack.empty?
-      current = stack.pop
-      count += 1 unless current.data.nil?
+        current = current.children[c]
+      end
+      stack = List.new
+      count = 0
       current.children.each_value(&stack.method(:push))
+      until stack.empty?
+        current = stack.pop
+        count += 1 unless current.data.nil?
+        current.children.each_value(&stack.method(:push))
+      end
+      count
     end
-    count
   end
 end

data/lib/containers/tuple.rb

@@ -1,20 +1,26 @@
-class Tuple
-  @elements = []
-  def self.[](*elements)
-    new(elements)
-  end
+module Containers
+  class Tuple
+    @elements = []
+    def self.[](*elements)
+      new(elements)
+    end
 
-  def initialize(elements)
-    @elements = elements
-  end
+    def initialize(elements)
+      @elements = elements
+    end
 
-  def [](idx)
-    @elements[idx]
-  end
+    def [](idx)
+      @elements[idx]
+    end
+
+    def to_a
+      @elements.to_a
+    end
 
-  def to_a
-    @elements.to_a
+    def to_s
+      "(#{@elements.join(',')})"
+    end
   end
-end
 
-T = Tuple
+  T = Tuple
+end

data/lib/include_rgl.rb

@@ -0,0 +1,29 @@
+require 'rgl/adjacency'
+require 'rgl/base'
+require 'rgl/bellman_ford'
+require 'rgl/bidirectional'
+require 'rgl/bipartite'
+require 'rgl/condensation'
+require 'rgl/connected_components'
+require 'rgl/dijkstra'
+require 'rgl/dijkstra_visitor'
+require 'rgl/dot'
+require 'rgl/edge_properties_map'
+require 'rgl/edmonds_karp'
+require 'rgl/graph_iterator'
+require 'rgl/graph_visitor'
+require 'rgl/graph_wrapper'
+require 'rgl/graphxml'
+require 'rgl/implicit'
+require 'rgl/mutable'
+require 'rgl/path_builder'
+require 'rgl/prim'
+require 'rgl/rdot'
+require 'rgl/topsort'
+require 'rgl/transitiv_closure'
+require 'rgl/transitivity'
+require 'rgl/traversal'
+
+Containers::Graph = RGL::AdjacencyGraph
+Containers::DirectedGraph = RGL::DirectedAdjacencyGraph
+Containers::ImplicitGraph = RGL::ImplicitGraph

data/lib/victory/version.rb

@@ -1,3 +1,3 @@
 module Victory
-  VERSION = "0.0.3"
+  VERSION = "0.0.4"
 end

data/victory.gemspec

@@ -39,5 +39,6 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency 'rake', '~> 10.0'
   spec.add_development_dependency 'rake-compiler'
   spec.add_development_dependency 'require_all'
+  spec.add_development_dependency 'rgl', '~> 0.5.4'
   spec.add_development_dependency 'rspec'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: victory
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Arnold Szederjesi
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2019-03-13 00:00:00.000000000 Z
+date: 2019-03-16 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -80,6 +80,20 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: rgl
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.5.4
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.5.4
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
@@ -151,6 +165,7 @@ files:
 - lib/containers/suffix_array.rb
 - lib/containers/trie.rb
 - lib/containers/tuple.rb
+- lib/include_rgl.rb
 - lib/victory.rb
 - lib/victory/version.rb
 - victory.gemspec