graphos 0.3.5 → 0.3.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 954f1ab14ea2478a159df3d397088aade9bad337
-  data.tar.gz: 05b945a9d9aa5de90260897a2cf7aac2d3949a67
+  metadata.gz: f21187c2df4b584bf41035d87bc53213ae09b03e
+  data.tar.gz: d2799e3540346b13dd14f27d482e02e451a680dc
 SHA512:
-  metadata.gz: a11b436bc5e501b84cfaeca18ff38f3accabfc37779006f749d94bd22c1f5c9d94d2cc803eddbbb51ca938d6fcc16f968ebd2b47e9799f6399cd87c94ddde0b9
-  data.tar.gz: 539c8289d370dace0d336948e227cd26cd345361ca4987d189882c9c2a291964082bde2cdc98f09d47615a4371a45b88c27d4cc864877412076e76f904f314ff
+  metadata.gz: 9d5c13999ce03fd28a13e15cb1713bf82ee9e4d3a4a244731ac4155baff19df7495939dbdc1879b25520ddceca0aba116744172285d8177813ee953023cdae57
+  data.tar.gz: 1d5e2398bc67196b87fbe8e115e28077171ddb891a9858290a67d1cce37a534968e50f8fa2aa2844adb601bb0879e7be94351e0d1e70c9f6bed87c73a0a11a07

data/lib/graphos/version.rb

@@ -1,3 +1,3 @@
 module Graphos
-  VERSION = "0.3.5"
+  VERSION = "0.3.6"
 end

data/lib/graphos/weighted/node.rb

@@ -5,32 +5,43 @@ module Graphos
     # This class represents a node in a weighted graph
 
     class Node
-      attr_reader :index, :edges
+      attr_reader :index
       def initialize index
         @index = index
         @edges = []
+        @edge_count = 0
+      end
+
+      def edges
+        return [] if @edge_count == 0
+        @edges[0..@edge_count-1]
       end
 
       def add_edge to, weight
         # Does a O(n) check deleting existing edges
-        @edges.delete_if{|n| n.to == to}
-        @edges << Edge.new(self, to, weight)
+        current_idx = @edges.index{|n| n.to == to}
+        if current_idx
+          @edges[current_idx] = Edge.new(self,to,weight)
+        else
+          @edges << Edge.new(self, to, weight)
+          @edge_count += 1
+        end
       end
 
       def degree
-        @edges.inject(0){|sum,e| sum+e.weight }
+        edges.inject(0){|sum,e| sum+e.weight }
       end
 
       def neighbor_of? index
-        @edges.any? {|node| node.to.index == index }
+        edges.any? {|node| node.to.index == index }
       end
 
       def neighbors
-        @edges.map{|edge| edge.to}
+        edges.map{|edge| edge.to}
       end
 
       def edge to
-        @edges.lazy.select{|e| e.to.index == to}.first
+        edges.lazy.select{|e| e.to.index == to}.first
       end
     end
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: graphos
 version: !ruby/object:Gem::Version
-  version: 0.3.5
+  version: 0.3.6
 platform: ruby
 authors:
 - Bernardo Amorim
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-11-12 00:00:00.000000000 Z
+date: 2014-11-14 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler