random_graph 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c8138e4f808a95fa20e072ed897f60c1ccf271d4
-  data.tar.gz: 7e2028969794c5fa2678be5e677d10611b10a407
+  metadata.gz: 7c2208cedd6acf5a8b495fe6664997783be18a85
+  data.tar.gz: 713602806eb17fb13a0447cefdcb0beb22701e05
 SHA512:
-  metadata.gz: ff0f7677effadc9e48d2a241bed2abc72be56a381ac7479e0af7bf3a42bf1475219af92a3f080b5a3210561a285c6bc0faff4e74ed062e041e88054ec8ad31b5
-  data.tar.gz: e16b25a0847b425df5b7248bd555dcadc1a60277779213670727acbe82949402a8e4762e4d74273aa350d23f963a507284e9ec68c4a26042436cf9185db9089c
+  metadata.gz: 085a1812e583e0693841e61ae9b8694647b1f52895344873fda6707b26f9070cf14b59cb462af20af33f01f73a72c04544b9ccb02307d826ef0ff30a366509a9
+  data.tar.gz: 8babb0426c64e311765bf43bf1df00a594785db015ad1edfe9b64514084ba2177b5786e84290aa3588e264880a23dcab91cfc9fd150a9620f8a55211bbfb1fb3

data/examples/sample01.rb

@@ -0,0 +1,39 @@
+#!/usr/bin/ruby
+
+require 'random_graph'
+require 'gruff'
+
+include RandomGraph
+
+probability = []
+data = []
+
+size = 900
+trials = 1
+(0..100).step(1) do |int|
+  puts "progress! #{int}" if int % 5 == 0
+  # puts int
+  p = int.to_f / 100
+  probability << p
+  total_number_comp = 0
+  (0...trials).each do |_x|
+    g = Graph.erdos_renyi_gnp(size, p)
+    total_number_comp += g.number_of_components
+  end
+  avg_num = total_number_comp.to_f / trials
+  data << avg_num
+end
+
+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')
+

data/examples/sample02.rb

@@ -0,0 +1,41 @@
+#!/usr/bin/ruby
+
+require 'random_graph'
+require 'gruff'
+
+include RandomGraph
+
+
+size = 900
+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 
+
+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'
+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 = 5
+
+
+
+g.write('sample02.png')
+

data/examples/sample03.rb

@@ -0,0 +1,43 @@
+#!/usr/bin/ruby
+
+require 'random_graph'
+require 'gruff'
+
+include RandomGraph
+
+the_hash = {} 
+
+(0...300000).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) 
+    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, 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.write('sample03.png')
+

data/examples/sample04.rb

@@ -0,0 +1,43 @@
+#!/usr/bin/ruby
+
+require 'random_graph'
+require 'gruff'
+
+include RandomGraph
+
+the_hash = {} 
+
+(0...30000).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) 
+    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, 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.write('sample04.png')
+

data/lib/random_graph/graph.rb

@@ -46,12 +46,12 @@ 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.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
     end
 
     def remove_edge(from, to)
@@ -79,7 +79,7 @@ module RandomGraph
     def edge?(from, to)
       # check if nodes are valid?
       invalid_nodes = from >= @size || from < 0 || to >= @size || to < 0
-      @nodes[from].include?(to) if !invalid_nodes
+      @nodes[from].include?(to) unless invalid_nodes
     end
 
     def edge_number
@@ -93,6 +93,5 @@ module RandomGraph
     def average_degree
       2.0 * edge_number / size
     end
-
   end
 end

data/lib/random_graph/graph_algorithms.rb

@@ -1,103 +1,96 @@
-    # implements useful graph algorithms
-    module RandomGraph
-      module GraphAlgorithms
-
-
-        def BFS_distance(root)
-          distance = Array.new(@size)
-          distance.fill(Float::INFINITY)
-
-          queue = []
-
-          distance[root] = 0
-          queue.unshift(root)
-
-          while !queue.empty? do
-
-            current = queue.pop
-            adj = adjacent_nodes(current)
-            adj.each do |a|
-             if distance[a] == Float::INFINITY
-              distance[a] = distance[current] + 1 
-              queue.unshift(a)
-            end 
-          end 
-        end 
-        distance 
-      end 
-
-      def connected_component(root)
-        distances = BFS_distance(root)
-        adjacent = []
-        (0...distances.size).each do |i|
-          adjacent << i unless distances[i] == Float::INFINITY
-        end 
-        adjacent 
-      end 
-
-      def number_of_components
-        visited = Array.new(size)
-        visited.fill(false)
-        counter = 0
-
+# implements useful graph algorithms
+module RandomGraph
+  module GraphAlgorithms
+    def BFS_distance(root)
+      distance = Array.new(@size)
+      distance.fill(Float::INFINITY)
+
+      queue = []
+
+      distance[root] = 0
+      queue.unshift(root)
+
+      until queue.empty?
+
+        current = queue.pop
+        adj = adjacent_nodes(current)
+        adj.each do |a|
+          if distance[a] == Float::INFINITY
+            distance[a] = distance[current] + 1
+            queue.unshift(a)
+         end
+        end
+    end
+      distance
+  end
+
+    def connected_component(root)
+      distances = BFS_distance(root)
+      adjacent = []
+      (0...distances.size).each do |i|
+        adjacent << i unless distances[i] == Float::INFINITY
+      end
+      adjacent
+    end
+
+    def number_of_components
+      visited = Array.new(size)
+      visited.fill(false)
+      counter = 0
+      (0...size).each do |i|
+        next if visited[i] == true
+        counter += 1
+        comp = connected_component(i)
+        comp.each do |reachable|
+          visited[reachable] = true
+        end
+      end
+      counter
+    end
+
+    def worst_case_diameter
+      real_bad = number_of_components > 1 ? Float::INFINITY : 0
+      worst = 0
+      if real_bad == 0
         (0...size).each do |i|
-          next if visited[i] == true 
-          counter += 1 
-          comp = connected_component(i) 
-          comp.each do |reachable| 
-            visited[reachable] = true 
-          end 
-        end 
-        counter
-      end 
-
-      def worst_case_diameter
-        real_bad = number_of_components > 1 ? Float::INFINITY : 0
-        worst = 0
-        if real_bad == 0
-          (0...size).each do |i|
-           distances = BFS_distance(i)
-           worst = [distances.max, worst].max 
-         end 
-       end 
-       [worst, real_bad].max 
-     end 
+          distances = BFS_distance(i)
+          worst = [distances.max, worst].max
+        end
+     end
+      [worst, real_bad].max
+   end
 
-     def average_case_diameter
+    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)
-          average = distances.inject(:+).to_f / (size - 1) 
-          total += average 
-        end 
-      end 
-      total / size 
-    end 
-
-    def clustering_coefficient 
+          average = distances.inject(:+).to_f / (size - 1)
+          total += average
+        end
+      end
+      total / size
+   end
+
+    def clustering_coefficient
       total_cluster = 0
       (0...size).each do |i|
         neighbors = adjacent_nodes(i)
-        k = neighbors.size 
-        possible_connections = k.to_f * (k - 1) / 2 
+        k = neighbors.size
+        possible_connections = k.to_f * (k - 1) / 2
         actual_connections = 0
         (0...k).each do |l|
-          (i+1...k).each do |j| 
+          (i + 1...k).each do |j|
             actual_connections += 1 if edge?(neighbors[l], neighbors[j])
-          end 
-        end 
+          end
+        end
         if possible_connections == 0 then clustering = 0
         else clustering = actual_connections.to_f / possible_connections
-        end 
-        total_cluster += clustering 
-      end 
-      total_cluster / size 
-    end 
-
-
-
-
-  end 
+        end
+        total_cluster += clustering
+      end
+      total_cluster / size
+    end
+  end
 end

data/lib/random_graph/random_generators.rb

@@ -26,28 +26,13 @@ module RandomGraph
         to = 0
         begin
          # select a random number, representing on of the possible edges
-         r = rand(0...n**2)
-         # mapping from random number to edges, such that all edges
-         # can be selected with equal probabilities
-         from = r / n
-         to = r % n
-
-         # Keeps adjacency matrix upper triangular by mapping equivalent
-         # r values
-         if from < to
-           temp = from
-           from = to
-           to = temp
-           r = (from * n) + to
-         end
-         # make sure edge has not been slescted, and that it is not a
-         # self loop
-         valid_edge = !added_edges.key?(r) && (from != to)
+         from = rand(0...n)
+         to = rand(0...n)
+         valid_edge = !g.edge?(from, to) && (from != to)
        end until valid_edge == true
-       added_edges[r] = true
-       g.add_edge(from, to)
-     end
-     g
+        g.add_edge(from, to)
+      end
+      g
    end
 
     # Create a graph with n nodes, where all edges have a probability p
@@ -139,7 +124,7 @@ module RandomGraph
         g.add_edge(i, right)
       end
       (0...n**2).each do |i|
-        next if rand > p 
+        next if rand > p
         top = i - n
         top += n**2 if top < 0
         bottom = (i + n) % n**2

data/lib/random_graph/version.rb

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

data/random_graph.gemspec

@@ -10,7 +10,7 @@ Gem::Specification.new do |spec|
   spec.email         = ['fsel@sas.upenn.edu']
 
   spec.summary       = 'Gem for generating random graphs'
-  spec.description   = 'This gem implements the following random 
+  spec.description   = 'This gem implements the following random
     network generation models: Erdos-Renyi GNM and GNP, Watts-Strogatz,
     and preferential attachement. It also implements graph algorithms to
     study the randomly generated graphs.'
@@ -27,4 +27,5 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency 'rspec', '~> 3.4'
   spec.add_development_dependency 'simplecov', '~> 0.10'
   spec.add_runtime_dependency 'ruby-graphviz', '~> 1.2'
+  spec.add_runtime_dependency 'gruff', '~> 0.6'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: random_graph
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - fselame
@@ -80,9 +80,25 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '1.2'
-description: "This gem implements the following random \n    network generation models:
-  Erdos-Renyi GNM and GNP, Watts-Strogatz,\n    and preferential attachement. It also
-  implements graph algorithms to\n    study the randomly generated graphs."
+- !ruby/object:Gem::Dependency
+  name: gruff
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
+description: |-
+  This gem implements the following random
+      network generation models: Erdos-Renyi GNM and GNP, Watts-Strogatz,
+      and preferential attachement. It also implements graph algorithms to
+      study the randomly generated graphs.
 email:
 - fsel@sas.upenn.edu
 executables: []
@@ -102,8 +118,13 @@ files:
 - bin/.DS_Store
 - bin/console
 - bin/setup
-- graph_0.png
-- graph_1.png
+- examples/.DS_Store
+- examples/sample01.rb
+- examples/sample02.rb
+- examples/sample03.png
+- examples/sample03.rb
+- examples/sample04.png
+- examples/sample04.rb
 - lib/.DS_Store
 - lib/random_graph.rb
 - lib/random_graph/.DS_Store