rgl 0.6.1 → 0.6.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8f4b3d0c46bc5145d7ff932e0166f220a1d7d8ebbcceead860f442cbfc8e4708
-  data.tar.gz: 501fe6687c99a1d4ac7f7801640f2311baa1bda69105f712b8c01e800e0eef44
+  metadata.gz: 47e8e8f4af2accfae6599fa5d4a4a47738383132e1a4466fe08f03da6de685a5
+  data.tar.gz: a5f2d79f45f1ebf4dba49e1249d4ab56688d802b54eefb2b656d0190af9ab5d7
 SHA512:
-  metadata.gz: c96d01848ccf3e3f285852bd4ae3f492251973d248dcb1b6a1733027b7e7dddb6e5785b84f3e6c3c9c8e6307f808929394a2001ed31f0c01d8f6b14a686cd7dc
-  data.tar.gz: 2a44e9de16e9f0b11f03df63ad6ebf17263b5edf38af2cf2d346803895c58e8d496ede3a5a23970ab2db6030f4647a454d6f78a7854bb2dbb5b3194610762ea0
+  metadata.gz: 051d980a5da8369366f7aa2dcd261a28dbcc4068fa9356c3b96ec5a89ea377752a545b6a413316ffbecb0f3b851372c966bf3acbb5b615808dd818160053920a
+  data.tar.gz: 4fdb3d0aa88108a1fdea83cdb65ce92ea69bd6318874d5fbced1ccd64ca8ee9651c8e948fbe302725bfef00b214da2a20849aa1d5cdcff71c4d9d07adeea8104

data/lib/rgl/base.rb

@@ -1,7 +1,7 @@
 # base.rb
 
 # version information
-RGL_VERSION = "0.6.1"
+RGL_VERSION = "0.6.2"
 
 # Module {RGL} defines the namespace for all modules and classes of the graph
 # library. The main module is {Graph} which defines the abstract behavior of

data/lib/rgl/bidirectional_adjacency.rb

@@ -22,9 +22,11 @@ module RGL
       super(edgelist_class, *other_graphs)
     end
 
-    # We don't need to override add_vertex() because the reverse graph doesn't need to
-    # contain any unconnected vertices. Vertices will be added by add_edge() as
-    # required.
+    # @see MutableGraph#add_vertex.
+    def add_vertex(v)
+      super(v)
+      @reverse.add_vertex(v)
+    end
 
     # @see MutableGraph#add_edge.
     def add_edge(u, v)

data/test/bidirectional_graph_test.rb

@@ -149,6 +149,9 @@ class TestBidirectionalAdjacencyGraph < Test::Unit::TestCase
       assert_equal @out_neighbors[v], @dg.out_neighbors(v).to_set
       assert_equal @in_neighbors[v], @dg.in_neighbors(v).to_set
     end
+    @dg.add_vertex(42)
+    assert_empty(@dg.out_neighbors(42))
+    assert_empty(@dg.in_neighbors(42))
   end
 
   def test_each_neighbor
@@ -160,6 +163,13 @@ class TestBidirectionalAdjacencyGraph < Test::Unit::TestCase
       @dg.each_in_neighbor(v) { |n| in_neighbors << n }
       assert_equal @in_neighbors[v], in_neighbors
     end
+    @dg.add_vertex(42)
+    out_neighbors = Set.new
+    @dg.each_out_neighbor(42) { |n| out_neighbors << n }
+    assert_empty(out_neighbors)
+    in_neighbors = Set.new
+    @dg.each_in_neighbor(42) { |n| in_neighbors << n }
+    assert_empty(in_neighbors)
   end
 
   def test_degrees

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rgl
 version: !ruby/object:Gem::Version
-  version: 0.6.1
+  version: 0.6.2
 platform: ruby
 authors:
 - Horst Duchene
@@ -9,7 +9,7 @@ authors:
 autorequire: rgl/base
 bindir: bin
 cert_chain: []
-date: 2023-03-03 00:00:00.000000000 Z
+date: 2023-03-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: stream