rgraph 0.0.14 → 0.0.15

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4c4d3fdd3c5cedd1f8ea3f6f12ac4cfc35ced188
-  data.tar.gz: b9ee2affd0263db5ec94a3bf395d5569ee8ece85
+  metadata.gz: a8b930efb8ed11c31dacaee01435737d719d91dd
+  data.tar.gz: 86ba6f3a3c0985a29da1c0819c4fd99af9803c5d
 SHA512:
-  metadata.gz: 7723113a6c7b319dd3dadae64511d8d0c623832f588ce40f418da526df01a81cb052d509fd89550638ad2554c89cc64e02632cda004f73892d88410601e7e158
-  data.tar.gz: 86883eca3a63e40d83d3cd1c2e2eb326347e8585a39b75bd555f31c56d44e2ca152da0aab91097e0dcc540b903efe656b745eb422c33e62a5410c6780924f92b
+  metadata.gz: d073c066a225bc4bb874739bffcec43715410d8ef8b1cddececc47807650c8edf12bcf515216e466a51a8c6e1ceb08ace176c48f5f34d1c988807edb8abe7ad7
+  data.tar.gz: 0d3490d9524aca751f01cc92ddeb7f9bc95e5117d46d9644197221ecb5c33432025b0debf83d470f734816f37a0daf5844c58b58b06da1fc15e3d37274fecced

data/lib/rgraph/graph.rb

@@ -100,20 +100,26 @@ class Graph
 
   def shortest_paths(args = {})
     multiples = args[:multiples] || false
+    giant = args[:giant] || false
+
     @shortest_paths = []
 
     distances
+    giant_component
+
+    nodes = giant ? @giant_component : @nodes
 
-    0.upto(@nodes.size - 1).each do |i|
-      (i + 1).upto(@nodes.size - 1).each do |j|
-        @shortest_paths += shortest_path(i, j, multiples)
+    0.upto(nodes.size - 1).each do |i|
+      (i + 1).upto(nodes.size - 1).each do |j|
+        @shortest_paths += shortest_path(i, j, multiples, giant)
       end
     end
 
     @shortest_paths
   end
 
-  def shortest_path(i, j, multiples = false)
+  def shortest_path(i, j, multiples = false, giant = false)
+    nodes = giant ? @giant_component : @nodes
 
     return [] if @distance[i][j] == @infinity
 
@@ -141,8 +147,9 @@ class Graph
     out
   end
 
-  def between(i)
-    shortest_paths(multiples: true)
+  def between(i, args = {})
+    giant = args[:giant] || false
+    shortest_paths(multiples: true, giant: giant)
 
     n = @shortest_paths.select{|c| c[1..-2].include?(i)}.size.to_f
     m = @shortest_paths.size.to_f
@@ -151,11 +158,12 @@ class Graph
 
   def betweenness(args = {})
     cumulative = args[:cumulative] || false
+    giant = args[:giant] || false
 
     #If we ask cumulative, normalized must be true
     normalized = args[:normalized] || cumulative || false
 
-    bts = 0.upto(@nodes.size - 1).map { |i| between(i) }
+    bts = 0.upto(@nodes.size - 1).map { |i| between(i, args) }
 
     if normalized
       max = bts.max
@@ -227,6 +235,17 @@ class Graph
     @components
   end
 
+  def giant_component
+    components unless @components
+
+    @giant_component = []
+    @components.each do |c|
+      @giant_component = c if c.size > @giant_component.size
+    end
+
+    @giant_component
+  end
+
   private
 
   def step_page_rank(d = 0.85, e = 0.01)

data/lib/rgraph/version.rb

@@ -1,3 +1,3 @@
 module Rgraph
-  VERSION = '0.0.14'
+  VERSION = '0.0.15'
 end

data/spec/rgraph/graph_spec.rb

@@ -158,6 +158,17 @@ describe Graph do
       expect(g.shortest_paths.count).to eq(6)
       expect(g.shortest_paths(multiples: true).count).to eq(8)
     end
+    it "calculates the betweenness of the giant component" do
+      g = Graph.new_from_string("source,target\n1,2\n2,3\n3,4\n5,6")
+      expect(g.between(0, giant: true)).to eq(0 / 6.0)
+      expect(g.between(1, giant: true)).to eq(2 / 6.0)
+      expect(g.between(2, giant: true)).to eq(2 / 6.0)
+      expect(g.between(3, giant: true)).to eq(0 / 6.0)
+      expect(g.between(4, giant: true)).to eq(0.0)
+      expect(g.between(5, giant: true)).to eq(0.0)
+      expect(g.betweenness(giant: true)).to eq([0, 1 / 3.0, 1 / 3.0, 0, 0, 0])
+    end
+
     it "calculates the betweenness of a single node" do
       expect(subject.between(0)).to eq(0 / 18.0)
       expect(subject.between(1)).to eq(2 / 18.0)
@@ -199,6 +210,10 @@ describe Graph do
       g = Graph.new_from_string("source,target\n1,2\n3,4")
       expect(g.components).to eq([g.nodes[0..1], g.nodes[2..3]])
     end
+    it "sets the giant component" do
+      g = Graph.new_from_string("source,target\n1,2\n2,3\n4,5")
+      expect(g.giant_component.size).to eq(3)
+    end
     it "calculates clustering of a single node" do
       nodes = subject.nodes.sort{|a,b| a.id <=> b.id}
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rgraph
 version: !ruby/object:Gem::Version
-  version: 0.0.14
+  version: 0.0.15
 platform: ruby
 authors:
 - Lucas Aride Moulin