adjacency_list_builder 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c9ed6e680ef2fbb7f16b00aef327120f47d59d8a9196184e4a992aa32e956d9d
+  data.tar.gz: 160debc9b37559cbca6ea54d20671f92aa7ce2b43c4e95f1e4c265861281d0a4
+SHA512:
+  metadata.gz: 5ce0830fdacc3d560055f7ec6e4b64e10cd8589e9af84ed309a3be858c1bcc377d59a307e9b843d83e0ad57d6e6f7ca1b48590f1e027bc1d08d67248a1d93224
+  data.tar.gz: 030c357e53d3a048ebe80ad3835ab3fc6d24b5279f579721e8924a8b246d5a410f8cdfe6741878214daee8b869996096d1109c47171032262de578ce50a1a55f

data/lib/adjacency_list_builder/extended_integer.rb

@@ -0,0 +1,39 @@
+class AdjacencyListBuilder
+  class ExtendedInteger
+    def initialize(str)
+      @int = str.to_i
+    end
+
+    def options
+      @options ||= {}
+    end
+
+    def label=(label)
+      options[:label] = label
+    end
+
+    def label
+      options[:label]
+    end
+
+    def to_int
+      @int
+    end
+
+    def inspect
+      @int.inspect
+    end
+
+    def to_s
+      @int.to_s
+    end
+
+    def preview
+      "#{@int} => #{label}"
+    end
+
+    def method_missing(m, *args, &block)
+      @int.send(m, *args, &block)
+    end
+  end
+end

data/lib/adjacency_list_builder.rb

@@ -0,0 +1,37 @@
+require_relative 'adjacency_list_builder/extended_integer'
+
+class AdjacencyListBuilder
+  def initialize(n, graph_string)
+    @n = n # node count
+    @graph_string = graph_string
+    @adjacency_list = Array.new(n) { [] }
+  end
+
+  def call(directed: false)
+    parsed_graph_string.each do |tuple|
+      # first element is node number, second which element it connects, third is a numeric label
+      index, connected_with, num_label = tuple.map(&:to_i)
+
+      if connected_with
+        if num_label
+          connected_with = ExtendedInteger.new(connected_with)
+          connected_with.label = num_label
+        end
+        adjacency_list[index].push connected_with
+        adjacency_list[connected_with].push index unless directed
+      end
+    end
+
+    adjacency_list
+  end
+
+  private
+
+  attr_reader :n, :graph_string, :adjacency_list
+
+  def parsed_graph_string
+    @parsed_graph_string ||= graph_string.split("\n").map { |tuple| tuple.split(' ') }
+  end
+end
+
+

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: adjacency_list_builder
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Maciej Kempin
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2021-09-16 00:00:00.000000000 Z
+dependencies: []
+description: 'The string input can be generated here: https://csacademy.com/app/graph_editor/'
+email: maciej.kempin@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/adjacency_list_builder.rb
+- lib/adjacency_list_builder/extended_integer.rb
+homepage: 
+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: []
+rubygems_version: 3.1.2
+signing_key: 
+specification_version: 4
+summary: Build an adjacency list from given string
+test_files: []