rgl 0.3.1 → 0.4.0

data/tests/TestTransitivity.rb

@@ -0,0 +1,129 @@
+require 'test/unit'
+require 'rgl/transitivity'
+require 'test_helper'
+
+include RGL
+
+class TestTransitiveClosure < Test::Unit::TestCase
+
+  def setup
+    @dg = DirectedAdjacencyGraph.new
+    @dg.add_edges([1,2],[2,3],[2,4],[4,5],[1,6],[6,4])
+    @dg_tc = DirectedAdjacencyGraph.new
+    @dg_tc.add_edges(
+      [1,2],[1,3],[1,4],[1,5],[1,6],
+      [2,3],[2,4],[2,5],
+      [4,5],
+      [6,4],[6,5]
+    )
+    @dg_tr = DirectedAdjacencyGraph.new
+    @dg_tr.add_edges(
+      [1,2],[1,6],
+      [2,3],[2,4],
+      [4,5],
+      [6,4]
+    )
+
+    @dg_loner = @dg.dup
+    @dg_loner.add_vertices(7, 8, 9)
+    @dg_loner_tc = @dg_tc.dup
+    @dg_loner_tc.add_vertices(7, 8, 9)
+    @dg_loner_tr = @dg_tr.dup
+    @dg_loner_tr.add_vertices(7, 8, 9)
+
+    @dg_cyclic = DirectedAdjacencyGraph.new
+    @dg_cyclic.add_edges(
+      [1,1],[1,2],
+      [2,3],
+      [3,4],
+      [4,5],
+      [5,6],
+      [6,3]
+    )
+    @dg_cyclic_tc = DirectedAdjacencyGraph.new
+    @dg_cyclic_tc.add_edges(
+      [1,1],[1,2],[1,3],[1,4],[1,5],[1,6],
+      [2,3],[2,4],[2,5],[2,6],
+      [3,3],[3,4],[3,5],[3,6],
+      [4,3],[4,4],[4,5],[4,6],
+      [5,3],[5,4],[5,5],[5,6],
+      [6,3],[6,4],[6,5],[6,6]
+    )
+    @dg_cyclic_tr = DirectedAdjacencyGraph.new
+    @dg_cyclic_tr.add_edges(
+      [1,1],[1,2],
+      [2,3],
+      [3,4],
+      [4,5],
+      [5,6],
+      [6,3]
+    )
+  end
+
+  def test_transitive_closure
+    # A simple graph without cycles.
+    assert_equal(@dg_tc, @dg.transitive_closure)
+
+    # Iterative applications of transitive closure should return the same result
+    # as a single application.
+    assert_equal(
+      @dg.transitive_closure,
+      @dg.transitive_closure.transitive_closure
+    )
+
+    # Compute for a graph containing vertices without edges.
+    assert_equal(@dg_loner_tc, @dg_loner.transitive_closure)
+
+    # Iterative applications of transitive closure should return the same result
+    # as a single application.
+    assert_equal(
+      @dg_loner.transitive_closure,
+      @dg_loner.transitive_closure.transitive_closure
+    )
+
+    # Compute for a graph with cycles.
+    assert_equal(@dg_cyclic_tc, @dg_cyclic.transitive_closure)
+
+    # Iterative applications of transitive closure should return the same result
+    # as a single application.
+    assert_equal(
+      @dg_cyclic.transitive_closure,
+      @dg_cyclic.transitive_closure.transitive_closure
+    )
+  end
+
+  def test_transitive_closure_undirected
+    assert_raises(NotDirectedError) {AdjacencyGraph.new.transitive_closure}
+  end
+
+  def test_transitive_reduction
+    # A simple graph without cycles.
+    assert_equal(@dg_tr, @dg.transitive_reduction)
+
+    # Compute for a graph containing vertices without edges.
+    assert_equal(@dg_loner_tr, @dg_loner.transitive_reduction)
+
+    # Compute for a graph with cycles.
+    assert_equal(@dg_cyclic_tr, @dg_cyclic.transitive_reduction)
+
+    # Test that the transitive closure of a transitive reduction is the same as
+    # the transitive closure of the original graph.
+    assert_equal(
+      @dg.transitive_closure,
+      @dg.transitive_reduction.transitive_closure
+    )
+    assert_equal(
+      @dg_loner.transitive_closure,
+      @dg_loner.transitive_reduction.transitive_closure
+    )
+    assert_equal(
+      @dg_cyclic.transitive_closure,
+      @dg_cyclic.transitive_reduction.transitive_closure
+    )
+  end
+
+  def test_transitive_reduction_undirected
+    assert_raises(NotDirectedError) {AdjacencyGraph.new.transitive_reduction}
+  end
+end
+

metadata

@@ -1,173 +1,184 @@
 --- !ruby/object:Gem::Specification 
-rubygems_version: 0.9.0
-specification_version: 1
 name: rgl
 version: !ruby/object:Gem::Version 
-  version: 0.3.1
-date: 2008-03-08 00:00:00 +01:00
-summary: Ruby Graph Library
-require_paths: 
-- lib
-email: monora@gmail.com
-homepage: http://rgl.rubyforge.org
-rubyforge_project: rgl
-description: "RGL is a framework for graph data structures and algorithms.  The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism.  RGL currently contains a core set of algorithm patterns:  * Breadth First Search  * Depth First 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 RGL currently include:  * Topological Sort  * Connected Components  * Strongly Connected Components  * Transitive Closure * Search cycles (contributed by Shawn Garbett)"
-autorequire: rgl/base
-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: 
+  version: 0.4.0
 platform: ruby
-signing_key: 
-cert_chain: 
-post_install_message: 
 authors: 
 - Horst Duchene
+autorequire: rgl/base
+bindir: bin
+cert_chain: []
+
+date: 2008-08-27 00:00:00 -05:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: stream
+  type: :runtime
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0.5"
+    version: 
+- !ruby/object:Gem::Dependency 
+  name: rake
+  type: :runtime
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+    version: 
+description: "RGL is a framework for graph data structures and algorithms.  The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++ heavily using its template mechanism.  RGL currently contains a core set of algorithm patterns:  * Breadth First Search  * Depth First 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 RGL currently include:  * Topological Sort  * Connected Components  * Strongly Connected Components  * Transitive Closure * Transitive Reduction * Graph Condensation * Search cycles (contributed by Shawn Garbett)"
+email: monora@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- README
 files: 
 - install.rb
+- Rakefile
 - ChangeLog
 - README
-- Rakefile
-- tests/TestTransitiveClosure.rb
-- tests/TestComponents.rb
-- tests/TestCycles.rb
-- tests/TestDirectedGraph.rb
-- tests/TestEdge.rb
 - tests/TestGraph.rb
-- tests/TestGraphXML.rb
-- tests/TestImplicit.rb
 - tests/TestUnDirectedGraph.rb
+- tests/TestTransitivity.rb
 - tests/TestTraversal.rb
-- tests/test_helper.rb
 - tests/TestDot.rb
+- tests/TestEdge.rb
+- tests/TestDirectedGraph.rb
 - tests/TestRdot.rb
-- examples/north
-- examples/module_graph.jpg
-- examples/canvas.rb
+- tests/TestCycles.rb
+- tests/TestImplicit.rb
+- tests/test_helper.rb
+- tests/TestGraphXML.rb
+- tests/TestComponents.rb
 - examples/insel-der-tausend-gefahren.rb
+- examples/canvas.rb
+- examples/north.rb
+- examples/north2.rb
 - examples/example.jpg
+- examples/module_graph.jpg
 - examples/examples.rb
-- examples/north2.rb
-- examples/north.rb
 - examples/rdep-rgl.rb
+- examples/north
+- examples/north/g.10.75.graphml
 - examples/north/g.10.0.graphml
-- examples/north/Graph.log
-- examples/north/g.10.1.graphml
-- examples/north/g.10.11.graphml
-- examples/north/g.10.12.graphml
-- examples/north/g.10.13.graphml
-- examples/north/g.10.14.graphml
-- examples/north/g.10.15.graphml
-- examples/north/g.10.16.graphml
-- examples/north/g.10.17.graphml
+- examples/north/g.10.41.graphml
+- examples/north/g.10.93.graphml
+- examples/north/g.10.7.graphml
+- examples/north/g.10.30.graphml
+- examples/north/g.10.20.graphml
+- examples/north/g.10.89.graphml
+- examples/north/g.10.78.graphml
 - examples/north/g.10.19.graphml
+- examples/north/g.10.86.graphml
+- examples/north/g.10.92.graphml
+- examples/north/g.10.38.graphml
+- examples/north/g.10.14.graphml
 - examples/north/g.10.2.graphml
-- examples/north/g.10.20.graphml
-- examples/north/g.10.22.graphml
+- examples/north/g.10.46.graphml
+- examples/north/g.10.72.graphml
 - examples/north/g.10.24.graphml
-- examples/north/g.10.25.graphml
+- examples/north/g.10.45.graphml
+- examples/north/g.10.88.graphml
+- examples/north/g.10.82.graphml
 - examples/north/g.10.27.graphml
-- examples/north/g.10.28.graphml
-- examples/north/g.10.29.graphml
-- examples/north/g.10.3.graphml
-- examples/north/g.10.30.graphml
 - examples/north/g.10.31.graphml
-- examples/north/g.10.34.graphml
-- examples/north/g.10.37.graphml
-- examples/north/g.10.38.graphml
-- examples/north/g.10.39.graphml
-- examples/north/g.10.4.graphml
-- examples/north/g.10.40.graphml
-- examples/north/g.10.41.graphml
-- examples/north/g.10.42.graphml
-- examples/north/g.10.45.graphml
-- examples/north/g.10.46.graphml
-- examples/north/g.10.5.graphml
+- examples/north/g.10.1.graphml
+- examples/north/g.10.25.graphml
+- examples/north/g.10.71.graphml
 - examples/north/g.10.50.graphml
-- examples/north/g.10.56.graphml
-- examples/north/g.10.57.graphml
-- examples/north/g.10.58.graphml
-- examples/north/g.10.6.graphml
-- examples/north/g.10.60.graphml
-- examples/north/g.10.61.graphml
-- examples/north/g.10.62.graphml
-- examples/north/g.10.68.graphml
+- examples/north/g.12.8.graphml
+- examples/north/g.10.91.graphml
 - examples/north/g.10.69.graphml
-- examples/north/g.10.7.graphml
-- examples/north/g.10.70.graphml
-- examples/north/g.10.71.graphml
-- examples/north/g.10.72.graphml
-- examples/north/g.10.74.graphml
-- examples/north/g.10.75.graphml
-- examples/north/g.10.78.graphml
+- examples/north/g.10.13.graphml
+- examples/north/g.14.9.graphml
+- examples/north/g.10.42.graphml
 - examples/north/g.10.79.graphml
-- examples/north/g.10.8.graphml
+- examples/north/g.10.39.graphml
+- examples/north/g.10.16.graphml
+- examples/north/Graph.log
+- examples/north/g.10.94.graphml
+- examples/north/g.10.68.graphml
 - examples/north/g.10.80.graphml
-- examples/north/g.10.82.graphml
+- examples/north/g.10.37.graphml
+- examples/north/g.10.61.graphml
 - examples/north/g.10.83.graphml
-- examples/north/g.10.85.graphml
-- examples/north/g.10.86.graphml
-- examples/north/g.10.88.graphml
-- examples/north/g.10.89.graphml
-- examples/north/g.10.9.graphml
+- examples/north/g.10.5.graphml
+- examples/north/g.10.11.graphml
+- examples/north/g.10.40.graphml
+- examples/north/g.10.4.graphml
 - examples/north/g.10.90.graphml
-- examples/north/g.10.91.graphml
-- examples/north/g.10.92.graphml
-- examples/north/g.10.93.graphml
-- examples/north/g.10.94.graphml
-- examples/north/g.12.8.graphml
-- examples/north/g.14.9.graphml
+- examples/north/g.10.58.graphml
+- examples/north/g.10.15.graphml
+- examples/north/g.10.8.graphml
+- examples/north/g.10.6.graphml
+- examples/north/g.10.22.graphml
+- examples/north/g.10.9.graphml
+- examples/north/g.10.57.graphml
+- examples/north/g.10.29.graphml
+- examples/north/g.10.85.graphml
+- examples/north/g.10.70.graphml
+- examples/north/g.10.62.graphml
+- examples/north/g.10.17.graphml
+- examples/north/g.10.34.graphml
+- examples/north/g.10.56.graphml
+- examples/north/g.10.12.graphml
+- examples/north/g.10.74.graphml
+- examples/north/g.10.28.graphml
+- examples/north/g.10.60.graphml
+- examples/north/g.10.3.graphml
 - rakelib/dep_graph.rake
-- lib/rgl/bidirectional.rb
-- lib/rgl/adjacency.rb
-- lib/rgl/base.rb
+- lib/rgl/enumerable_ext.rb
+- lib/rgl/transitiv_closure.rb
 - lib/rgl/graphxml.rb
-- lib/rgl/dot.rb
+- lib/rgl/condensation.rb
 - lib/rgl/connected_components.rb
+- lib/rgl/adjacency.rb
+- lib/rgl/dot.rb
+- lib/rgl/base.rb
 - lib/rgl/rdot.rb
-- lib/rgl/enumerable_ext.rb
-- lib/rgl/implicit.rb
 - lib/rgl/mutable.rb
+- lib/rgl/bidirectional.rb
+- lib/rgl/transitivity.rb
 - lib/rgl/topsort.rb
-- lib/rgl/transitiv_closure.rb
 - lib/rgl/traversal.rb
-test_files: []
-
+- lib/rgl/implicit.rb
+has_rdoc: true
+homepage: http://rgl.rubyforge.org
+post_install_message: 
 rdoc_options: 
 - --title
 - RGL - Ruby Graph Library
 - --main
 - README
 - --line-numbers
-extra_rdoc_files: 
-- README
-executables: []
-
-extensions: []
-
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
 requirements: 
 - Stream library, v0.5 or later
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: stream
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Version::Requirement 
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: "0.5"
-    version: 
-- !ruby/object:Gem::Dependency 
-  name: rake
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Version::Requirement 
-    requirements: 
-    - - ">"
-      - !ruby/object:Gem::Version 
-        version: 0.0.0
-    version: 
+rubyforge_project: rgl
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: Ruby Graph Library
+test_files: []
+

data/tests/TestTransitiveClosure.rb

@@ -1,26 +0,0 @@
-require 'test/unit'
-require 'rgl/transitiv_closure'
-require 'test_helper'
-
-include RGL
-
-class TestTransitiveClosure < Test::Unit::TestCase
-
-  def setup
-    @dg = DirectedAdjacencyGraph.new(Array)
-	edges = [[1,2],[2,3],[2,4],[4,5],[1,6],[6,4]]
-    edges.each do |(src,target)| 
-      @dg.add_edge(src, target)
-    end
-  end
-
-  def test_transitive_closure
-	assert_equal("(1-2)(1-3)(1-4)(1-6)(2-3)(2-4)(2-5)(4-5)(6-4)(6-5)",
-				 @dg.transitive_closure.to_s)
-  end
-
-  def test_transitive_closure_undirected
-	assert_raises(NotDirectedError) {AdjacencyGraph.new.transitive_closure}
-  end
-end
-