gratr 0.4.2

data/tests/TestTriagulated.rb

@@ -0,0 +1,137 @@
+#--
+# 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 TestTriagulated < Test::Unit::TestCase #:nodoc:
+
+  def test_berge_mystery
+    berge_mystery = UndirectedGraph[
+                      :abe,       :eddie, 
+                      :abe,       :burt,
+                      :abe,       :desmond,
+                      :eddie,     :burt,
+                      :eddie,     :ida,
+                      :eddie,     :charlotte,
+                      :charlotte, :ida,
+                      :charlotte, :desmond,
+                      :burt,      :ida,
+                      :ida,       :desmond]
+                      
+    assert !berge_mystery.triangulated?
+    berge_mystery.remove_vertex!(:desmond)
+    assert berge_mystery.triangulated?
+    
+    assert 3, berge_mystery.chromatic_number
+  end
+  
+  def test_house
+    house = UndirectedGraph[
+              :roof,            :left_gutter,
+              :roof,            :right_gutter,
+              :left_gutter,     :left_foundation,
+              :right_gutter,    :right_foundation,
+              :left_foundation, :right_foundation
+            ]
+    assert !house.triangulated?
+    house.remove_vertex!(:left_foundation) # Becomes a bulls head graph
+    assert house.triangulated?
+    assert 3, house.chromatic_number
+  end
+  
+  # A triangulated, but not interval graph test
+  def test_non_interval
+    non_interval = UndirectedGraph[
+                     :ao, :ai,
+                     :ai, :bi,
+                     :ai, :ci,
+                     :bo, :bi,
+                     :bi, :ci,
+                     :co, :ci
+                   ]
+    assert non_interval.triangulated?
+    assert 3, non_interval.chromatic_number
+  end
+  
+  def test_simple
+    simple = UndirectedGraph[
+               :a, :b,
+               :b, :c,
+               :c, :d,
+               :d, :e, 
+               :e, :f,
+               :f, :g,
+               :g, :a,
+               :g, :b,
+               :b, :f,
+               :f, :c,
+             ]
+    assert !simple.triangulated?
+    simple.add_edge!(:c, :e)
+    assert simple.triangulated?
+    assert 3, simple.chromatic_number
+    assert 2, UndirectedGraph[:a, :b].chromatic_number
+  end
+  
+  def test_simple2
+    simple2 = UndirectedGraph[
+                :x, :p,
+                :p, :z,
+                :z, :r,
+                :r, :x,
+                :p, :y,
+                :y, :r,
+                :y, :q,
+                :q, :z]
+    assert !simple2.triangulated?
+  end
+  
+  def test_lexicographic_queue
+    q = UndirectedGraph::LexicographicQueue.new([1,2,3,4,5,6,7,8,9])
+    assert_equal 9, q.pop
+    q.add_lexeme([3,4,5,6,7,8])
+    assert_equal 8, q.pop
+    q.add_lexeme([2,6,7,9])
+    assert_equal 7, q.pop
+    q.add_lexeme([8,9])
+    assert_equal 6, q.pop
+    q.add_lexeme([1,5,8,9])
+    assert_equal 5, q.pop
+    q.add_lexeme([6,9])
+    assert_equal 4, q.pop
+    q.add_lexeme([3,9])
+    assert_equal 3, q.pop
+    q.add_lexeme([4,9])
+    assert_equal 2, q.pop
+    q.add_lexeme([8])
+    assert_equal 1, q.pop
+    assert_equal nil, q.pop
+  end
+  
+end

data/tests/TestUndirectedGraph.rb

@@ -0,0 +1,219 @@
+#--
+# 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 TestUndirectedGraph < Test::Unit::TestCase # :nodoc:
+
+  def setup
+    @single = UndirectedGraph[1,2, 2,3, 3,4, 4,4, 1,2, 2,3]
+    @dups   = UndirectedPseudoGraph[1,2, 2,3, 3,4, 4,4, 1,2, 2,3]
+    @loops  = UndirectedMultiGraph[1,2, 2,3, 3,4, 4,4, 1,2, 2,3]
+  end
+
+  def test_new
+    assert_equal UndirectedGraph[1,2, 2,3, 3,4, 4,4], @single
+    assert_equal UndirectedPseudoGraph[1,2, 2,3, 3,4, 4,4, 1,2, 2,3], @dups
+    assert_equal UndirectedMultiGraph[1,2, 2,3, 3,4, 4,4, 1,2, 2,3], @loops
+    assert_raise(ArgumentError) {UndirectedGraph.new(:bomb)}
+    assert_raise(ArgumentError) {UndirectedGraph.new(1)}
+    assert_equal @single, UndirectedGraph.new(@single)
+  end
+
+  def test_edges
+    assert @single.edges.include?(Edge[1,2])
+    assert @single.edges.include?(Edge[2,3])
+    assert @single.edges.include?(Edge[3,4])
+    assert !@single.edges.include?(Edge[4,4])
+    assert @loops.edges.include?(MultiEdge[4,4])
+    assert @single.edges.include?(Edge[1,2])
+    assert @single.edges.include?(Edge[2,3])
+    assert !@single.edges.include?(Edge[1,3])
+    assert @single.edge?(2,3)
+    assert !@single.edge?(1,4)
+    assert @single.edge?(Edge[1,2])
+    assert !@single.add_edge!(5,5).edge?(5,5)
+    assert !@dups.add_edge!(5,5).edge?(5,5)
+    assert @loops.add_edge!(5,5).edge?(5,5)
+    assert !@single.remove_edge!(5,5).edge?(5,5)
+  end
+
+  def test_vertices
+    assert_equal [1,2,3,4],   @single.vertices.sort
+    assert_equal [1,2,3,4,5], @single.add_vertex!(5).sort
+    assert_equal [1,2,4,5],   @single.remove_vertex!(3).sort
+    assert !@single.vertex?(3)
+    assert !@single.edge?(2,3)
+    assert !@single.edge?(3,4)
+  end
+
+  def test_properties
+    assert !@single.directed?
+    assert @single.empty? == false
+    assert UndirectedGraph.new.empty? == true
+    assert_equal 4, @single.size 
+    assert_equal 4, @dups.size 
+    assert_equal 4, @single.num_vertices
+    assert_equal 4, @dups.num_vertices
+    assert_equal 3, @single.num_edges
+    assert_equal 6, @loops.num_edges
+    assert_equal 5, @dups.num_edges
+  end
+
+  def test_merge
+    @dups.merge(@single)
+    assert_equal 8, @dups.num_edges
+    assert_equal [1,2,3,4],   @dups.vertices.sort
+  end
+
+  def test_operators
+    result = @single + Edge[3,2] 
+    assert_equal 4, @single.size 
+    assert_equal 3, @single.num_edges
+    assert_equal 4, result.size 
+    assert_equal 3, result.num_edges
+
+    result = @single + 5
+    assert_equal 4, @single.size 
+    assert_equal 3, @single.num_edges
+    assert_equal 5, result.size 
+    assert_equal 3, result.num_edges
+
+    result = @single - Edge[4,4]
+    assert_equal 4, @single.size 
+    assert_equal 3, @single.num_edges
+    assert_equal 4, result.size 
+    assert_equal 3, result.num_edges
+
+    result = @single - 4
+    assert_equal 4, @single.size
+    assert_equal 3, @single.num_edges
+    assert_equal 3, result.size 
+    assert_equal 2, result.num_edges
+    
+    @single << Edge[6,1]
+    assert_equal 5, @single.size
+    assert_equal 4, @single.num_edges
+    assert @single.edge?(6,1)
+  end
+
+  def test_complement
+    complement = @single.complement 
+    assert [1,2,3,4], complement.vertices.sort
+    assert !complement.edge?(1,1)
+    assert complement.edge?(1,3)
+    assert complement.edge?(1,4)
+    assert !complement.edge?(2,2)
+    assert complement.edge?(2,4)
+    assert complement.edge?(3,1)
+    assert !complement.edge?(3,3)
+    assert complement.edge?(4,1)
+    assert complement.edge?(4,2)
+    assert 7, complement.num_edges
+  end
+
+  def test_induced_subgraph
+    induced = @single.induced_subgraph([1,2])
+    assert [1,2], induced.vertices.sort
+    assert induced.edge?(1,2)
+    assert 1, induced.num_edges
+  end
+
+  def test_include
+    assert @single.include?(4)
+    assert @dups.include?(4)
+    assert !@dups.include?(5)
+    assert !@single.include?(5)
+    assert @single.include?(Edge[1,2])
+    assert @dups.include?(Edge[1,2])
+  end
+
+  def test_adjacent
+
+    assert @single.adjacent?(2, Edge[1,2])
+    assert_equal [2], @single.adjacent(1)
+
+    assert_equal [Edge[1,2]], @single.adjacent(1, :type=>:edges)
+    assert_equal [Edge[1,2]], @single.adjacent(1, :type=>:edges, :direction=> :out)
+    assert_equal [Edge[1,2],Edge[2,3]], @single.adjacent(2, :type=>:edges, :direction=> :in).sort
+    assert_equal [Edge[1,2],Edge[2,3]], @single.adjacent(2, :type=>:edges, :direction=> :all).sort
+
+    assert_equal [MultiEdge[1,2]]*2, @dups.adjacent(1, :type=>:edges)
+    assert_equal [MultiEdge[1,2]]*2, @dups.adjacent(1, :type=>:edges, :direction=> :out)
+    assert_equal ([MultiEdge[1,2]]*2 + [MultiEdge[2,3]]*2), @dups.adjacent(2, :type=>:edges, :direction=> :in).sort
+    assert_equal ([MultiEdge[1,2]]*2 + [MultiEdge[2,3]]*2), @dups.adjacent(2, :type=>:edges, :direction=> :all).sort
+
+    assert_equal [2], @single.adjacent(1, :type=>:vertices)
+    assert_equal [2], @single.adjacent(1, :type=>:vertices, :direction=> :out)
+    assert_equal [1,3], @single.adjacent(2, :type=>:vertices, :direction=> :in)
+    assert_equal [1,3], @single.adjacent(2, :type=>:vertices, :direction=> :all)
+
+    assert_equal [2,3], @single.adjacent(Edge[2,3], :type=>:vertices)
+    assert_equal [2,3], @single.adjacent(Edge[2,3], :type=>:vertices, :direction=> :out)
+    assert_equal [2,3], @single.adjacent(Edge[2,3], :type=>:vertices, :direction=> :in)
+    assert_equal [2,3], @single.adjacent(Edge[2,3], :type=>:vertices, :direction=> :all)
+
+    assert_equal [Edge[1,2],Edge[3,4]], @single.adjacent(Edge[2,3], :type=>:edges).sort
+    assert_equal [Edge[1,2],Edge[3,4]], @single.adjacent(Edge[2,3], :type=>:edges, :direction=> :out).sort
+    assert_equal [Edge[1,2],Edge[3,4]], @single.adjacent(Edge[2,3], :type=>:edges, :direction=> :in).sort
+    assert_equal [Edge[1,2],Edge[3,4]], @single.adjacent(Edge[2,3], :type=>:edges, :direction=> :all).sort
+    assert_equal ([MultiEdge[1,2]]*2 + [MultiEdge[3,4]]), @dups.adjacent(MultiEdge[2,3], :type=>:edges).sort
+    assert_equal ([MultiEdge[1,2]]*2 + [MultiEdge[3,4]]), @dups.adjacent(MultiEdge[2,3], :type=>:edges, :direction=>:out).sort
+    assert_equal ([MultiEdge[1,2]]*2 + [MultiEdge[3,4]]), @dups.adjacent(MultiEdge[2,3], :type=>:edges, :direction=>:in).sort
+    assert_equal ([MultiEdge[1,2]]*2+[MultiEdge[3,4]]), @dups.adjacent(MultiEdge[2,3], :type=>:edges, :direction=> :all).sort
+  end
+
+  def test_neighborhood
+    assert_equal [2],    @single.neighborhood(1).sort
+    assert_equal [1,3],  @single.neighborhood(2).sort
+    assert_equal [Edge[1,2], Edge[3,4]], @single.neighborhood(Edge[2,3]).sort
+  end
+
+  def test_degree
+    assert_equal 1, @single.in_degree(1)
+    assert_equal 2, @single.in_degree(2)
+    assert_equal 1, @single.in_degree(4)
+    assert_equal 1, @single.out_degree(1)
+    assert_equal 2, @single.out_degree(2)
+    assert_equal 1, @single.out_degree(4)
+    assert_equal 0, @single.add_vertex!(6).out_degree(6)
+    assert_equal 0, @single.add_vertex!(7).in_degree(7)
+    assert_equal 2, @single.add_edge!(4,2).out_degree(4)
+    assert_equal 3, @single.in_degree(2)
+  end
+
+  def test_include
+    assert @single.include?(2)
+    assert !@single.include?(23)
+    assert @single.include?(Edge[1,2])
+    assert !@single.include?(Edge[1,4])
+  end
+
+end

metadata

@@ -0,0 +1,92 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.8.11
+specification_version: 1
+name: gratr
+version: !ruby/object:Gem::Version 
+  version: 0.4.2
+date: 2007-01-01 00:00:00 -06:00
+summary: Graph Theory Ruby library
+require_paths: 
+- lib
+email: shawn@garbett.org
+homepage: http://gratr.rubyforge.org
+rubyforge_project: gratr
+description: "GRATR is a framework for graph data structures and algorithms.  This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics.  GRATR currently contains a core set of algorithm patterns:  * Breadth First Search  * Depth First Search  * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search  The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include:  * Topological Sort  * Strongly Connected Components  * Transitive Closure * Rural Chinese Postman * Biconnected"
+autorequire: gratr
+default_executable: 
+bindir: bin
+has_rdoc: true
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+  - - ">"
+    - !ruby/object:Gem::Version 
+      version: 0.0.0
+  version: 
+platform: ruby
+signing_key: 
+cert_chain: 
+authors: 
+- Shawn Garbett
+files: 
+- install.rb
+- Grater.xcf
+- Rakefile
+- README
+- tests/TestBiconnected.rb
+- tests/TestChinesePostman.rb
+- tests/TestComplement.rb
+- tests/TestDigraph.rb
+- tests/TestDigraphDistance.rb
+- tests/TestEdge.rb
+- tests/TestInspection.rb
+- tests/TestMultiEdge.rb
+- tests/TestNeighborhood.rb
+- tests/TestProperties.rb
+- tests/TestSearch.rb
+- tests/TestStrongComponents.rb
+- tests/TestTriagulated.rb
+- tests/TestUndirectedGraph.rb
+- examples/graph_self.rb
+- examples/module_graph.jpg
+- examples/module_graph.rb
+- examples/self_graph.jpg
+- examples/visualize.jpg
+- examples/visualize.rb
+- lib/gratr.rb
+- lib/gratr/adjacency_graph.rb
+- lib/gratr/base.rb
+- lib/gratr/biconnected.rb
+- lib/gratr/chinese_postman.rb
+- lib/gratr/common.rb
+- lib/gratr/comparability.rb
+- lib/gratr/digraph.rb
+- lib/gratr/digraph_distance.rb
+- lib/gratr/dot.rb
+- lib/gratr/edge.rb
+- lib/gratr/graph.rb
+- lib/gratr/graph_api.rb
+- lib/gratr/import.rb
+- lib/gratr/labels.rb
+- lib/gratr/maximum_flow.rb
+- lib/gratr/rdot.rb
+- lib/gratr/search.rb
+- lib/gratr/strong_components.rb
+- lib/gratr/undirected_graph.rb
+test_files: []
+
+rdoc_options: 
+- --title
+- GRATR - Ruby Graph Library
+- --main
+- README
+- --line-numbers
+extra_rdoc_files: 
+- README
+executables: []
+
+extensions: []
+
+requirements: []
+
+dependencies: []
+