rbgraph 0.0.6 → 0.0.7

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 30f582c64c3e5b6aba3716ee81c606164db386dd
-  data.tar.gz: e2255e174f3282c5cd56441575bb045527850338
+  metadata.gz: a0fe2bf64b05c39412353c43e2b61be62802eba8
+  data.tar.gz: 275c4daead8f24d392d04287e4f05c16e3538745
 SHA512:
-  metadata.gz: 846a7e5c1fe33ba95f46c1897358022b6f340ed3ee3942c49768e5721b46f713d3dcdecda76715c10fc3063fa1f758e72e3897487f90ddc293913f263dd6b195
-  data.tar.gz: 8a6f26a45e8e26e0449838d09447875f28591ebecaf988f3f5983abf898f3ec0f10e2f4558421acc422ca3d6f8dc8528fa4913e7a555ba5165ab882398fd4e6b
+  metadata.gz: 661096f726414cdd4cd59282a9844647a77389355eba19a71cd69bf5abb08c7de7c3bec7a8a94acd34e4dfa2446ca353762671eb62a7a00182615dee4da80a4e
+  data.tar.gz: e36ba691c1ccb04c3747c9169346264d701ce7e7262933930d00b88d7590fb5376fea9c7c94c13d6d0872ff7d219095fd40c5a86537ada41f6b438a9eafc722a

data/README.md

@@ -40,6 +40,14 @@ will output
 [10, 11]
 ```
 
+Version 0.0.7+
+
+Nodes support in and out degree.
+```ruby
+node.in_degree
+node.out_degree
+```
+depending on if you constructed a Directed or Undirected graph.
 
 ### Disclaimer
 This project is written on a need to use basis for inclusion to other projects I'm working on for now, so completion is not an immediate goal.

data/lib/rbgraph/edge.rb

@@ -5,6 +5,7 @@ module Rbgraph
     attr_accessor :id
     attr_accessor :node1
     attr_accessor :node2
+    attr_accessor :directed
     attr_accessor :attributes
 
     def initialize(node1, node2, attributes = {})
@@ -12,6 +13,7 @@ module Rbgraph
       self.node2 = node2
       self.attributes = attributes
       self.id = attributes[:id] || "#{node1.id}=#{attributes[:kind]}=#{node2.id}"
+      self.directed = !!attributes[:directed]
     end
 
     def ==(node)
@@ -33,6 +35,22 @@ module Rbgraph
       self
     end
 
+    def out_for?(node)
+      if directed
+        node == node1
+      else
+        node == node1 || node == node2
+      end
+    end
+
+    def in_for?(node)
+      if directed
+        node == node2
+      else
+        node == node1 || node == node2
+      end
+    end
+
   end
 
 end

data/lib/rbgraph/graphs/directed.rb

@@ -2,8 +2,15 @@ module Rbgraph
 
     class DirectedGraph < Graph
 
+      def add_edge!(node1, node2, edge_attributes = {})
+        super(node1, node2, {directed: true}.merge(edge_attributes))
+      end
+
       def connect_nodes(node1, node2, edge)
         node1.connect_to(node2, edge)
+        if node2.edges[edge.id].nil?
+          node2.edges[edge.id] ||= edge
+        end
       end
 
     end

data/lib/rbgraph/graphs/undirected.rb

@@ -2,6 +2,10 @@ module Rbgraph
 
     class UndirectedGraph < Graph
 
+      def add_edge!(node1, node2, edge_attributes = {})
+        super(node1, node2, {directed: false}.merge(edge_attributes))
+      end
+
       def connect_nodes(node1, node2, edge)
         node1.connect_to(node2, edge)
         node2.connect_to(node1, edge)

data/lib/rbgraph/node.rb

@@ -31,12 +31,28 @@ module Rbgraph
 
     def connect_to(node, edge)
       if neighbors[node.id].nil? && edges[edge.id].nil?
-        neighbors[node.id] = node
-        edges[edge.id] = edge
+        neighbors[node.id] ||= node
+        edges[edge.id] ||= edge
       end
       self
     end
 
+    def outgoing_edges
+      edges.select { |eid, edge| edge.out_for?(self) }
+    end
+
+    def incoming_edges
+      edges.select { |eid, edge| edge.in_for?(self) }
+    end
+
+    def out_degree
+      outgoing_edges.size
+    end
+
+    def in_degree
+      incoming_edges.size
+    end
+
   end
 
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rbgraph
 version: !ruby/object:Gem::Version
-  version: 0.0.6
+  version: 0.0.7
 platform: ruby
 authors:
 - George Lamprianidis
@@ -60,7 +60,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.2.2
+rubygems_version: 2.4.3
 signing_key: 
 specification_version: 4
 summary: Ruby graphs!