gratr 0.4.2

data/tests/TestDigraphDistance.rb

@@ -0,0 +1,138 @@
+#--
+# Copyright (c) 2006 Shawn Patrick Garbett
+# 
+# Redistribution and use in source and binary forms, with or without modification,
+# are permitted provided that the following conditions are met:
+# 
+#     * Redistributions of source code must retain the above copyright notice(s),
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of the Shawn Garbett nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+# 
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#++
+
+
+require 'test/unit'
+require 'gratr/import'
+
+class TestDigraphDistance < Test::Unit::TestCase # :nodoc:
+
+  def setup  
+    @d = Digraph[ :a,:b, :a,:e,
+                  :b,:c, :b,:e,
+                  :c,:d,
+                  :d,:c,
+                  :e,:b, :e,:f,
+                  :f,:c, :f,:d, :f,:e ]
+  
+    @w = {  Arc[:a,:b] => 9,
+            Arc[:a,:e] => 3,
+            Arc[:b,:c] => 2,
+            Arc[:b,:e] => 6,
+            Arc[:c,:d] => 1,
+            Arc[:d,:c] => 2,
+            Arc[:e,:b] => 2,
+            Arc[:e,:f] => 1,
+            Arc[:f,:c] => 2,
+            Arc[:f,:d] => 7,
+            Arc[:f,:e] => 2  }
+    @a = {  :a => 0,
+            :b => 5,
+            :c => 6,
+            :d => 7,
+            :e => 3,
+            :f => 4   }
+    @simple_weight = Proc.new {|e| 1}            
+  end
+  
+  def test_shortest_path
+    x = Digraph[ :s,:u, :s,:w,
+                 :j,:v,
+                 :u,:j,
+                 :v,:y,
+                 :w,:u, :w,:v, :w,:y, :w,:x,
+                 :x,:z ]
+    assert x.acyclic?
+    cost, path = x.shortest_path(:s,@simple_weight)
+    assert_equal({:x=>2, :v=>2, :y=>2, :w=>1, :s=>0, :z=>3, :u=>1, :j=> 2}, cost)
+    assert_equal({:x=>:w, :v=>:w, :y=>:w, :w=>:s, :z=>:x, :u=>:s, :j=>:u},  path)
+  end
+  
+  def test_dijkstra_with_proc
+    p = Proc.new {|e| @w[e]}
+    distance, path = @d.dijkstras_algorithm(:a,p)
+    assert_equal @a, distance
+    assert_equal({ :d => :c,  :c => :f,  :f => :e,  :b => :e,  :e => :a}, path)
+  end
+  
+  def test_dijkstra_with_label
+    @w.keys.each {|e| @d[e] = @w[e]}
+    assert_equal @a, @d.dijkstras_algorithm(:a)[0]
+  end
+
+  def test_dijkstra_with_bracket_label
+    @w.keys.each do |e|
+      @d[e] = { :xyz => (@w[e])} 
+    end
+    assert_equal @a, @d.dijkstras_algorithm(:a, :xyz)[0]
+    @w.keys.each do |e|
+      @d[e] = [@w[e]] 
+    end
+    assert_equal @a, @d.dijkstras_algorithm(:a, 0)[0]
+  end
+  
+  def test_floyd_warshall
+    simple = Digraph[ 0,1,  0,2,  1,2,  1,3,  2,3,  3,0 ]
+    
+    cost, path, delta = simple.floyd_warshall(@simple_weight)
+    # Costs
+    assert_equal({0=>3, 1=>1, 2=>1, 3=>2}, cost[0])
+    assert_equal({0=>2, 1=>3, 2=>1, 3=>1}, cost[1])
+    assert_equal({0=>2, 1=>3, 2=>3, 3=>1}, cost[2])
+    assert_equal({0=>1, 1=>2, 2=>2, 3=>3}, cost[3])
+    
+    # Paths
+    assert_equal({0=>1, 1=>1, 2=>2, 3=>1}, path[0])
+    assert_equal({0=>3, 1=>3, 2=>2, 3=>3}, path[1])
+    assert_equal({0=>3, 1=>3, 2=>3, 3=>3}, path[2])
+    assert_equal({0=>0, 1=>0, 2=>0, 3=>0}, path[3])
+    
+    # Deltas
+    assert_equal 1,  delta[0]
+    assert_equal 1,  delta[1]
+    assert_equal -1, delta[2]
+    assert_equal -1, delta[3]
+  end
+  
+  def test_bellman_ford_moore
+    fig24 = Digraph[ [:s,:e] =>  8,
+                     [:s,:d] =>  4,
+                     [:e,:c] =>  2,
+                     [:e,:d] => -5,
+                     [:c,:b] => -2,
+                     [:d,:c] => -2,
+                     [:d,:a] =>  4,
+                     [:a,:c] => 10,
+                     [:a,:b] =>  9,
+                     [:b,:c] =>  5,
+                     [:b,:a] => -3]
+    cost, path = fig24.bellman_ford_moore(:s)
+    assert_equal({:e=>8, :d=>3, :c=>1, :b=>-1, :a=>-4, :s=>0}, cost)
+    assert_equal({:e=>:s, :d=>:e, :c=>:d, :b=>:c, :a=>:b},     path)
+  end
+  
+end

data/tests/TestEdge.rb

@@ -0,0 +1,171 @@
+#--
+# Copyright (c) 2006 Shawn Patrick Garbett
+# Copyright (c) 2002,2004,2005 by Horst Duchene
+# 
+# Redistribution and use in source and binary forms, with or without modification,
+# are permitted provided that the following conditions are met:
+# 
+#     * Redistributions of source code must retain the above copyright notice(s),
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of the Shawn Garbett nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+# 
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#++
+
+
+require 'test/unit'
+require 'gratr/import'
+
+class TestArc < Test::Unit::TestCase # :nodoc:
+
+  def setup
+    @e = Arc.new(1,2,'boo')
+    @u = Edge.new(1,2,'hoo')
+  end
+
+  def test_edge_new
+    assert_raises(ArgumentError) {Arc.new}
+    assert_raises(ArgumentError) {Arc.new(1)}
+    assert Arc.new(1,2)
+    assert Arc.new(1,2,'label')
+  end
+
+  def test_edge_getters
+
+    assert_equal(1,     @e.source)
+    assert_equal(2,     @e.target)
+    assert_equal('boo', @e.label)
+
+    assert_equal(1,     @e[0])
+    assert_equal(2,     @e[1])
+    assert_equal('boo', @e[2])
+
+    assert_equal(1,     @e[-3])
+    assert_equal(2,     @e[-2])
+    assert_equal('boo', @e[-1])
+
+    assert_raise(IndexError) {@e[-4]} 
+    assert_raise(IndexError) {@e[3]}  
+
+    assert_equal(1,     @e['source'])
+    assert_equal(2,     @e['target'])
+    assert_equal('boo', @e['label'])
+
+    assert_equal(1,     @e[:source])
+    assert_equal(2,     @e[:target])
+    assert_equal('boo', @e[:label])
+  end
+
+  def test_edge_setters
+    @e.source = 23
+    @e.target = 42
+    @e.label  = 'Yabba'
+    assert_equal(23,     @e.source)
+    assert_equal(42,     @e.target)
+    assert_equal('Yabba',@e.label)
+
+    @e['source'] = 2
+    @e['target'] = 1
+    @e['label']  = 'Dabba'
+    assert_equal(2,      @e.source)
+    assert_equal(1,      @e.target)
+    assert_equal('Dabba',@e.label)
+
+    @e[:source] = 9
+    @e[:target] = 8
+    @e['label'] = 'Doooo!'
+    assert_equal(9,       @e.source)
+    assert_equal(8,       @e.target)
+    assert_equal('Doooo!',@e.label)
+
+    @e[0] = 'Fred'
+    @e[1] = 'Flintstone'
+    @e[2] = 'and'
+    assert_equal('Fred',      @e.source)
+    assert_equal('Flintstone',@e.target)
+    assert_equal('and',       @e.label)
+
+    @e[-3] = 'Barney'
+    @e[-2] = 'Rubble'
+    @e[-1] = nil
+    assert_equal('Barney',    @e.source)
+    assert_equal('Rubble',    @e.target)
+    assert_equal(nil,         @e.label)
+  end
+
+  def test_edge_simple_methods
+    assert_equal([1,2,'boo'], @e.to_a)
+    assert_equal("(1-2 'boo')", @e.to_s)
+    @e.label = nil
+    assert_equal("(1-2)", @e.to_s)
+    assert(@e.eql?(Arc.new(1,2)))
+    assert(!@e.eql?(Arc.new(1,3)))
+    assert(!Arc.new(2,1).eql?(@e))
+
+    assert(@e             == (Arc.new(1,2)))
+    assert(@e.reverse     == (Arc.new(2,1)))
+    assert(Arc.new(1,2)  != (Arc.new(1,3)))
+    assert(Arc.new(2,1)  != @e)
+  end
+
+  def test_edge_sort
+    x = [ Arc.new(2,3), Arc.new(1,3), Arc.new(1,2), Arc.new(2,1) ].sort
+    assert_equal [Arc.new(1,2), Arc.new(1,3), Arc.new(2,1), Arc.new(2,3)], x
+  end
+
+  def test_undirected_edge_new
+    assert_raises(ArgumentError) {Edge.new}
+    assert_raises(ArgumentError) {Edge.new(1)}
+    assert Edge.new(1,2)
+    assert Edge.new(1,2,'label')
+  end
+
+  def test_undirected_edge_getters
+    assert_equal(1,@u.source)
+    assert_equal(2,@u.target)
+    assert_equal([1,2,'hoo'],@u.to_a)
+    assert_equal("(1=2 'hoo')",@u.to_s)
+  end
+
+  def test_undirected_edge_methods
+    @u.label = nil
+    assert_equal("(1=2)",@u.to_s)
+    assert_equal("(1=2)",Edge.new(2,1).to_s)
+
+    assert @u.eql?(Edge.new(2,1))
+    assert @u == Edge.new(2,1,'boo')
+    assert @u != Edge.new(2,3)
+
+    assert_equal(@u.hash,Edge.new(2,1).hash)
+  end
+
+  def test_undirected_edge_sort
+    x=[Edge.new(12, 1), Edge.new(2,11)].sort
+    assert_equal [Edge.new(2,11), Edge.new(1,12)], x
+  end
+  
+  def test_hash
+    assert_equal Arc[1,2,:b], Arc[1,2,:c]
+    assert_equal Arc[1,2,:b].hash, Arc[1,2,:c].hash
+    assert Arc[1,2] != Arc[2,1]
+    assert Arc[1,2] != Edge[1,2]
+    assert_equal Edge[1,2], Edge[2,1]
+    assert_equal Edge[1,2,:a], Edge[2,1,:b]
+  end
+
+end
+

data/tests/TestInspection.rb

@@ -0,0 +1,57 @@
+#--
+# Copyright (c) 2006 Shawn Patrick Garbett
+# 
+# Redistribution and use in source and binary forms, with or without modification,
+# are permitted provided that the following conditions are met:
+# 
+#     * Redistributions of source code must retain the above copyright notice(s),
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of the Shawn Garbett nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+# 
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#++
+
+
+require 'test/unit'
+require 'gratr/import'
+
+class TestInspection < Test::Unit::TestCase # :nodoc:
+  
+  def setup
+    @dg = DirectedMultiGraph[ 
+            [0,0,1]   => 1,
+            [1,2,2]   => 2, 
+            [1,3,3]   => 4,
+            [1,4,4]   => nil, 
+            [4,1,5]   => 8, 
+            [1,2,6]   => 16, 
+            [3,3,7]   => 32, 
+            [3,3,8]   => 64     ]
+    @dg[3] = 128
+    @dg[0] = 256
+  end
+  
+  def test_inspection
+    inspect = @dg.inspect
+    assert_equal 384, @dg.vertices.inject(0) {|a,v| a += (@dg[v] || 0)}
+    assert_equal 127, @dg.edges.inject(0)    {|a,e| a += (@dg[e] || 0)}
+    reflect = eval inspect
+    assert reflect == @dg
+    assert_equal 127, reflect.edges.inject(0)    {|a,e| a += (reflect[e] || 0)}
+    assert_equal 384, reflect.vertices.inject(0) {|a,v| a += (reflect[v] || 0)}
+  end
+end

data/tests/TestMultiEdge.rb

@@ -0,0 +1,57 @@
+#--
+# Copyright (c) 2006 Shawn Patrick Garbett
+# 
+# Redistribution and use in source and binary forms, with or without modification,
+# are permitted provided that the following conditions are met:
+# 
+#     * Redistributions of source code must retain the above copyright notice(s),
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of the Shawn Garbett nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+# 
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#++
+
+
+require 'test/unit'
+require 'gratr/import'
+
+class TestMultiArc < Test::Unit::TestCase # :nodoc:
+
+  def test_directed_pseudo_graph
+    dpg=DirectedPseudoGraph[ :a,:b,
+                             :a,:b,
+                             :a,:b ]
+    assert_equal 3, dpg.edges.size
+    x=0
+    dpg.edges.each {|e| dpg[e] = (x+=1)}
+    assert_equal 6, dpg.edges.inject(0) {|a,v| a+=dpg[v]}
+  end
+  
+  def test_directed_multi_graph
+    dmg=DirectedMultiGraph[ :a,:a,
+                            :a,:a,
+                            :a,:b,
+                            :a,:b,
+                            :b,:b,
+                            :b,:b ]
+    assert_equal 6,  dmg.edges.size
+    x = 0
+    dmg.edges.each {|e| dmg[e] = (x+=1)}
+    assert_equal 21, dmg.edges.inject(0) {|a,v| a+=dmg[v]}
+  end
+  
+end

data/tests/TestNeighborhood.rb

@@ -0,0 +1,64 @@
+#--
+# Copyright (c) 2006 Shawn Patrick Garbett
+# 
+# Redistribution and use in source and binary forms, with or without modification,
+# are permitted provided that the following conditions are met:
+# 
+#     * Redistributions of source code must retain the above copyright notice(s),
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of the Shawn Garbett nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+# 
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#++
+
+
+require 'test/unit'
+require 'gratr/import'
+
+class TestNeighborhood < Test::Unit::TestCase # :nodoc:
+  
+  def setup
+    @d = Digraph[:a,:b, :a,:f,
+                 :b,:g,
+                 :c,:b, :c,:g,
+                 :d,:c, :d,:g,
+                 :e,:d,
+                 :f,:e, :f,:g,
+                 :g,:a, :g,:e]
+    @w = [:a,:b]
+  end
+  
+  def test_open_out_neighborhood
+    assert_equal [:g], @d.set_neighborhood([:a],    :in)
+    assert_equal [],   [:f,:g]  - @d.set_neighborhood(@w, :out)
+    assert_equal [],   @w       - @d.open_pth_neighborhood(@w, 0, :out)
+    assert_equal [],   [:f, :g] - @d.open_pth_neighborhood(@w, 1, :out)
+    assert_equal [],   [:e]     - @d.open_pth_neighborhood(@w, 2, :out)
+    assert_equal [],   [:d]     - @d.open_pth_neighborhood(@w, 3, :out)
+    assert_equal [],   [:c]     - @d.open_pth_neighborhood(@w, 4, :out)    
+  end
+  
+  def test_closed_out_neighborhood
+    assert_equal [],   @w                     - @d.closed_pth_neighborhood(@w, 0, :out)
+    assert_equal [],   [:a,:b,:f,:g]          - @d.closed_pth_neighborhood(@w, 1, :out)
+    assert_equal [],   [:a,:b,:e,:f,:g]       - @d.closed_pth_neighborhood(@w, 2, :out)
+    assert_equal [],   [:a,:b,:d,:e,:f,:g]    - @d.closed_pth_neighborhood(@w, 3, :out)
+    assert_equal [],   [:a,:b,:c,:d,:e,:f,:g] - @d.closed_pth_neighborhood(@w, 4, :out)    
+  end
+  
+  
+end