fix: #84 each_in_neighbor has missing block argument.

Author: jsjuni

lib/rgl/base.rb

@@ -143,7 +143,7 @@ module Graph
     # method must be defined by concrete graph classes. It defines the BGL
     # VertexListGraph concept.
     #
-    def each_vertex() # :yields: v
+    def each_vertex(&block) # :yields: v
       raise NotImplementedError
     end
 
@@ -152,7 +152,7 @@ def each_vertex() # :yields: v
     # IncidenceGraph concept.
     # @param v a vertex of the graph
     #
-    def each_adjacent(v) # :yields: v
+    def each_adjacent(v, &block) # :yields: v
       raise NotImplementedError
     end
 

lib/rgl/bidirectional_adjacency.rb

@@ -52,8 +52,8 @@ def has_in_edge?(u, v)
     alias :has_out_edge? :has_edge?
 
     # @see BidirectionalGraph#each_in_neighbor
-    def each_in_neighbor(v)
-      @reverse.each_adjacent(v)
+    def each_in_neighbor(v, &b)
+      @reverse.each_adjacent(v, &b)
     end
 
     alias :each_out_neighbor :each_adjacent

test/bidirectional_graph_test.rb

@@ -153,8 +153,12 @@ def test_neighbors
 
   def test_each_neighbor
     @edges.flatten.to_set.each do |v|
-      assert_equal @out_neighbors[v], @dg.each_out_neighbor(v).inject(Set.new) { |s, v| s << v }
-      assert_equal @in_neighbors[v], @dg.each_in_neighbor(v).inject(Set.new) { |s, v| s << v }
+      out_neighbors = Set.new
+      @dg.each_out_neighbor(v) { |n| out_neighbors << n }
+      assert_equal @out_neighbors[v], out_neighbors
+      in_neighbors = Set.new
+      @dg.each_in_neighbor(v) { |n| in_neighbors << n }
+      assert_equal @in_neighbors[v], in_neighbors
     end
   end