rgraph 0.0.15 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a8b930efb8ed11c31dacaee01435737d719d91dd
-  data.tar.gz: 86ba6f3a3c0985a29da1c0819c4fd99af9803c5d
+  metadata.gz: 2be82f7a8925ee33f06108c11c294e22f9afd4fd
+  data.tar.gz: 8123623213d0101ca164bb1e4225fc79f8f4a49c
 SHA512:
-  metadata.gz: d073c066a225bc4bb874739bffcec43715410d8ef8b1cddececc47807650c8edf12bcf515216e466a51a8c6e1ceb08ace176c48f5f34d1c988807edb8abe7ad7
-  data.tar.gz: 0d3490d9524aca751f01cc92ddeb7f9bc95e5117d46d9644197221ecb5c33432025b0debf83d470f734816f37a0daf5844c58b58b06da1fc15e3d37274fecced
+  metadata.gz: 0a45882e191a2da840cc67a973a242159d9a1ce24187dcaa32a042ab87024e2cb85afd837d4e6ddbe48668064dd7ab1cb02874f4045b8d1c8bf991be4e77bb8a
+  data.tar.gz: 43da8cf461fb090a8e84947c4b58ae97df2955969b132383eb348f3079da102972ca4191ef5e5dca8ea5ac26455c15851678596db321e838e57d7ed13d86bdbd

data/.travis.yml

@@ -1,5 +1,5 @@
 language: ruby
 rvm:
-  - "1.9.2"
   - "1.9.3"
   - "2.0.0"
+  - "2.1.0"

data/Gemfile

@@ -1,4 +1,3 @@
 source 'https://rubygems.org'
 
-# Specify your gem's dependencies in rgraph.gemspec
 gemspec

data/Rakefile

@@ -1,7 +1,10 @@
 require "bundler/gem_tasks"
 require "rspec/core/rake_task"
+require 'rake/extensiontask'
+
+Rake::ExtensionTask.new('fw')
 
 RSpec::Core::RakeTask.new
 
-task :default => :spec
-task :test => :spec
+task :default => [:compile, :spec]
+task :test => [:compile, :spec]

data/ext/fw/extconf.rb

@@ -0,0 +1,5 @@
+require "mkmf"
+
+$CFLAGS << ' -O3 -Wextra -Wall -pedantic -std=gnu99 '
+
+create_makefile "fw"

data/ext/fw/fw.c

@@ -0,0 +1,32 @@
+#include <ruby.h>
+
+static VALUE fw(VALUE arr1, VALUE path) {
+  int i, j, k;
+  float ij, ik, kj, new_distance;
+  int size;
+
+  size = RARRAY_LEN(arr1);
+
+  for(k = 0; k < size; k++) {
+    for (i = 0; i < size; i++){
+      for (j = 0; j < size; j++) {
+        ij = NUM2DBL(rb_ary_entry(rb_ary_entry(arr1, i), j));
+        ik = NUM2DBL(rb_ary_entry(rb_ary_entry(arr1, i), k));
+        kj = NUM2DBL(rb_ary_entry(rb_ary_entry(arr1, k), j));
+        new_distance = ik + kj;
+        if(ij > new_distance) {
+          rb_ary_store(rb_ary_entry(arr1, i), j, rb_float_new(new_distance));
+          rb_ary_store(rb_ary_entry(path, i), j, rb_ary_new3(1, rb_float_new(k)));
+        }
+        if((ij == new_distance) && !RTEST(rb_ary_includes(rb_ary_entry(rb_ary_entry(path, i), j), rb_float_new(k)))&&  !(i == k || j == k)) {
+          rb_ary_push(rb_ary_entry(rb_ary_entry(path, i), j), rb_float_new(k));
+        }
+      }
+    }
+  }
+  return arr1;
+}
+
+void Init_fw() {
+  rb_define_method(rb_cArray, "fw!", fw, 1);
+}

data/lib/rgraph/graph.rb

@@ -1,5 +1,6 @@
 #encoding: utf-8
 require 'csv'
+require 'fw'
 require_relative '../../lib/rgraph/link'
 require_relative '../../lib/rgraph/node'
 
@@ -12,7 +13,7 @@ class Graph
   end
 
   def initialize(csv)
-    @nodes = []
+    @nodes = {}
     @links = []
     @distance = nil
     @infinity = 100_000
@@ -36,7 +37,7 @@ class Graph
   end
 
   def each_node(&block)
-    @nodes.each(&block)
+    @nodes.each_value(&block)
   end
 
   def each_link(&block)
@@ -44,7 +45,7 @@ class Graph
   end
 
   def degrees
-    @nodes.map{|node| node.degree}
+    @nodes.values.map{|node| node.degree}
   end
 
   def average_degree
@@ -59,12 +60,10 @@ class Graph
   def idistance
     dist = matrix(@nodes.size, 0)
 
-    sorted = @nodes.sort { |a,b| a.id <=> b.id}
-
-    sorted.each_with_index do |n1, i|
-      sorted.each_with_index do |n2, j|
+    @nodes.values.each_with_index do |n1, i|
+      @nodes.values.each_with_index do |n2, j|
         next if i == j
-        dist[i][j] = n1.has_neighbour?(n2) ? link_between(n1, n2).weight.to_i : @infinity
+        dist[i][j] = n1.has_neighbour?(n2) ? link_between(n1, n2)[:weight].to_i : @infinity
       end
     end
     dist
@@ -72,23 +71,7 @@ class Graph
 
   def distances
     @path = matrix(@nodes.size, [nil])
-
-    @distance = idistance
-    @distance.each_index do |k|
-      @distance.each_index do |i|
-        @distance.each_index do |j|
-          new_dist = @distance[i][k] + @distance[k][j]
-          if @distance[i][j] > new_dist
-            @distance[i][j] = new_dist
-            @path[i][j] = [k]
-          end
-          if @distance[i][j] == new_dist && !(@path[i][j].include? k) && ! [i,j].include?(k)
-            @path[i][j] << k
-          end
-        end
-      end
-    end
-    @distance
+    @distance = idistance.fw!(@path)
   end
 
   def mdistance
@@ -107,7 +90,7 @@ class Graph
     distances
     giant_component
 
-    nodes = giant ? @giant_component : @nodes
+    nodes = giant ? @giant_component : @nodes.values
 
     0.upto(nodes.size - 1).each do |i|
       (i + 1).upto(nodes.size - 1).each do |j|
@@ -119,7 +102,7 @@ class Graph
   end
 
   def shortest_path(i, j, multiples = false, giant = false)
-    nodes = giant ? @giant_component : @nodes
+    nodes = giant ? @giant_component : @nodes.values
 
     return [] if @distance[i][j] == @infinity
 
@@ -204,7 +187,7 @@ class Graph
   end
 
   def clustering
-    nodes.map{ |node| single_clustering(node) }.inject(:+) / nodes.size.to_f
+    nodes.values.map{ |node| single_clustering(node) }.inject(:+) / nodes.size.to_f
   end
 
   def page_rank(d = 0.85, e = 0.01)
@@ -213,7 +196,7 @@ class Graph
     #Initial values
     @page_rank = Array.new(n, 1 / n.to_f)
 
-    while true
+    loop do
       return @page_rank if @page_rank.inject(:+) - step_page_rank(d, e).inject(:+) < e
     end
   end
@@ -225,7 +208,7 @@ class Graph
 
     @distance.each do |d|
       same = []
-      d.each_with_index { |dist, i| same << @nodes[i] if dist != @infinity}
+      d.each_with_index { |dist, i| same << @nodes.values[i] if dist != @infinity}
 
       #its a new component
       if @components.select{ |c| c.include?(same.first) }.size == 0
@@ -252,13 +235,13 @@ class Graph
     n = @nodes.count
     tmp = Array.new(n, 0)
 
-    @nodes.each_with_index do |node,i|
+    @nodes.values.each_with_index do |node,i|
       #How much 'node' will give to its neighbours
       to_neighbours = @page_rank[i] / node.neighbours.count
 
       #Give 'to_neighbours' to each neighbour
       node.neighbours.each do |ne|
-        j = @nodes.index(ne)
+        j = @nodes.values.index(ne)
         tmp[j] += to_neighbours
       end
     end
@@ -268,12 +251,12 @@ class Graph
   end
 
   def get_node_by_id(node_id)
-    @nodes.select{|n| n.id == node_id}.first
+    @nodes[node_id]
   end
 
   def maybe_add_to_nodes(*nodes)
     nodes.each do |node|
-      @nodes << node unless get_node_by_id(node.id)
+      @nodes[node[:id]] = node unless get_node_by_id(node[:id])
     end
   end
 

data/lib/rgraph/link.rb

@@ -1,25 +1,24 @@
 class Link
   attr_accessor :source, :target, :type
 
-  def initialize(arg)
-    @args = arg
-    @source = @args.delete(:source)
-    @target = @args.delete(:target)
-    @type = @args.delete(:type) || 'undirected'
+  def initialize(attributes)
+    @attributes = attributes
+    @source = @attributes.delete(:source)
+    @target = @attributes.delete(:target)
+    @type = @attributes.delete(:type) || 'undirected'
 
     raise Exception.new("source cant be nil") unless @source
     raise Exception.new("target cant be nil") unless @target
     raise Exception.new("source must be of type Node") unless @source.is_a? Node
     raise Exception.new("target must be of type Node") unless @target.is_a? Node
 
-    @args[:weight] ||= 1
+    @attributes[:weight] ||= 1
 
     @source.neighbours << @target
     @target.neighbours << @source unless @type == 'directed'
   end
 
-  def method_missing(name, *args)
-    super unless args.empty?
-    @args[name]
+  def [](attribute)
+    @attributes[attribute]
   end
 end

data/lib/rgraph/node.rb

@@ -1,8 +1,8 @@
 class Node
   attr_accessor :neighbours
 
-  def initialize(arg)
-    @args = arg
+  def initialize(attributes)
+    @attributes = attributes
     @neighbours = []
   end
 
@@ -14,8 +14,7 @@ class Node
     @neighbours.include?(node)
   end
 
-  def method_missing(name, *args)
-    super unless args.empty?
-    @args[name]
+  def [](attribute)
+    @attributes[attribute]
   end
 end

data/lib/rgraph/version.rb

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

data/rgraph.gemspec

@@ -1,4 +1,3 @@
-# coding: utf-8
 lib = File.expand_path('../lib', __FILE__)
 $LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
 require 'rgraph/version'
@@ -6,19 +5,22 @@ require 'rgraph/version'
 Gem::Specification.new do |spec|
   spec.name          = "rgraph"
   spec.version       = Rgraph::VERSION
-  spec.authors       = ["Lucas Aride Moulin", "Michel Boaventura"]
-  spec.email         = ["aride.moulin@gmail.com", "michel@michelboaventura.com"]
+  spec.authors       = ["Michel Boaventura"]
+  spec.email         = ["michel@michelboaventura.com"]
   spec.description   = "Ruby's Graph Library"
   spec.summary       = "A Ruby's Graph Library"
-  spec.homepage      = "http://github.com/akz92/rgraph"
+  spec.homepage      = "http://github.com/michelboaventura/rgraph"
   spec.license       = "MIT"
 
   spec.files         = `git ls-files`.split($/)
   spec.test_files    = spec.files.grep(%r{^spec/})
   spec.require_paths = ["lib"]
 
-  spec.add_development_dependency "bundler", "~> 1.3"
-  spec.add_development_dependency "rake"
-  spec.add_development_dependency "rspec", "~> 2.14.1"
-  spec.add_development_dependency "guard-rspec", "~> 3.0.2"
+  spec.extensions = %w[ext/fw/extconf.rb]
+
+  spec.add_development_dependency "bundler", "~> 1.7.3"
+  spec.add_development_dependency "rake", "~> 10.3.2"
+  spec.add_development_dependency "rake-compiler", "~> 0.9.3"
+  spec.add_development_dependency "rspec", "~> 3.1.0"
+  spec.add_development_dependency "guard-rspec", "~> 4.3.1"
 end

data/spec/rgraph/graph_spec.rb

@@ -11,8 +11,8 @@ describe Graph do
     end
 
     it "creates all neighbours" do
-      nodes = subject.nodes[1..-1]
-      expect(subject.nodes.first.neighbours).to eq(nodes)
+      nodes = subject.nodes.values[1..-1]
+      expect(subject.nodes.values.first.neighbours).to eq(nodes)
     end
 
     it "creates three links" do
@@ -20,9 +20,9 @@ describe Graph do
     end
 
     it "gets all nodes one by one" do
-      nodes = []
+      nodes = {}
       subject.each_node do |node|
-        nodes << node
+        nodes[node[:id]] = node
       end
       expect(subject.nodes).to eq(nodes)
     end
@@ -47,13 +47,13 @@ describe Graph do
 
     it "understands directed graph" do
       graph = Graph.new_from_string("source,target,type\n1,2,directed")
-      expect(graph.nodes.first.neighbours.count).to eq(1)
-      expect(graph.nodes.last.neighbours.count).to eq(0)
+      expect(graph.nodes.values.first.neighbours.count).to eq(1)
+      expect(graph.nodes.values.last.neighbours.count).to eq(0)
       expect(graph.links.count).to eq(1)
     end
   end
 
-  describe "Metrics" do
+  describe "Degree" do
     subject { Graph.new('spec/fixtures/three_links.csv') }
 
     it "sets default infinity to 100_000" do
@@ -77,22 +77,22 @@ describe Graph do
     it "calculates the initial distance matrix" do
       k = subject.infinity
       expect(subject.idistance).to eq(
-        [[0,1,k,k,1,k],
-         [1,0,1,k,1,k],
-         [k,1,0,1,k,k],
-         [k,k,1,0,1,1],
-         [1,1,k,1,0,k],
-         [k,k,k,1,k,0]])
+        [[0,1,1,k,k,k],
+         [1,0,1,1,k,k],
+         [1,1,0,k,1,k],
+         [k,1,k,0,1,k],
+         [k,k,1,1,0,1],
+         [k,k,k,k,1,0]])
     end
 
     it "calculates distances" do
       expect(subject.distances).to eq(
-        [[0,1,2,2,1,3],
-         [1,0,1,2,1,3],
-         [2,1,0,1,2,2],
-         [2,2,1,0,1,1],
-         [1,1,2,1,0,2],
-         [3,3,2,1,2,0]])
+        [[0,1,1,2,2,3],
+         [1,0,1,1,2,3],
+         [1,1,0,2,1,2],
+         [2,1,2,0,1,2],
+         [2,2,1,1,0,1],
+         [3,3,2,2,1,0]])
     end
 
     it "calculates the mean distance" do
@@ -139,25 +139,28 @@ describe Graph do
     it "calculates the shortest paths" do
       expect(subject.shortest_paths.sort).to eq(
         [[0, 1],
-         [0, 1, 2],
-         [0, 4],
-         [0, 4, 3],
-         [0, 4, 3, 5],
+         [0, 1, 3],
+         [0, 2],
+         [0, 2, 4],
+         [0, 2, 4, 5],
          [1, 2],
-         [1, 2, 3],
-         [1, 2, 3, 5],
-         [1, 4],
-         [2, 1, 4],
-         [2, 3],
-         [2, 3, 5],
-         [3, 4], [3, 5],
-         [4, 3, 5]].sort)
+         [1, 2, 4],
+         [1, 2, 4, 5],
+         [1, 3],
+         [2, 1, 3],
+         [2, 4],
+         [2, 4, 5],
+         [3, 4],
+         [3, 4, 5],
+         [4, 5]].sort)
     end
+
     it "returns multiples short paths when asked" do
       g = Graph.new_from_string("source,target\n1,2\n2,3\n1,4\n4,3")
       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)
@@ -169,61 +172,82 @@ describe Graph do
       expect(g.betweenness(giant: true)).to eq([0, 1 / 3.0, 1 / 3.0, 0, 0, 0])
     end
 
+    #FIXME - should be 17!!!
     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)
-      expect(subject.between(2)).to eq(2 / 18.0)
-      expect(subject.between(3)).to eq(6 / 18.0)
-      expect(subject.between(4)).to eq(4 / 18.0)
-      expect(subject.between(5)).to eq(0 / 18.0)
+      expect(subject.between(0)).to eq(0 / 17.0)
+      expect(subject.between(1)).to eq(2 / 17.0)
+      expect(subject.between(2)).to eq(4 / 17.0)
+      expect(subject.between(3)).to eq(1 / 17.0)
+      expect(subject.between(4)).to eq(5 / 17.0)
+      expect(subject.between(5)).to eq(0 / 17.0)
     end
+
     it "calculates all betweenness" do
       expect(subject.betweenness).to eq(
-        [0 / 18.0,
-         2 / 18.0,
-         2 / 18.0,
-         6 / 18.0,
-         4 / 18.0,
-         0 / 18.0])
+        [0 / 17.0,
+         2 / 17.0,
+         4 / 17.0,
+         1 / 17.0,
+         5 / 17.0,
+         0 / 17.0])
     end
+
     it "calculates all betweenness normalized" do
-      expect(subject.betweenness(normalized: true)).to eq(
-        [0.0, 1 / 3.0, 1 / 3.0, 1.0, 2 / 3.0, 0.0])
+      bts = subject.betweenness
+      min = bts.min
+      max = bts.max
+
+      bts.map!{|bt| (bt - min) / (max - min)}
+
+      expect(subject.betweenness(normalized: true)).to eq(bts)
     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 cumulative betweenness" do
-      expect(subject.betweenness(cumulative: true)).to eq([[6, 0.0], [4, 1 / 3.0], [2, 2 / 3.0], [1, 1.0]])
+      bts = subject.betweenness(normalized: true)
+
+      bts = bts.uniq.sort.map{ |bt1| [bts.select{|bt2| bt2 >= bt1}.count, bt1] }
+
+      expect(subject.betweenness(cumulative: true)).to eq(bts)
     end
+
     it "calculates diameter" do
       expect(subject.diameter).to eq(3)
     end
+
     it "calculates farness" do
-      expect(subject.farness).to eq([9,8,8,7,7,11])
+      expect(subject.farness).to eq([9,8,7,8,7,11])
     end
+
     it "calculates closeness" do
-      expect(subject.closeness).to eq([1/9.0,1/8.0,1/8.0,1/7.0,1/7.0,1/11.0])
+      expect(subject.closeness).to eq([1/9.0,1/8.0,1/7.0,1/8.0,1/7.0,1/11.0])
     end
+
     it "returns the graph's components" 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]])
+      expect(g.components).to eq([g.nodes.values[0..1], g.nodes.values[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}
+      nodes = subject.nodes.values
 
       expect(subject.single_clustering(nodes[0])).to eq(1.0/1.0)
       expect(subject.single_clustering(nodes[1])).to eq(1.0/3.0)
-      expect(subject.single_clustering(nodes[2])).to eq(0.0/1.0)
-      expect(subject.single_clustering(nodes[3])).to eq(0.0/3.0)
-      expect(subject.single_clustering(nodes[4])).to eq(1.0/3.0)
+      expect(subject.single_clustering(nodes[2])).to eq(1.0/3.0)
+      expect(subject.single_clustering(nodes[3])).to eq(0.0/1.0)
+      expect(subject.single_clustering(nodes[4])).to eq(0.0/3.0)
       expect(subject.single_clustering(nodes[5])).to eq(0.0/1.0)
     end
+
     it "calculates clustering of all nodes" do
       expect(subject.clustering).to eq((1.0/1.0 + 2.0/3.0) / 6.0)
     end
@@ -233,11 +257,13 @@ describe Graph do
       pr = Graph.new_from_string("source,target,type\n1,2,directed").page_rank
       expect(pr.first).to be < pr.last
     end
+
     it "calculates with three nodes within a line" do
       pr = Graph.new_from_string("source,target,type\n1,2,directed\n2,3,directed").page_rank
       expect(pr[0]).to be < pr[1]
       expect(pr[1]).to be < pr[2]
     end
+
     it "calculates with two nodes pointing to the same" do
       pr = Graph.new_from_string("source,target,type\n1,2,directed\n3,2,directed").page_rank
       expect(pr[0]).to be < pr[1]
@@ -251,6 +277,7 @@ describe Graph do
       expect(pr[1]).to eq(pr[2])
       expect(pr.inject(:+)).to eq(1)
     end
+
     it "calculates with two subgraphs" do
       pr = Graph.new_from_string("source,target,type\n1,2,directed\n3,4,directed\n3,1,directed").page_rank
       expect(pr[0]).to be < pr[1]

data/spec/rgraph/link_spec.rb

@@ -5,10 +5,13 @@ require_relative '../../lib/rgraph/node'
 describe Link do
   describe "creates a link without a weight" do
     subject { Link.new(source: Node.new(id: 1), target: Node.new(id: 2), years: [2011, 2012]) }
-    its(:source) { should be_kind_of Node }
-    its(:target) { should be_kind_of Node }
-    its(:weight) { should == 1 }
-    its(:years) { should == [2011, 2012] }
+
+    it "returns its attributes" do
+      expect(subject.source).to be_kind_of(Node)
+      expect(subject.target).to be_kind_of(Node)
+      expect(subject[:weight]).to eq(1)
+      expect(subject[:years]).to eq([2011,2012])
+    end
 
     it "checks the creation of neighbours" do
       expect(subject.source.neighbours).to eq([subject.target])
@@ -23,10 +26,9 @@ describe Link do
 
   end
 
-  describe "creates a link passing a weight" do
-    subject { Link.new(source: Node.new(id: 00001), target: Node.new(id: 00002), weight: 4, years: [2011, 2012]) }
-    its(:weight) { should == 4 }
-
+  it "creates a link passing a weight" do
+    link = Link.new(source: Node.new(id: 00001), target: Node.new(id: 00002), weight: 4, years: [2011, 2012])
+    expect(link[:weight]).to eq(4)
   end
 
   it "doesn't create a link without source" do

data/spec/rgraph/node_spec.rb

@@ -2,22 +2,24 @@ require_relative '../../lib/rgraph/node'
 
 describe Node do
   subject { Node.new(name: "Lucas", id: '1', age: 20) }
-  describe "#new" do
-    its(:name) { should eq "Lucas" }
-    its(:id) { should eq '1' }
-    its(:age) { should eq 20 }
-  end
 
-  describe "#degree" do
-    its(:degree) { should eq 0}
+  context "#new" do
+    it "returns its attributes" do
+      expect(subject[:name]).to eq("Lucas")
+      expect(subject[:id]).to eq('1')
+      expect(subject[:age]).to eq(20)
+    end
+    it "knows it degree" do
+      expect(subject.degree).to eq(0)
+    end
   end
 
-  describe "#has_neighbour" do
+  context "#has_neighbour" do
     it "recognizes its neighbour" do
       n1 = Node.new(id: 1)
       n2 = Node.new(id: 1)
       n1.neighbours << n2
-      expect(n1.has_neighbour?(n2)).to be_true
+      expect(n1.has_neighbour?(n2)).to be true
     end
   end
 end

metadata

@@ -1,89 +1,104 @@
 --- !ruby/object:Gem::Specification
 name: rgraph
 version: !ruby/object:Gem::Version
-  version: 0.0.15
+  version: 0.1.1
 platform: ruby
 authors:
-- Lucas Aride Moulin
 - Michel Boaventura
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-09-15 00:00:00.000000000 Z
+date: 2014-09-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.3'
+        version: 1.7.3
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.3'
+        version: 1.7.3
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '0'
+        version: 10.3.2
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - '>='
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '0'
+        version: 10.3.2
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.9.3
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.9.3
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.14.1
+        version: 3.1.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.14.1
+        version: 3.1.0
 - !ruby/object:Gem::Dependency
   name: guard-rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 3.0.2
+        version: 4.3.1
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 3.0.2
+        version: 4.3.1
 description: Ruby's Graph Library
 email:
-- aride.moulin@gmail.com
 - michel@michelboaventura.com
 executables: []
-extensions: []
+extensions:
+- ext/fw/extconf.rb
 extra_rdoc_files: []
 files:
-- .gitignore
-- .rspec
-- .travis.yml
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
 - Gemfile
 - Guardfile
 - LICENSE
 - README.md
 - Rakefile
 - bin/guard
+- ext/fw/extconf.rb
+- ext/fw/fw.c
 - lib/rgraph.rb
 - lib/rgraph/graph.rb
 - lib/rgraph/link.rb
@@ -100,7 +115,7 @@ files:
 - spec/rgraph/node_spec.rb
 - spec/rgraph/rgraph_spec.rb
 - spec/spec_helper.rb
-homepage: http://github.com/akz92/rgraph
+homepage: http://github.com/michelboaventura/rgraph
 licenses:
 - MIT
 metadata: {}
@@ -110,17 +125,17 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.3
+rubygems_version: 2.4.1
 signing_key: 
 specification_version: 4
 summary: A Ruby's Graph Library