random_graph 0.1.1 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 7c2208cedd6acf5a8b495fe6664997783be18a85
-  data.tar.gz: 713602806eb17fb13a0447cefdcb0beb22701e05
+  metadata.gz: dbd2560a240a7b9578cfd98169134fc9bd55c8d2
+  data.tar.gz: e8d5ce5ea32ffdcdbd333f4ededb4d9220397a6b
 SHA512:
-  metadata.gz: 085a1812e583e0693841e61ae9b8694647b1f52895344873fda6707b26f9070cf14b59cb462af20af33f01f73a72c04544b9ccb02307d826ef0ff30a366509a9
-  data.tar.gz: 8babb0426c64e311765bf43bf1df00a594785db015ad1edfe9b64514084ba2177b5786e84290aa3588e264880a23dcab91cfc9fd150a9620f8a55211bbfb1fb3
+  metadata.gz: 20e734e0fbb5c61a1c94ee1c4cceac1919dd1e4c481709058c9c4d5dfeb8ae9c6feea97c605109df56e43961f55e873929fe496f212b1ba4bae486db2089984e
+  data.tar.gz: eb9b767894501dd04627310d26a1a5b006d3bae38d85ed33e8ed60a981442f99a0a7b452957446e6e17313de1e617e7b04a560f9149ad985ccb72fac3a64e9b8

data/examples/sample01.rb

@@ -8,8 +8,8 @@ include RandomGraph
 probability = []
 data = []
 
-size = 900
-trials = 1
+size = 20
+trials = 10
 (0..100).step(1) do |int|
   puts "progress! #{int}" if int % 5 == 0
   # puts int
@@ -28,12 +28,8 @@ g = Gruff::Bar.new
 g.sort = false
 g.title = 'probability vs. Number of connected components '
 g.data('number of componetns', data)
-g.y_axis_increment = 1  # Points shown on the Y axis
-g.x_axis_label = "p value"
-g.y_axis_label = "number of connected components "
-g.y_axis_increment = 10
-
-
-
-g.write('sample02.png')
+g.y_axis_increment = 1 # Points shown on the Y axis
+g.x_axis_label = 'p value'
+g.y_axis_label = 'number of connected components '
 
+g.write('sample01.png')

data/examples/sample02.rb

@@ -5,37 +5,33 @@ require 'gruff'
 
 include RandomGraph
 
-
-size = 900
+size = 1000
 p = 0.1
 g = Graph.erdos_renyi_gnp(size, p)
 frequency = Array.new(size)
 frequency.fill(0)
 (0...size).each do |i|
   deg = g.degree(i)
-  frequency[deg] += 1 
-end 
+  frequency[deg] += 1
+end
 
 max = 0
 (0...size).each do |i|
-  max = i if frequency[i] > 0 
-end 
+  max = i if frequency[i] > 0
+end
 
-new_freq = Array.new(max+1)
-(0...max+1).each do |i| 
+new_freq = Array.new(max + 1)
+(0...max + 1).each do |i|
   new_freq[i] = frequency[i]
 end
 
 g = Gruff::Bar.new
 g.sort = false
-g.title = 'Degree distribution'
+g.title = 'Degree distribution erdos_renyi_gnp'
 g.data('Frequency', new_freq)
-g.y_axis_increment = 1  # Points shown on the Y axis
-g.x_axis_label = "Node Degree"
-g.y_axis_label = "Frequency"
+g.y_axis_increment = 1 # Points shown on the Y axis
+g.x_axis_label = 'Node Degree'
+g.y_axis_label = 'Frequency'
 g.y_axis_increment = 5
 
-
-
 g.write('sample02.png')
-

data/examples/sample03.rb

@@ -5,39 +5,34 @@ require 'gruff'
 
 include RandomGraph
 
-the_hash = {} 
-
-(0...300000).each do |i| 
+the_hash = {}
 
+(0...300_000).each do |_i|
   g = Graph.erdos_renyi_gnm(4, 3)
   x = 0b000000
-  x ^= 0b100000 if g.edge?(0,1)
-  x ^= 0b010000 if g.edge?(0,2)
-  x ^= 0b001000 if g.edge?(0,3)
-  x ^= 0b000100 if g.edge?(1,2)
-  x ^= 0b000010 if g.edge?(1,3)
-  x ^= 0b000001 if g.edge?(2,3)
-
-  if the_hash.has_key?(x) 
+  x ^= 0b100000 if g.edge?(0, 1)
+  x ^= 0b010000 if g.edge?(0, 2)
+  x ^= 0b001000 if g.edge?(0, 3)
+  x ^= 0b000100 if g.edge?(1, 2)
+  x ^= 0b000010 if g.edge?(1, 3)
+  x ^= 0b000001 if g.edge?(2, 3)
+
+  if the_hash.key?(x)
     the_hash[x] = 1 + the_hash[x]
-  else 
-    the_hash[x] = 1 
-  end 
-end 
+  else
+    the_hash[x] = 1
+  end
+end
 
 data = []
-the_hash.each_value {|v| data << v }
-
+the_hash.each_value { |v| data << v }
 
 g = Gruff::Bar.new
 g.sort = false
 g.title = '4 node, 3 edge distribution'
 g.data('Frequency', data)
-g.y_axis_increment = 10000  # Points shown on the Y axis
-g.x_axis_label = "graph layout"
-g.y_axis_label = "Frequency"
-
-
+g.y_axis_increment = 10_000 # Points shown on the Y axis
+g.x_axis_label = 'graph layout'
+g.y_axis_label = 'Frequency'
 
 g.write('sample03.png')
-

data/examples/sample04.rb

@@ -5,39 +5,34 @@ require 'gruff'
 
 include RandomGraph
 
-the_hash = {} 
-
-(0...30000).each do |i| 
+the_hash = {}
 
+(0...30_000).each do |_i|
   g = Graph.erdos_renyi_gnm(4, 5)
   x = 0b000000
-  x ^= 0b100000 if g.edge?(0,1)
-  x ^= 0b010000 if g.edge?(0,2)
-  x ^= 0b001000 if g.edge?(0,3)
-  x ^= 0b000100 if g.edge?(1,2)
-  x ^= 0b000010 if g.edge?(1,3)
-  x ^= 0b000001 if g.edge?(2,3)
-
-  if the_hash.has_key?(x) 
+  x ^= 0b100000 if g.edge?(0, 1)
+  x ^= 0b010000 if g.edge?(0, 2)
+  x ^= 0b001000 if g.edge?(0, 3)
+  x ^= 0b000100 if g.edge?(1, 2)
+  x ^= 0b000010 if g.edge?(1, 3)
+  x ^= 0b000001 if g.edge?(2, 3)
+
+  if the_hash.key?(x)
     the_hash[x] = 1 + the_hash[x]
-  else 
-    the_hash[x] = 1 
-  end 
-end 
+  else
+    the_hash[x] = 1
+  end
+end
 
 data = []
-the_hash.each_value {|v| data << v }
-
+the_hash.each_value { |v| data << v }
 
 g = Gruff::Bar.new
 g.sort = false
 g.title = '4 node, 5 edge distribution'
 g.data('Frequency', data)
-g.y_axis_increment = 10000  # Points shown on the Y axis
-g.x_axis_label = "graph layout"
-g.y_axis_label = "Frequency"
-
-
+g.y_axis_increment = 10_000 # Points shown on the Y axis
+g.x_axis_label = 'graph layout'
+g.y_axis_label = 'Frequency'
 
 g.write('sample04.png')
-

data/examples/sample05.rb

@@ -0,0 +1,38 @@
+#!/usr/bin/ruby
+
+require 'random_graph'
+require 'gruff'
+
+include RandomGraph
+
+the_hash = {}
+
+(0...300_000).each do |_i|
+  g = Graph.erdos_renyi_gnp(4, 0.5)
+  x = 0b000000
+  x ^= 0b100000 if g.edge?(0, 1)
+  x ^= 0b010000 if g.edge?(0, 2)
+  x ^= 0b001000 if g.edge?(0, 3)
+  x ^= 0b000100 if g.edge?(1, 2)
+  x ^= 0b000010 if g.edge?(1, 3)
+  x ^= 0b000001 if g.edge?(2, 3)
+
+  if the_hash.key?(x)
+    the_hash[x] = 1 + the_hash[x]
+  else
+    the_hash[x] = 1
+  end
+end
+
+data = []
+the_hash.each_value { |v| data << v }
+
+g = Gruff::Bar.new
+g.sort = false
+g.title = '4 node, 0.5 probability GNP'
+g.data('Frequency', data)
+g.y_axis_increment = 10_000 # Points shown on the Y axis
+g.x_axis_label = 'graph layout'
+g.y_axis_label = 'Frequency'
+
+g.write('sample05.png')

data/examples/sample06.rb

@@ -0,0 +1,36 @@
+#!/usr/bin/ruby
+
+require 'random_graph'
+require 'gruff'
+
+include RandomGraph
+
+size = 1000
+g = Graph.preferential_attachment(size)
+frequency = Array.new(size)
+frequency.fill(0)
+(0...size).each do |i|
+  deg = g.degree(i)
+  frequency[deg] += 1
+end
+
+max = 0
+(0...size).each do |i|
+  max = i if frequency[i] > 0
+end
+
+new_freq = Array.new(max + 1)
+(0...max + 1).each do |i|
+  new_freq[i] = frequency[i]
+end
+
+g = Gruff::Bar.new
+g.sort = false
+g.title = 'Degree distribution preferential_attachment'
+g.data('Frequency', new_freq)
+g.y_axis_increment = 1 # Points shown on the Y axis
+g.x_axis_label = 'Node Degree'
+g.y_axis_label = 'Frequency'
+g.y_axis_increment = 80
+
+g.write('sample06.png')

data/lib/random_graph/graph.rb

@@ -46,12 +46,11 @@ module RandomGraph
 
     # add edge between two nodes
     def add_edge(from, to)
-      fail ArgumentError.new('invalid node') if from >= @size || from < 0
-      fail ArgumentError.new('invalid node') if to >= @size || to < 0
-      unless to == from
-        @nodes[from] << to unless @nodes[from].include?(to)
-        @nodes[to] << from unless @nodes[to].include?(from)
-      end
+      fail ArgumentError, 'invalid node' if from >= @size || from < 0
+      fail ArgumentError, 'invalid node' if to >= @size || to < 0
+      return if to == from
+      @nodes[from] << to unless @nodes[from].include?(to)
+      @nodes[to] << from unless @nodes[to].include?(from)
     end
 
     def remove_edge(from, to)

data/lib/random_graph/graph_algorithms.rb

@@ -1,14 +1,11 @@
-# implements useful graph algorithms
+# reopen module
 module RandomGraph
+  # module implements graph algorithms
   module GraphAlgorithms
-    def BFS_distance(root)
-      distance = Array.new(@size)
-      distance.fill(Float::INFINITY)
-
-      queue = []
-
+    def bfs_distance(root)
+      distance = Array.new(@size).fill(Float::INFINITY)
+      queue = [root]
       distance[root] = 0
-      queue.unshift(root)
 
       until queue.empty?
 
@@ -18,14 +15,14 @@ module RandomGraph
           if distance[a] == Float::INFINITY
             distance[a] = distance[current] + 1
             queue.unshift(a)
-         end
+          end
         end
-    end
+      end
       distance
-  end
+    end
 
     def connected_component(root)
-      distances = BFS_distance(root)
+      distances = bfs_distance(root)
       adjacent = []
       (0...distances.size).each do |i|
         adjacent << i unless distances[i] == Float::INFINITY
@@ -53,25 +50,25 @@ module RandomGraph
       worst = 0
       if real_bad == 0
         (0...size).each do |i|
-          distances = BFS_distance(i)
+          distances = bfs_distance(i)
           worst = [distances.max, worst].max
         end
-     end
+      end
       [worst, real_bad].max
-   end
+    end
 
     def average_case_diameter
       real_bad = number_of_components > 1 ? Float::INFINITY : 0
       total = 0
       if real_bad == 0
         (0...size).each do |i|
-          distances = BFS_distance(i)
+          distances = bfs_distance(i)
           average = distances.inject(:+).to_f / (size - 1)
           total += average
         end
       end
       total / size
-   end
+    end
 
     def clustering_coefficient
       total_cluster = 0

data/lib/random_graph/random_generators.rb

@@ -1,4 +1,5 @@
 module RandomGraph
+  # implements random graph generators
   module RandomGenerators
     # Select a graph randomly, where all graphs with n nodes and m edges
     # are equally likely to be selected.
@@ -8,39 +9,35 @@ module RandomGraph
     # express as a summation, which is upper bounded by O(n^2)
 
     def erdos_renyi_gnm(n, m)
-      fail ArgumentError.new('must have positive number of nodes') if n < 0
-      fail ArgumentError.new('must have positive number of edges') if m < 0
+      fail ArgumentError, 'must have positive number of nodes' if n < 0
+      fail ArgumentError, 'must have positive number of edges' if m < 0
 
       possible_edges = n * (n - 1) / 2
 
-      fail ArgumentError.new('too many edges') if m > possible_edges
+      fail ArgumentError, 'too many edges' if m > possible_edges
 
       # create empty graph
       g = Graph.new(n)
-      added_edges = {}
 
       # for every edge
-      (0...m).each do |i|
-        valid_edge = false
-        from = 0
-        to = 0
-        begin
-         # select a random number, representing on of the possible edges
-         from = rand(0...n)
-         to = rand(0...n)
-         valid_edge = !g.edge?(from, to) && (from != to)
-       end until valid_edge == true
+      (0...m).each do |_i|
+        loop do
+          # select a random number, representing on of the possible edges
+          from = rand(0...n)
+          to = rand(0...n)
+          break if !g.edge?(from, to) && (from != to)
+        end
         g.add_edge(from, to)
       end
       g
-   end
+    end
 
     # Create a graph with n nodes, where all edges have a probability p
     # of existing
     def erdos_renyi_gnp(n, p)
-      fail ArgumentError.new('must have positive number of nodes') if n < 0
-      fail ArgumentError.new('need positive probability') if p < 0
-      fail ArgumentError.new('probability cannot be greater than 1!') if p > 1
+      fail ArgumentError, 'must have positive number of nodes' if n < 0
+      fail ArgumentError, 'need positive probability' if p < 0
+      fail ArgumentError, 'probability cannot be greater than 1!' if p > 1
 
       # create empty graph
       g = Graph.new(n)
@@ -52,12 +49,12 @@ module RandomGraph
       g
     end
 
-    # creates a Watts–Strogatz random graph. n represents the number of nodes,
+    # creates a watts-strogatz random graph. n represents the number of nodes,
     # k is the mean degree, and b is the beta parameter
     def watts_strogatz(n, k, b)
-      fail ArgumentError.new('must have positive number of nodes') if n < 0
-      fail ArgumentError.new('invalid beta parameter') if b < 0 || b > 1
-      fail ArgumentError.new('invalid mean degree if') if k > n || k < Math.log10(n)
+      fail ArgumentError, 'must have positive number of nodes' if n < 0
+      fail ArgumentError, 'invalid beta parameter' if b < 0 || b > 1
+      fail ArgumentError, 'invalid mean degree if' if k > n || k < Math.log10(n)
 
       # construction of regular ring lattice
       g = Graph.new(n)
@@ -91,8 +88,9 @@ module RandomGraph
       g
     end
 
+    # preferential attachement model enforces power law degree distribution
     def preferential_attachment(size)
-      fail ArgumentError.new('invalid number of nodes') if size < 2
+      fail ArgumentError, 'invalid number of nodes' if size < 2
       g = Graph.new(2)
       g.add_edge(0, 1)
       total_degree = 2
@@ -113,8 +111,10 @@ module RandomGraph
       g
     end
 
+    # n x n grid, with vertices isolated with probability p
+
     def random_grid(n, p)
-      fail ArgumentError.new('invalid probability') if p > 1 || p < 0
+      fail ArgumentError, 'invalid probability' if p > 1 || p < 0
       g = Graph.new(n**2)
       (0...n**2).each do |i|
         bottom = (i + n) % n**2

data/lib/random_graph/version.rb

@@ -1,3 +1,3 @@
 module RandomGraph
-  VERSION = '0.1.1'
+  VERSION = '0.1.2'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: random_graph
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.2
 platform: ruby
 authors:
 - fselame
@@ -105,8 +105,6 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- "  .png"
-- " .png"
 - ".DS_Store"
 - ".gitignore"
 - ".rspec"
@@ -119,12 +117,18 @@ files:
 - bin/console
 - bin/setup
 - examples/.DS_Store
+- examples/sample01.png
 - examples/sample01.rb
+- examples/sample02.png
 - examples/sample02.rb
 - examples/sample03.png
 - examples/sample03.rb
 - examples/sample04.png
 - examples/sample04.rb
+- examples/sample05.png
+- examples/sample05.rb
+- examples/sample06.png
+- examples/sample06.rb
 - lib/.DS_Store
 - lib/random_graph.rb
 - lib/random_graph/.DS_Store