boggle_solver 0.0.1 → 0.0.2

data/boggle_solver.gemspec

@@ -3,7 +3,7 @@ Gem::Specification.new do |s|
   s.summary       = "Find all words in a letter matrix"
   s.description   = "File.read(File.join(File.dirname(__FILE__), 'README'))"
   s.requirements  = "[ 'An installed dictionary (most Unix systems have one)']"
-  s.version       = "0.0.1"
+  s.version       = "0.0.2"
   s.author        = "Casey Robinson"
   s.email         = "kc@rampantmonkey.com"
   s.homepage      = "http://rampantmonkey.com"

data/lib/boggle_solver/adjacency_matrix.rb

@@ -1,6 +1,7 @@
 module BoggleSolver
 
   class AdjacencyMatrix
+    attr_reader :visited, :finished
 
     def initialize( n = 2 )
       @m = Array.new(n, 0)
@@ -42,7 +43,6 @@ module BoggleSolver
 
     def depth_first_search_visit(u, *)
       @visited[u] = 1
-      puts u
       adjacent(u).each { |v| depth_first_search_visit(v) if @visited[v].nil?}
       @finished[u] = 1
     end

data/lib/boggle_solver/options.rb

@@ -0,0 +1,6 @@
+require 'optparse'
+
+module Anagram
+  class Options
+
+    DEFAULT_DICTIONARY = "/usr/share/dict/words"

data/test/test_adjacency_matrix.rb

@@ -0,0 +1,93 @@
+require 'test/unit'
+require 'shoulda'
+require_relative '../lib/boggle_solver/adjacency_matrix'
+
+class TestAdjacencyMatrix < Test::Unit::TestCase
+
+  context "basics" do
+    setup do
+      @matrix = BoggleSolver::AdjacencyMatrix.new(4)
+    end
+
+    should "print matrix as square" do
+      assert_equal "0 0 0 0 \n0 0 0 0 \n0 0 0 0 \n0 0 0 0 ", @matrix.to_s
+    end
+  end
+
+  context "directed edges" do
+    setup do
+      @matrix = BoggleSolver::AdjacencyMatrix.new(4)
+    end
+
+    should "add one directed edge from v1 to v3" do
+      @matrix.add_directed_edge(1,3)
+      assert_equal "0 0 0 0 \n0 0 0 1 \n0 0 0 0 \n0 0 0 0 ", @matrix.to_s
+    end
+
+    should "add weighted directed edge from v3 to v1" do
+      @matrix.add_directed_edge(3,1, 7)
+      assert_equal "0 0 0 0 \n0 0 0 0 \n0 0 0 0 \n0 7 0 0 ", @matrix.to_s
+    end
+
+    should "store multiple directed edges" do
+      @matrix.add_directed_edge(2,1)
+      @matrix.add_directed_edge(3,1)
+      @matrix.add_directed_edge(0,3)
+      assert_equal "0 0 0 1 \n0 0 0 0 \n0 1 0 0 \n0 1 0 0 ", @matrix.to_s
+    end
+  end
+
+  context "undirected edges" do
+    setup do
+      @matrix = BoggleSolver::AdjacencyMatrix.new(4)
+    end
+
+    should "add undirected edge between v0 and v2" do
+      @matrix.add_edge(0,2)
+      assert_equal "0 0 1 0 \n0 0 0 0 \n1 0 0 0 \n0 0 0 0 ", @matrix.to_s
+    end
+
+    should "add weighted undirected edge between v0 and v2" do
+      @matrix.add_edge(0,2,8)
+      assert_equal "0 0 8 0 \n0 0 0 0 \n8 0 0 0 \n0 0 0 0 ", @matrix.to_s
+    end
+  end
+
+  context "adjacent" do
+    setup do
+      @n = 5
+      @matrix = BoggleSolver::AdjacencyMatrix.new(@n)
+    end
+
+    should "return empty array since no edges have been added" do
+      (0...@n).each { |i| assert_equal [], @matrix.adjacent(i)}
+    end
+
+    should "add 3 edges" do
+      @matrix.add_edge(0,1)
+      @matrix.add_edge(0,2)
+      @matrix.add_edge(0,4)
+      assert_equal [1,2,4], @matrix.adjacent(0)
+      assert_equal [0], @matrix.adjacent(1)
+      assert_equal [0], @matrix.adjacent(2)
+      assert_equal [], @matrix.adjacent(3)
+      assert_equal [0], @matrix.adjacent(4)
+    end
+  end
+
+  context "depth first search" do
+    setup do
+      @n = 5
+      @matrix = BoggleSolver::AdjacencyMatrix.new(@n)
+      @matrix.depth_first_search
+    end
+
+    should "visit all verticies" do
+      (0...@n).each { |i| assert_not_nil @matrix.visited[i] }
+    end
+
+    should "finish all verticies" do
+      (0...@n).each { |i| assert_not_nil @matrix.finished[i] }
+    end
+  end
+end

data/test/test_board.rb

@@ -0,0 +1 @@
+

metadata

@@ -1,15 +1,15 @@
 --- !ruby/object:Gem::Specification
 name: boggle_solver
 version: !ruby/object:Gem::Version
-  prerelease:
-  version: 0.0.1
+  version: 0.0.2
+  prerelease: 
 platform: ruby
 authors:
 - Casey Robinson
-autorequire:
+autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-05-15 00:00:00.000000000Z
+date: 2012-05-15 00:00:00.000000000 Z
 dependencies: []
 description: File.read(File.join(File.dirname(__FILE__), 'README'))
 email: kc@rampantmonkey.com
@@ -18,37 +18,41 @@ executables:
 extensions: []
 extra_rdoc_files: []
 files:
+- bin/boggle_solver
 - boggle_solver-0.0.1.gem
 - boggle_solver.gemspec
-- README.markdown
-- bin/boggle_solver
 - lib/boggle_solver/adjacency_matrix.rb
 - lib/boggle_solver/board.rb
+- lib/boggle_solver/options.rb
 - lib/boggle_solver/runner.rb
+- README.markdown
+- test/test_adjacency_matrix.rb
+- test/test_board.rb
 homepage: http://rampantmonkey.com
 licenses: []
-post_install_message:
+post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '1.9'
-  none: false
 required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
-  none: false
 requirements:
 - ! '[ ''An installed dictionary (most Unix systems have one)'']'
-rubyforge_project:
-rubygems_version: 1.8.15
-signing_key:
+rubyforge_project: 
+rubygems_version: 1.8.22
+signing_key: 
 specification_version: 3
 summary: Find all words in a letter matrix
-test_files: []
-...
+test_files:
+- test/test_adjacency_matrix.rb
+- test/test_board.rb