rgl 0.5.4 → 0.5.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8756a57ea9c8151eadaa993efee20e2d41ddba102bee5d4106e00c94318d328e
-  data.tar.gz: c2400afcdcc2d5c8f22ed0da9e48cd843629f57747335265087a7e3e892d55d0
+  metadata.gz: 6cc432ed6e3560ca66d241be508defa12cd832a205df40f6f06e50ae187cb35f
+  data.tar.gz: 4f31192830a5a78b1d42c1a150a0f5b649750abb440ea06df689fa3dfc4c9621
 SHA512:
-  metadata.gz: 83cebc1a0570644f5dc1a48c16a5a38e11d73b9baf095f2627ef91676139c473f8027b608748dfe5d7df1926b17759e07dab85722fa0ced05b1656880fade8da
-  data.tar.gz: ad2d7ee636584a077313323efacf8c274f25643cc78e85b4f4f0e01dfbbbb522e00b7e50c295ad1e2ff395300c8f4f0551e00bb7b2a514cc179f01b9d327487e
+  metadata.gz: 568056f6ad3038dda236d889b09e78007767103692c514d5627a4efe0e610797e91eda827b58880c5714e357d964db7cf2040b238fbf79286108410b35592aeb
+  data.tar.gz: 3e1f01edc45fc73f094dd1d89cca164e6a2792cee0e555ab3b330f7c8cb981a5d79d2ec6003a6e9f8a39f6ec8d651b8d3d36645415a7156b6ab8e72cad4d41bb

data/ChangeLog

@@ -1,3 +1,10 @@
+2019-01 Release 0.5.5
+
+Artemy Kirienko
+ * PR #42 Add method Graph#path?(u, v) to check if a path exists between two vertices
+Horst Duchene
+ * Fix #47 set_to_begin for graph iterator (881aa8)
+
 2019-01 Release 0.5.4
 
 Lia Skalkos

data/README.md

@@ -171,6 +171,12 @@ Add inverse edge (4-2) to directed graph:
     irb> dg.remove_edge 4,2
     true
 
+Check whether a path exists between vertices 1 and 5
+
+    irb> require 'rgl/path'
+    irb> dg.path?(1, 5)
+    true
+
 *Topological sort* is implemented as an iterator:
 
     require 'rgl/topsort'

data/lib/rgl/base.rb

@@ -4,7 +4,7 @@
 # library. The main module is RGL::Graph which defines the abstract behavior of
 # all graphs in the library.
 
-RGL_VERSION = "0.5.4"
+RGL_VERSION = "0.5.6"
 
 module RGL
   class NotDirectedError < RuntimeError; end

data/lib/rgl/path.rb

@@ -0,0 +1,17 @@
+# frozen_string_literal: true
+
+require 'rgl/traversal'
+
+module RGL
+  module Graph
+    # Checks whether a path exists between _source_ and _target_ vertices
+    # in the graph.
+    #
+    def path?(source, target)
+      return false unless has_vertex?(source)
+
+      bfs_iterator = bfs_iterator(source)
+      bfs_iterator.include?(target)
+    end
+  end
+end

data/lib/rgl/traversal.rb

@@ -58,9 +58,12 @@ module RGL
     # Reset the iterator to the initial state (i.e. at_beginning? == true).
     #
     def set_to_begin
+      # Reset color_map
+      @color_map = Hash.new(:WHITE)
       color_map[@start_vertex] = :GRAY
-      @waiting = [@start_vertex] # a queue
+      @waiting = [@start_vertex]           # a queue
       handle_tree_edge(nil, @start_vertex) # discovers start vertex
+      self
     end
 
     def basic_forward # :nodoc:

data/test/path_test.rb

@@ -0,0 +1,52 @@
+# frozen_string_literal: true
+
+require 'test_helper'
+
+require 'rgl/adjacency'
+require 'rgl/path'
+
+class TestPath < Test::Unit::TestCase
+  include RGL
+
+  def setup
+    edges = [[1, 2], [2, 3], [2, 4], [4, 5], [6, 4], [1, 6]]
+    @directed_graph, @undirected_graph =
+      [DirectedAdjacencyGraph, AdjacencyGraph].map do |klass|
+        graph = klass.new
+        graph.add_edges(*edges)
+        graph
+      end
+  end
+
+  def test_path_for_directed_graph
+    assert(@directed_graph.path?(1, 5))
+  end
+
+  def test_path_for_undirected_graph
+    assert(@undirected_graph.path?(1, 5))
+  end
+
+  def test_inverse_path_for_directed_graph
+    assert_equal(@directed_graph.path?(3, 1), false)
+  end
+
+  def test_inverse_path_for_undirected_graph
+    assert(@undirected_graph.path?(3, 1))
+  end
+
+  def test_path_for_directed_graph_wrong_source
+    assert_equal(@directed_graph.path?(0, 1), false)
+  end
+
+  def test_path_for_undirected_graph_wrong_source
+    assert_equal(@undirected_graph.path?(0, 1), false)
+  end
+
+  def test_path_for_directed_graph_wrong_target
+    assert_equal(@directed_graph.path?(4, 0), false)
+  end
+
+  def test_path_for_undirected_graph_wrong_target
+    assert_equal(@undirected_graph.path?(4, 0), false)
+  end
+end

data/test/traversal_test.rb

@@ -218,4 +218,30 @@ END
     dg.depth_first_search(vis) { |x| }
     assert_equal("(1 (2 (3  3)(4 (5  5) 4) 2)(6  6) 1)(10 (11  11) 10)", a)
   end
+
+  def test_bfs_stream_protocol
+    it = @dg.bfs_iterator(1)
+    assert_true(it.at_beginning?)
+
+    it.set_to_end()
+    assert_true(it.at_end?)
+
+    it.set_to_begin()
+    assert_true(it.at_beginning?)
+
+    assert_equal(it.to_a(), [1, 2, 6, 3, 4, 5])
+  end
+
+  def test_dfs_stream_protocol
+    it = @dg.dfs_iterator(1)
+    assert_true(it.at_beginning?)
+
+    it.set_to_end()
+    assert_true(it.at_end?)
+
+    it.set_to_begin()
+    assert_true(it.at_beginning?)
+
+    assert_equal(it.to_a(), [1, 6, 4, 5, 2, 3])
+  end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rgl
 version: !ruby/object:Gem::Version
-  version: 0.5.4
+  version: 0.5.6
 platform: ruby
 authors:
 - Horst Duchene
@@ -9,7 +9,7 @@ authors:
 autorequire: rgl/base
 bindir: bin
 cert_chain: []
-date: 2019-02-06 00:00:00.000000000 Z
+date: 2019-08-23 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: stream
@@ -183,6 +183,7 @@ files:
 - lib/rgl/graphxml.rb
 - lib/rgl/implicit.rb
 - lib/rgl/mutable.rb
+- lib/rgl/path.rb
 - lib/rgl/path_builder.rb
 - lib/rgl/prim.rb
 - lib/rgl/rdot.rb
@@ -205,6 +206,7 @@ files:
 - test/graph_test.rb
 - test/graph_xml_test.rb
 - test/implicit_test.rb
+- test/path_test.rb
 - test/prim_test.rb
 - test/rdot_test.rb
 - test/test_helper.rb
@@ -234,7 +236,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.2
+rubygems_version: 3.0.6
 signing_key: 
 specification_version: 4
 summary: Ruby Graph Library