dlx 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 71a827908e5e0e0f08c2dca9ea7eb683a10a4336
+  data.tar.gz: f91dcd989098989f8b9a9289d27b5161212d4256
+SHA512:
+  metadata.gz: 0b815cb9731854dd12c7c566bb00f3769391e285197c58fe5d334a34b9228604030176e74ba70e73500c3a866c7370c3a224a738304e7d0801e9357e9609dfae
+  data.tar.gz: 05d6cd7fa985ce6d79924bd4b50aa191cb2203415026e988d249523deb7a96b77240fb0e8a6845a2ba0b2ebb9e6813b9870dc59c8baaec558c29b4b84c937a60

data/lib/dlx/header.rb

@@ -0,0 +1,39 @@
+require_relative 'node'
+
+module Dlx
+  class Header < Node
+
+    attr_accessor :total
+
+    def initialize(row, col, *args)
+      super(row, col, self, *args)
+      @total = 0
+    end
+
+    # Adds a node to the bottom of Header's column.
+    def add(node)
+      @total += 1
+      u = self.up
+
+      up.down = node
+      node.up = up
+
+      node.down = self
+      self.up = node
+
+      self
+    end
+
+    def remove(type)
+      simple_remove(type)
+    end
+
+    def restore(type)
+      simple_restore(type)
+    end
+
+    def to_s
+      "Header[#{row}][#{col}]"
+    end
+  end
+end

data/lib/dlx/node.rb

@@ -0,0 +1,64 @@
+module Dlx
+  class Node
+    attr_reader :row, :col, :header
+    attr_accessor :up, :right, :down, :left
+
+    def initialize(row, col, header, up = self, right = self, down = self, left = self)
+      @row, @col = row, col
+      @header = header
+      @up, @right, @down, @left = up, right, down, left
+    end
+
+    def link(nodes)
+      nodes.each_pair { |dir, node| send("#{dir}=", node) }
+    end
+
+    def remove(type)
+      header.total -= 1 if type == :column
+      simple_remove(type)
+    end
+
+    def restore(type)
+      header.total += 1 if type == :column
+      simple_restore(type)
+    end
+
+    # Traverses doubly linked list in the specified direction.
+    # Begins with yieding adjacent node, breaks _before_ yielding self.
+    def each_in(direction)
+      return enum_for(:each_in, direction) unless block_given?
+      node = self
+      until (node = node.send(direction)) == self do
+        yield node
+      end
+    end
+
+    def to_s
+      "Node[#{row}][#{col}]"
+    end
+
+    private
+
+    def simple_remove(type)
+      case type
+      when :row
+        left.right = right
+        right.left = left
+      when :column
+        up.down = down
+        down.up = up
+      end
+    end
+
+    def simple_restore(type)
+      case type
+      when :row
+        left.right = self
+        right.left = self
+      when :column
+        up.down = self
+        down.up = self
+      end
+    end
+  end
+end

data/lib/dlx/sparse_matrix.rb

@@ -0,0 +1,128 @@
+require_relative 'header'
+require_relative 'node'
+
+module Dlx
+  class SparseMatrix
+    attr_reader :root, :width, :height, :headers
+
+    def initialize
+      @root = Dlx::Header.new(0, -1)
+      @string_rows = Array.new
+      @width = @height = 0
+      @headers = Array.new
+    end
+
+    def <<(string)
+      add(string)
+    end
+
+    def add(string)
+      raise ArgumentError, "Empty string" if string.empty?
+      if @width == 0
+        @width = string.length
+        create_headers
+      elsif string.length != @width
+        raise ArgumentError, "Width is: #{string.length}, expected: #{@width}"
+      end
+
+      row = []
+      string.scan(/./).zip(@headers).each do |l, header|
+        if l == "1"
+          node = Dlx::Node.new(@height, header.col, header)
+          row << node
+          header.add(node)
+        end
+      end
+
+      link_row(row)
+
+      @string_rows << string
+      @height += 1
+      self
+    end
+
+    def create_headers
+      @width.times do |col|
+        @headers << Dlx::Header.new(0, col)
+      end
+      link_row(@headers)
+      @root.right = @headers.first
+      @root.right.left = @root
+      @root.left = @headers.last
+      @root.left.right = @root
+    end
+
+    def link_row(row)
+      row_length = row.length
+      row.each_with_index do |node, i|
+        node.link({ right: row[(i+1) % row_length],
+                    left:  row[(i-1) % row_length]})
+      end
+    end
+
+    def rows
+      @string_rows
+    end
+
+    def solve(&block)
+      if block
+        search(0, [], &block)
+      else
+        solutions = Array.new
+        search(0, []) { |solution| solutions << solution }
+        solutions
+      end
+    end
+
+    # Returns header with least total.
+    def next_header
+      min_header = nil
+      @root.each_in(:right) do |header|
+        if !min_header || header.total < min_header.total
+          min_header = header
+        end
+      end
+      min_header
+    end
+
+    # Removes given node's column from matrix. Removes each node in same row as
+    # given node from their columns
+    def cover(node)
+      node.header.remove(:row)
+      node.header.each_in(:down) do |row|
+        row.each_in(:right) { |n| n.remove(:column) }
+      end
+    end
+
+    # Reverses cover.
+    def uncover(node)
+      node.header.each_in(:up) do |row|
+        row.each_in(:left) { |n| n.restore(:column) }
+      end
+      node.header.restore(:row)
+    end
+
+    private
+
+    def search(n, solution, &b)
+      if next_header.nil?
+        b.call(solution.dup)
+      else
+        header = next_header
+        cover(header)
+
+        header.each_in(:down) do |rowNode|
+          solution.push(@string_rows[rowNode.row])
+
+          rowNode.each_in(:right) { |rightNode| cover(rightNode) }
+
+          search(n + 1, solution, &b)
+          solution.pop
+
+          rowNode.each_in(:left) { |leftNode| uncover(leftNode) }
+        end
+        uncover(header)
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,89 @@
+--- !ruby/object:Gem::Specification
+name: dlx
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Sam Davis
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-07-23 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Dancing Links - Finding all solutions to the exact cover problem
+email:
+- sam@samgd.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/dlx/header.rb
+- lib/dlx/node.rb
+- lib/dlx/sparse_matrix.rb
+homepage: https://github.com/samgd/dlx
+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: []
+rubyforge_project: 
+rubygems_version: 2.4.5
+signing_key: 
+specification_version: 4
+summary: Dancing Links
+test_files: []