rgraph 0.0.10 → 0.0.11

data/lib/rgraph/graph.rb

@@ -108,7 +108,7 @@ class Graph
       i.upto(@nodes.size - 1).each do |j|
         next if i == j
         sp = shortest_path(i, j)
-        tmp << sp if sp
+        tmp << sp unless sp.empty?
       end
     end
 

data/lib/rgraph/version.rb

@@ -1,3 +1,3 @@
 module Rgraph
-  VERSION = '0.0.10'
+  VERSION = '0.0.11'
 end

data/spec/rgraph/graph_spec.rb

@@ -142,6 +142,11 @@ describe Graph do
          [3, 4], [3, 5],
          [4, 3, 5]].sort)
     end
+    it "doesn't return empty paths" do
+      g = Graph.new_from_string("source,target\n1,2\n3,4")
+      expect(g.shortest_paths).to eq([[0,1],[2,3]])
+    end
+
     it "calculates the betweenness of a single node" do
       expect(subject.between(0)).to eq(0 / 15.0)
       expect(subject.between(1)).to eq(2 / 15.0)
@@ -163,6 +168,10 @@ describe Graph do
       expect(subject.betweenness(normalized: true)).to eq(
         [0.0, 0.5, 0.5, 1.0, 0.5, 0.0])
     end
+    it "works with holes" do
+      g = Graph.new_from_string("source,target\n1,2\n3,4")
+      expect(g.betweenness.inject(:+)).to eq(0)
+    end
     it "calculates diameter" do
       expect(subject.diameter).to eq(3)
     end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rgraph
 version: !ruby/object:Gem::Version
-  version: 0.0.10
+  version: 0.0.11
   prerelease: 
 platform: ruby
 authors: