rbgraph 0.1.3 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 31b24e4c2c99bcbb6f05cc1b4eb7204e33f8f1e0
-  data.tar.gz: ef21129413405b2af54baed48820688e44c0b692
+  metadata.gz: bf0651e43311d3e309fc16dc6a295cbaa6a22d01
+  data.tar.gz: 74de94cc9f37c30a21e0dd71932362502e67fb92
 SHA512:
-  metadata.gz: fe770bb5fee84e7ad1f0a6aad1da05fcac31c5549356a0abc368bc2f658ccbd64722c1beccada0473a6dc4800cc829ff799c96cc96a41adf1f10947e901fcc94
-  data.tar.gz: 0a32f8f6c07ed88bbc936f53b10f1f9f5b06434c27522186d474263fd157bf33a450ec4843e4a70356ee3a203cad52f01b9ec15ff2a0c79b90199032f6adc0e4
+  metadata.gz: c10c70096241736953e7dc983f897b6e72749280a79f02830b999b783ba4c46dd6b0b16b46c35ad89ba46b4cbea905bb1735300381861689188b268725a09cef
+  data.tar.gz: 4d7543bae183a0f6b17bf9e06bc86746376c8e80cdd7fa884ff36e413718257835844e1a44230e09b5739b326bd7b471eeb469352ca2252b9c25b0833cffcb2a

data/README.md

@@ -93,5 +93,15 @@ graph.edges["1==2"].to_json
 # => {"id":"1==2","directed":false,"weight":14}
 ```
 
+Version 0.2.0+
+
+Can now find connected components in a directed graph, without respecting the direction
+```ruby
+graph = Rbgraph::DirectedGraph.new()
+... # add nodes and edges
+t = Rbgraph::Traverser::BfsTraverser.new(graph)
+c = t.connected_components(respect_direction: false)
+```
+
 ### 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/graphs/directed.rb

@@ -8,9 +8,7 @@ module Rbgraph
 
       def connect_nodes(node1, node2, edge)
         node1.connect_to(node2, edge)
-        if node2.edges[edge.id].nil?
-          node2.edges[edge.id] ||= edge
-        end
+        node2.edges[edge.id] ||= edge
       end
 
     end

data/lib/rbgraph/node.rb

@@ -35,10 +35,8 @@ module Rbgraph
     end
 
     def connect_to(node, edge)
-      if neighbors[node.id].nil? && edges[edge.id].nil?
-        neighbors[node.id] ||= node
-        edges[edge.id] ||= edge
-      end
+      neighbors[node.id] ||= node
+      edges[edge.id] ||= edge
       self
     end
 

data/lib/rbgraph/traverser/bfs_traverser.rb

@@ -15,19 +15,19 @@ module Rbgraph
         self.unvisited_nodes = Set.new [*graph.nodes.values]
       end
 
-      def connected_components
+      def connected_components(options = {})
         self.visited_nodes = Set.new
         self.queue = Queue.new
 
         while !unvisited_nodes.empty? do
           root = unvisited_nodes.to_a.first
           unvisited_nodes.delete(unvisited_nodes.to_a.first)
-          self.connected_subgraphs << bfs_from_root(root)
+          self.connected_subgraphs << bfs_from_root(root, options)
         end
         connected_subgraphs
       end
 
-      def bfs_from_root(root)
+      def bfs_from_root(root, options = {})
         subgraph = graph.class.new
         visited_nodes.add(root)
         queue.enq(root)
@@ -37,6 +37,7 @@ module Rbgraph
           yield(t) if block_given? # do sth on current node
           subgraph.nodes[t.id] ||= t
           t.edges.each do |eid, edge|
+            next if graph.directed? && !edge.out_for?(t) unless options[:respect_direction] == false
             neighbor = edge.other_node(t)
             subgraph.edges[eid] ||= edge
             subgraph.nodes[neighbor.id] ||= neighbor

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rbgraph
 version: !ruby/object:Gem::Version
-  version: 0.1.3
+  version: 0.2.0
 platform: ruby
 authors:
 - George Lamprianidis