rgl 0.2.2

data/tests/TestUnDirectedGraph.rb

@@ -0,0 +1,98 @@
+require 'test/unit'
+require 'rgl/adjacency'
+
+include RGL
+include RGL::Edge
+
+class TestUnDirectedGraph < Test::Unit::TestCase
+
+  def setup
+    @dg = AdjacencyGraph.new
+    [[1,2],[2,3],[3,2],[2,4]].each do |(src,target)| 
+      @dg.add_edge(src, target)
+    end
+  end
+
+  def test_empty_graph
+	dg = AdjacencyGraph.new
+	assert(dg.empty?)
+	assert(!dg.directed?)
+	assert(!dg.has_edge?(2,1))
+	assert(!dg.has_vertex?(3))
+	# Non existend vertex result in a Name Error because each_key is
+	# called for nil
+	assert_raises(NoVertexError) {dg.out_degree(3)}
+	assert_equal([],dg.vertices)
+	assert_equal(0,dg.size)
+	assert_equal(0,dg.num_vertices)
+	assert_equal(0,dg.num_edges)
+	assert_equal(UnDirectedEdge,dg.edge_class)
+	assert([].eql?(dg.edges))
+	assert([].eql?(dg.to_a))
+  end
+
+  def test_add
+	dg = AdjacencyGraph.new
+	dg.add_edge(1,2)
+	assert(!dg.empty?)
+	assert(dg.has_edge?(1,2))
+	assert(dg.has_edge?(2,1), "Backwards edge not included!")
+	assert(dg.has_vertex?(1) && dg.has_vertex?(2))
+	assert(!dg.has_vertex?(3))
+
+	assert_equal([1,2],dg.vertices.sort)
+	assert([DirectedEdge.new(1,2)].eql?(dg.edges))
+	assert_equal("(1=2)",dg.edges.to_s)
+
+	assert_equal([2],dg.adjacent_vertices(1))
+	assert_equal([1],dg.adjacent_vertices(2))
+
+	assert_equal(1,dg.out_degree(1))
+	assert_equal(1,dg.out_degree(2))
+  end
+
+  def test_edges
+    assert_equal(3, @dg.edges.length)
+	edges = [[1,2],[2,3],[2,4]].map {|x| UnDirectedEdge.new(*x)}
+    assert_equal(edges, @dg.edges.sort)
+#    assert_equal([0,1,2,3], @dg.edges.map {|l| l.info}.sort)
+  end
+
+  def test_vertices
+    assert_equal([1,2,3,4], @dg.vertices.sort)
+  end
+
+  def test_edges_from_to?
+    assert @dg.has_edge?(1,2)
+    assert @dg.has_edge?(2,3)
+    assert @dg.has_edge?(3,2)
+    assert @dg.has_edge?(2,4)
+    assert @dg.has_edge?(2,1)
+    assert !@dg.has_edge?(3,1)
+    assert !@dg.has_edge?(4,1)
+    assert @dg.has_edge?(4,2)
+  end
+
+  def test_remove_edges
+	@dg.remove_edge 1,2
+	assert !@dg.has_edge?(1,2), "(1,2) should not be an edge any more."
+	@dg.remove_edge 1,2
+	assert !@dg.has_edge?(2,1)
+	@dg.remove_vertex 3
+	assert !@dg.has_vertex?(3), "3 should not be a vertex any more."
+	assert !@dg.has_edge?(2,3)
+	assert_equal([UnDirectedEdge.new(2,4)],@dg.edges)
+  end
+
+  def test_add_vertices
+	dg = AdjacencyGraph.new
+	dg.add_vertices 1,3,2,4
+	assert_equal dg.vertices.sort, [1,2,3,4]
+
+	dg.remove_vertices 1,3
+	assert_equal dg.vertices.sort, [2,4]
+
+	dg.remove_vertices 1,3,Object		# ones again
+	assert_equal dg.vertices.sort, [2,4]
+  end
+end

metadata

@@ -0,0 +1,163 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.8.3
+specification_version: 1
+name: rgl
+version: !ruby/object:Gem::Version 
+  version: 0.2.2
+date: 2004-12-12
+summary: Ruby Graph Library
+require_paths: 
+  - lib
+email: hd.at.clr@hduchene.de
+homepage: 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"
+autorequire: rgl
+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
+authors: 
+  - Horst Duchene
+files: 
+  - install.rb
+  - ChangeLog
+  - Makefile
+  - README
+  - Rakefile
+  - TAGS
+  - tests/TestGraphXML.rb
+  - tests/TestComponents.rb
+  - tests/TestDirectedGraph.rb
+  - tests/TestEdge.rb
+  - tests/TestImplicit.rb
+  - tests/TestTransitiveClosure.rb
+  - tests/TestTraversal.rb
+  - tests/TestUnDirectedGraph.rb
+  - examples/north
+  - examples/canvas.rb
+  - examples/example.jpg
+  - examples/examples.rb
+  - examples/module_graph.jpg
+  - examples/north.rb
+  - examples/north2.rb
+  - examples/rdep-rgl.rb
+  - examples/codegraph
+  - examples/graph.dot
+  - examples/graph.png
+  - examples/north/Graph.log
+  - examples/north/g.10.0.graphml
+  - 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.19.graphml
+  - examples/north/g.10.2.graphml
+  - examples/north/g.10.20.graphml
+  - examples/north/g.10.22.graphml
+  - examples/north/g.10.24.graphml
+  - examples/north/g.10.25.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.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.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.79.graphml
+  - examples/north/g.10.8.graphml
+  - examples/north/g.10.80.graphml
+  - examples/north/g.10.82.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.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
+  - lib/rgl/adjacency.rb
+  - lib/rgl/base.rb
+  - lib/rgl/connected_components.rb
+  - lib/rgl/dot.rb
+  - lib/rgl/graphxml.rb
+  - lib/rgl/implicit.rb
+  - lib/rgl/mutable.rb
+  - lib/rgl/rdot.rb
+  - lib/rgl/topsort.rb
+  - lib/rgl/transitiv_closure.rb
+  - lib/rgl/traversal.rb
+test_files: []
+rdoc_options: 
+  - "--title"
+  - "RGL - Ruby Graph Library"
+  - "--main"
+  - README
+  - "--line-numbers"
+extra_rdoc_files: 
+  - README
+executables: []
+extensions: []
+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: