hierarchical_graph 1.0.2 → 1.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: a6c1ce470102ca17f36f40fe0f861c221c18237b46fa07d066baed98895501c8
-  data.tar.gz: '08cf95bf13e8217262973a222cb213de9559777170253460acfb6b9856316f1d'
+  metadata.gz: b06e425f1dbfef479fc43a6c77574d7f39eea429e6b7c2f772cab22fa9a6c0b8
+  data.tar.gz: 7c7a7b5c3ac89569b47f6c2acf4a40a95da52ea0d397c668fb369c15be0f0c60
 SHA512:
-  metadata.gz: 8e14241d62a3ffac4fa02fcf4c0ed37f7456658510a0e26ef17c63155dd5f9368fbe21dedd03c52182d86189523ef98df0cd4e1018c770f971e2b2e2077c1258
-  data.tar.gz: 97ed130cabcd32d51266c9fe5bcf7c606c11577746c87a5ba2e169b756b4abd7f9002def04e9bc0218ca8e7df838a0c9e843c634e90fde72ce6cbb771cebbf8b
+  metadata.gz: 2d4dafcb3372f016ce1e6b79ec3b6a5346d410d54fa156d2c66bae8f7c33963c51d64ced1591e7e1755ad699da7e62c36556b907c5cdf831b2b3d60df965932d
+  data.tar.gz: 6a5d195ef7d30f9885734a5d156ef742a457e911d7d5a7e8edf7584d01cee192b44533af5043ad4e153255316975bf2b028a241716c8a682bc2a7397f319cae5

data/lib/hierarchical_graph.rb

@@ -102,6 +102,26 @@ class HierarchicalGraph
     end.uniq(&:id)
   end
 
+  def subgraph_of(ids)
+    ids.each { |id| validate_present! id }
+
+    HierarchicalGraph.new.tap do |subgraph|
+      ids.each do |id|
+        subgraph.add_node id, nodes[id].data
+      end
+
+      subgraph.each do |node|
+        children_of(node.id).each do |child|
+          subgraph.add_relation parent_id: node.id, child_id: child.id unless subgraph[child.id].nil?
+        end
+      end
+    end
+  end
+
+  def descendants_subgraph_from(id)
+    subgraph_of [id] + descendants_of(id).map(&:id)
+  end
+
   def to_s
     "<#{self.class.name} nodes:[#{map(&:to_s).join(', ')}]>"
   end

data/lib/hierarchical_graph/node.rb

@@ -17,6 +17,10 @@ class HierarchicalGraph
       data[key] = value
     end
 
+    def root?
+      parents.empty?
+    end
+
     def parents
       graph.parents_of id
     end
@@ -33,8 +37,8 @@ class HierarchicalGraph
       graph.descendants_of id
     end
 
-    def root?
-      parents.empty?
+    def descendants_subgraph
+      graph.descendants_subgraph_from id
     end
 
     def to_s

data/lib/hierarchical_graph/version.rb

@@ -1,3 +1,3 @@
 class HierarchicalGraph
-  VERSION = '1.0.2'
+  VERSION = '1.1.0'
 end

data/spec/hierarchical_graph_spec.rb

@@ -253,6 +253,68 @@ describe HierarchicalGraph do
     graph.to_s.must_equal '<HierarchicalGraph nodes:[<HierarchicalGraph::Node 1 parents:[] children:[2]>, <HierarchicalGraph::Node 2 parents:[1] children:[]>]>'
   end
 
+  it 'Subgraph' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    graph.add_node 5
+    graph.add_node 6
+    graph.add_relation parent_id: 1, child_id: 2
+    graph.add_relation parent_id: 1, child_id: 3
+    graph.add_relation parent_id: 2, child_id: 4
+    graph.add_relation parent_id: 3, child_id: 4
+    graph.add_relation parent_id: 3, child_id: 5
+    graph.add_relation parent_id: 4, child_id: 5
+    graph.add_relation parent_id: 5, child_id: 6
+
+    subgraph = graph.subgraph_of [3, 4, 5]
+
+    subgraph.map(&:id).must_equal [3, 4, 5]
+
+    subgraph[3].parents.must_be_empty
+    subgraph[3].children.map(&:id).must_equal [4, 5]
+
+    subgraph[4].parents.map(&:id).must_equal [3]
+    subgraph[4].children.map(&:id).must_equal [5]
+    
+    subgraph[5].parents.map(&:id).must_equal [3, 4]
+    subgraph[5].children.must_be_empty
+  end
+
+  it 'Descendants Subgraph' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    graph.add_node 5
+    graph.add_node 6
+    graph.add_relation parent_id: 1, child_id: 2
+    graph.add_relation parent_id: 1, child_id: 3
+    graph.add_relation parent_id: 3, child_id: 4
+    graph.add_relation parent_id: 3, child_id: 5
+    graph.add_relation parent_id: 4, child_id: 5
+    graph.add_relation parent_id: 5, child_id: 6
+
+    subgraph = graph.descendants_subgraph_from 3
+
+    subgraph.map(&:id).must_equal [3, 4, 5, 6]
+    
+    subgraph[3].parents.must_be_empty
+    subgraph[3].children.map(&:id).must_equal [4, 5]
+
+    subgraph[4].parents.map(&:id).must_equal [3]
+    subgraph[4].children.map(&:id).must_equal [5]
+    
+    subgraph[5].parents.map(&:id).must_equal [3, 4]
+    subgraph[5].children.map(&:id).must_equal [6]
+
+    subgraph[6].parents.map(&:id).must_equal [5]
+    subgraph[6].children.must_be_empty
+  end
+
   describe 'Node' do
 
     let :graph do
@@ -312,6 +374,16 @@ describe HierarchicalGraph do
       graph[2][:code].must_equal 'node_2'
     end
 
+    it 'Descendants Subgraph' do
+      node = graph[3]
+      subgraph = node.descendants_subgraph
+
+      subgraph.roots.map(&:id).must_equal [3]
+      subgraph[3].children.map(&:id).must_equal [4]
+      subgraph[4].children.map(&:id).must_equal [5]
+      subgraph[5].children.must_be_empty
+    end
+
   end
 
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hierarchical_graph
 version: !ruby/object:Gem::Version
-  version: 1.0.2
+  version: 1.1.0
 platform: ruby
 authors:
 - Gabriel Naiman
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2020-10-29 00:00:00.000000000 Z
+date: 2021-02-26 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake