hierarchical_graph 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 9a3224dabda32c9f8a4b7ba2daff315a9c36282362acc8b509f703039e34d0cb
+  data.tar.gz: 8a290679d5683ce0566d6433c829684961fa440581c49ccedec02c27c22839f8
+SHA512:
+  metadata.gz: 0b5540cc426ca14fbd4ca929442ee493fcb6396665e801c6755dafaa01bc17ff03010d10d80cfe75354e0345b60d01b57f68575a17a08a3904463825aad54947
+  data.tar.gz: 52d18fa51a604a5b8f3724e604d430ef286c93bec32a1e7248d40b4808d2a50d6a7abb23bc5f4c6ba4bf81ef7c86ef73e3264a34c02f2dd0961e7e3888faabee

data/.coveralls.yml

@@ -0,0 +1,2 @@
+service_name: travis-ci
+repo_token: 4teGg1i7u1MnrCFFDhwfZvH9erpoQYq7T

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.ruby-gemset

@@ -0,0 +1 @@
+hierarchical_graph

data/.ruby-version

@@ -0,0 +1 @@
+ruby-2.7.0

data/.travis.yml

@@ -0,0 +1,19 @@
+language: ruby
+
+rvm:
+  - 2.1
+  - 2.2
+  - 2.3
+  - 2.4
+  - 2.5
+  - 2.6
+  - 2.7
+  - jruby-9.2.9.0
+  - ruby-head
+  - jruby-head
+
+matrix:
+  fast_finish: true
+  allow_failures:
+    - rvm: ruby-head
+    - rvm: jruby-head

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Gabriel Naiman
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,75 @@
+# HierarchicalGraph
+
+[![Gem Version](https://badge.fury.io/rb/hierarchical_graph.svg)](https://rubygems.org/gems/hierarchical_graph)
+[![Build Status](https://travis-ci.org/gabynaiman/hierarchical_graph.svg?branch=master)](https://travis-ci.org/gabynaiman/hierarchical_graph)
+[![Coverage Status](https://coveralls.io/repos/github/gabynaiman/hierarchical_graph/badge.svg?branch=master)](https://coveralls.io/github/gabynaiman/hierarchical_graph?branch=master)
+[![Code Climate](https://codeclimate.com/github/gabynaiman/hierarchical_graph.svg)](https://codeclimate.com/github/gabynaiman/hierarchical_graph)
+
+Hierarchical graph representation
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'hierarchical_graph'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install hierarchical_graph
+
+## Usage
+
+### Build graph
+```ruby
+graph = HierarchicalGraph.new
+
+graph.add_node 1, name: 'Node 1', other: 1000
+graph.add_node 2
+graph.add_node 3
+
+graph.add_relation parent_id: 1, child_id: 2
+graph.add_relation parent_id: 2, child_id: 3
+```
+
+### Navigate graph
+```ruby
+graph[1] # <Node 1>
+graph.roots # [<Node 1>, <Node 2>]
+graph.parents_of(3) # [<Node 2>]
+graph.ancestors_of(3) # [<Node 1>, <Node 2>]
+graph.children_of(1) # [<Node 2>]
+graph.descendants_of(1) # [<Node 2>, <Node 3>]
+```
+
+### Node
+```ruby
+node = graph[node_id]
+
+node.id # node_id
+node.root? # true/false
+
+node.data # {key_1: val_1, key_2: val_2}
+node.data[:key_1] # val_1
+node.data[:key_3] = val_3
+node[:key_1] # val_1
+node[:key_3] = val_3
+
+node.parents # [<Node>, ...]
+node.ancestors # [<Node>, ...]
+node.children # [<Node>, ...]
+node.descendants # [<Node>, ...]
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/gabynaiman/hierarchical_graph.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,25 @@
+require 'bundler/gem_tasks'
+require 'rake/testtask'
+
+Rake::TestTask.new(:spec) do |t|
+  t.libs << 'spec'
+  t.libs << 'lib'
+  t.pattern = ENV['DIR'] ? File.join(ENV['DIR'], '**', '*_spec.rb') : 'spec/**/*_spec.rb'
+  t.verbose = false
+  t.warning = false
+  t.loader = nil if ENV['TEST']
+  ENV['TEST'], ENV['LINE'] = ENV['TEST'].split(':') if ENV['TEST'] && !ENV['LINE']
+  t.options = ''
+  t.options << "--name=/#{ENV['NAME']}/ " if ENV['NAME']
+  t.options << "-l #{ENV['LINE']} " if ENV['LINE'] && ENV['TEST']
+end
+
+task default: :spec
+
+desc 'Pry console'
+task :console do
+  require 'hierarchical_graph'
+  require 'pry'
+  ARGV.clear
+  Pry.start
+end

data/hierarchical_graph.gemspec

@@ -0,0 +1,28 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'hierarchical_graph/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'hierarchical_graph'
+  spec.version       = HierarchicalGraph::VERSION
+  spec.authors       = ['Gabriel Naiman']
+  spec.email         = ['gabynaiman@gmail.com']
+  spec.summary       = 'Hierarchical graph representation'
+  spec.description   = 'Hierarchical graph representation'
+  spec.homepage      = 'https://github.com/gabynaiman/hierarchical_graph'
+  spec.license       = 'MIT'
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ['lib']
+
+  spec.add_development_dependency 'rake', '~> 12.3'
+  spec.add_development_dependency 'minitest', '~> 5.0', '< 5.11'
+  spec.add_development_dependency 'minitest-colorin', '~> 0.1'
+  spec.add_development_dependency 'minitest-line', '~> 0.6'
+  spec.add_development_dependency 'simplecov', '~> 0.12'
+  spec.add_development_dependency 'coveralls', '~> 0.8'
+  spec.add_development_dependency 'pry-nav', '~> 0.2'
+end

data/lib/hierarchical_graph.rb

@@ -0,0 +1,120 @@
+require_relative 'hierarchical_graph/version'
+require_relative 'hierarchical_graph/node'
+
+class HierarchicalGraph
+
+  include Enumerable
+  include TSort
+
+  def initialize
+    @nodes = {}
+    @parent_to_children = Hash.new { |h,k| h[k] = Set.new }
+    @child_to_parents = Hash.new { |h,k| h[k] = Set.new }
+    @ancestors_cache = {}
+    @descendants_cache = {}
+  end
+
+  def [](id)
+    nodes[id]
+  end
+
+  def each(&block)
+    nodes.each_value(&block)
+  end
+
+  def empty?
+    nodes.empty?
+  end
+
+  def roots
+    select(&:root?)
+  end
+
+  def add_node(id, attributes={})
+    clear_cache
+    nodes[id] = Node.new self, id, attributes
+  end
+
+  def remove_node(id)
+    validate! id
+
+    parent_to_children[id].each { |child_id| child_to_parents[child_id].delete id }
+    child_to_parents[id].each { |parent_id| parent_to_children[parent_id].delete id }
+
+    parent_to_children.delete id
+    child_to_parents.delete id
+
+    nodes.delete id
+    clear_cache
+
+    nil
+  end
+
+  def add_relation(parent_id:, child_id:)
+    validate! parent_id, child_id
+    
+    clear_cache
+    parent_to_children[parent_id] << child_id
+    child_to_parents[child_id] << parent_id
+    
+    nil
+  end
+
+  def remove_relation(parent_id:, child_id:)
+    validate! parent_id, child_id
+
+    clear_cache
+    parent_to_children[parent_id].delete child_id
+    child_to_parents[child_id].delete parent_id
+    
+    nil
+  end
+
+  def parents_of(id)
+    child_to_parents[id].map { |node_id| nodes[node_id] }
+  end
+
+  def children_of(id)
+    parent_to_children[id].map { |node_id| nodes[node_id] }
+  end
+
+  def ancestors_of(id)
+    ancestors_cache[id] ||= parents_of(id).flat_map do |parent|
+      ancestors_of(parent.id) + [parent]
+    end.uniq(&:id)
+  end
+
+  def descendants_of(id)
+    children_of(id).flat_map do |child|
+      [child] + descendants_of(child.id)
+    end.uniq(&:id)
+  end
+
+  def to_s
+    "<#{self.class.name} nodes:[#{map(&:to_s).join(', ')}]>"
+  end
+  alias_method :inspect, :to_s
+
+  private
+
+  attr_reader :nodes, :parent_to_children, :child_to_parents, :ancestors_cache, :descendants_cache
+
+  def validate!(*ids)
+    invalid_ids = ids.reject { |id| nodes.key? id }
+    raise "Invalid nodes: #{invalid_ids.join(', ')}" if invalid_ids.any?
+  end
+
+  def clear_cache
+    descendants_cache.clear
+    ancestors_cache.clear
+  end
+
+  def tsort_each_child(node, &block)
+    children_of(node.id).each(&block)
+  end
+
+  def tsort_each_node(&block)
+    each(&block)
+  end
+
+end

data/lib/hierarchical_graph/node.rb

@@ -0,0 +1,50 @@
+class HierarchicalGraph
+  class Node
+
+    attr_reader :id, :data
+
+    def initialize(graph, id, data={})
+      @graph = graph
+      @id = id
+      @data = data
+    end
+
+    def [](key)
+      data[key]
+    end
+
+    def []=(key, value)
+      data[key] = value
+    end
+
+    def parents
+      graph.parents_of id
+    end
+
+    def children
+      graph.children_of id
+    end
+
+    def ancestors
+      graph.ancestors_of id
+    end
+
+    def descendants
+      graph.descendants_of id
+    end
+
+    def root?
+      parents.empty?
+    end
+
+    def to_s
+      "<#{self.class.name} #{id} parents:[#{parents.map(&:id).join(', ')}] children:[#{children.map(&:id).join(', ')}]>"
+    end
+    alias_method :inspect, :to_s
+
+    private
+
+    attr_reader :graph
+ 
+  end
+end

data/lib/hierarchical_graph/version.rb

@@ -0,0 +1,3 @@
+class HierarchicalGraph
+  VERSION = '1.0.0'
+end

data/spec/coverage_helper.rb

@@ -0,0 +1,5 @@
+require 'simplecov'
+require 'coveralls'
+
+SimpleCov.formatter = SimpleCov::Formatter::MultiFormatter.new [SimpleCov::Formatter::HTMLFormatter, Coveralls::SimpleCov::Formatter]
+SimpleCov.start

data/spec/hierarchical_graph_spec.rb

@@ -0,0 +1,296 @@
+require 'minitest_helper'
+
+describe HierarchicalGraph do
+
+  it 'Empty graph' do
+    graph = HierarchicalGraph.new
+
+    graph.must_be_empty
+  end
+
+  it 'Add node' do
+    graph = HierarchicalGraph.new
+    
+    node = graph.add_node 1
+
+    graph[1].must_equal node
+    graph.count.must_equal 1
+  end
+
+  it 'Remove node' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    
+    graph.remove_node 1
+
+    graph[1].must_be_nil
+    graph.must_be_empty
+  end
+
+  it 'Remove invalid node' do
+    graph = HierarchicalGraph.new
+    
+    error = proc { graph.remove_node 1 }.must_raise RuntimeError
+    error.message.must_equal "Invalid nodes: 1"
+  end
+
+  it 'Add relation' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    
+    graph.add_relation parent_id: 1, child_id: 2
+
+    graph.parents_of(1).must_be_empty
+    graph.children_of(1).map(&:id).must_equal [2]
+
+    graph.parents_of(2).map(&:id).must_equal [1]
+    graph.children_of(2).must_be_empty
+  end
+
+  it 'Add relation with invalid nodes' do
+    graph = HierarchicalGraph.new
+    
+    error = proc { graph.add_relation parent_id: 1, child_id: 2 }.must_raise RuntimeError
+    error.message.must_equal "Invalid nodes: 1, 2"
+  end
+
+  it 'Remove relation' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+
+    graph.add_relation parent_id: 1, child_id: 2
+    graph.children_of(1).count.must_equal 1
+
+    graph.remove_relation parent_id: 1, child_id: 2
+    graph.children_of(1).must_be_empty
+    graph.count 2
+  end
+
+  it 'Remove relation in complex graph' do
+    graph = HierarchicalGraph.new
+    
+    graph.add_node 0
+    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_node 7
+
+    graph.add_relation parent_id: 0, child_id: 3
+    graph.add_relation parent_id: 1, child_id: 3
+    graph.add_relation parent_id: 1, child_id: 2
+    graph.add_relation parent_id: 3, child_id: 4
+    graph.add_relation parent_id: 3, child_id: 5
+    graph.add_relation parent_id: 2, child_id: 4
+    graph.add_relation parent_id: 4, child_id: 5
+    graph.add_relation parent_id: 4, child_id: 6
+    graph.add_relation parent_id: 6, child_id: 7
+
+    graph.remove_node 3
+
+    graph.ancestors_of(4).map(&:id).must_equal [1, 2]
+    graph.parents_of(4).map(&:id).must_equal [2]
+    graph.children_of(4).map(&:id).must_equal [5, 6]
+    graph.descendants_of(4).map(&:id).must_equal [5, 6, 7]
+  end
+
+  it 'Remove relation of invalid nodes' do
+    graph = HierarchicalGraph.new
+
+    error = proc { graph.remove_relation parent_id: 1, child_id: 2 }.must_raise RuntimeError
+    error.message.must_equal "Invalid nodes: 1, 2"
+  end
+
+  it 'Roots' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+
+    graph.roots.map(&:id).must_equal [1, 2, 3, 4]
+
+    graph.add_relation parent_id: 1, child_id: 3
+    graph.add_relation parent_id: 2, child_id: 4
+
+    graph.roots.map(&:id).must_equal [1, 2]
+  end
+
+  it 'Children' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    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.children_of(1).map(&:id).must_equal [2, 3]
+    graph.children_of(3).map(&:id).must_equal [4]
+  end
+
+  it 'Parents' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    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.parents_of(2).map(&:id).must_equal [1]
+    graph.parents_of(4).map(&:id).must_equal [3]
+  end
+
+  it 'Ancestors' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    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.ancestors_of(4).map(&:id).must_equal [1, 3]
+  end
+
+  it 'Clear ancestors Cache' do
+    graph = HierarchicalGraph.new
+    graph.add_node 0
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    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.ancestors_of(4).map(&:id).must_equal [1, 3]
+
+    graph.add_relation parent_id: 0, child_id: 1
+
+    graph.ancestors_of(4).map(&:id).must_equal [0, 1, 3]
+  end
+
+  it 'Descendants' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    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.descendants_of(1).map(&:id).must_equal [2, 3, 4]
+  end
+
+  it 'Clear descendants Cache' 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_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.descendants_of(1).map(&:id).must_equal [2, 3, 4]
+
+    graph.add_relation parent_id: 4, child_id: 5
+
+    graph.descendants_of(1).map(&:id).must_equal [2, 3, 4, 5]
+  end
+
+  it 'Topological sort' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_node 3
+    graph.add_node 4
+    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.tsort.map(&:id).must_equal [2, 4, 3, 1]
+  end
+
+  it 'To string' do
+    graph = HierarchicalGraph.new
+    graph.add_node 1
+    graph.add_node 2
+    graph.add_relation parent_id: 1, child_id: 2
+
+    graph.to_s.must_equal '<HierarchicalGraph nodes:[<HierarchicalGraph::Node 1 parents:[] children:[2]>, <HierarchicalGraph::Node 2 parents:[1] children:[]>]>'
+  end
+
+  describe 'Node' do
+
+    let :graph do
+      HierarchicalGraph.new.tap do |graph|
+        graph.add_node 1, name: 'Node 1', code: '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: 4, child_id: 5
+        graph.add_relation parent_id: 6, child_id: 4
+      end
+    end
+
+    it 'Root' do
+      graph[1].must_be :root?
+      graph[2].wont_be :root?
+    end
+
+    it 'Parents' do
+      graph[1].parents.must_be_empty
+      graph[4].parents.map(&:id).must_equal [3, 6]
+    end
+
+    it 'Children' do
+      graph[5].children.must_be_empty
+      graph[1].children.map(&:id).must_equal [2, 3]
+    end
+
+    it 'Ancestors' do
+      graph[6].ancestors.must_be_empty
+      graph[4].ancestors.map(&:id).must_equal [1, 3, 6]
+    end
+
+    it 'Descendants' do
+      graph[5].descendants.must_be_empty
+      graph[1].descendants.map(&:id).must_equal [2, 3, 4, 5]
+    end
+
+    it 'Get data' do
+      graph[1].data.must_equal name: 'Node 1', code: 'node_1'
+      graph[1][:name].must_equal 'Node 1'
+      graph[1][:code].must_equal 'node_1'
+    end
+
+    it 'Set data' do
+      node = graph[2]
+      node.data[:name] = 'Node 2'
+      node[:code] = 'node_2'
+
+      graph[2].data.must_equal name: 'Node 2', code: 'node_2'
+      graph[2][:name].must_equal 'Node 2'
+      graph[2][:code].must_equal 'node_2'
+    end
+
+  end
+
+end

data/spec/minitest_helper.rb

@@ -0,0 +1,5 @@
+require 'coverage_helper'
+require 'hierarchical_graph'
+require 'minitest/autorun'
+require 'minitest/colorin'
+require 'pry-nav'

metadata

@@ -0,0 +1,166 @@
+--- !ruby/object:Gem::Specification
+name: hierarchical_graph
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Gabriel Naiman
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2020-04-12 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '12.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '12.3'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '5.11'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '5.11'
+- !ruby/object:Gem::Dependency
+  name: minitest-colorin
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.1'
+- !ruby/object:Gem::Dependency
+  name: minitest-line
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.12'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.12'
+- !ruby/object:Gem::Dependency
+  name: coveralls
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.8'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.8'
+- !ruby/object:Gem::Dependency
+  name: pry-nav
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.2'
+description: Hierarchical graph representation
+email:
+- gabynaiman@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".coveralls.yml"
+- ".gitignore"
+- ".ruby-gemset"
+- ".ruby-version"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- hierarchical_graph.gemspec
+- lib/hierarchical_graph.rb
+- lib/hierarchical_graph/node.rb
+- lib/hierarchical_graph/version.rb
+- spec/coverage_helper.rb
+- spec/hierarchical_graph_spec.rb
+- spec/minitest_helper.rb
+homepage: https://github.com/gabynaiman/hierarchical_graph
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+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: []
+rubygems_version: 3.1.2
+signing_key: 
+specification_version: 4
+summary: Hierarchical graph representation
+test_files:
+- spec/coverage_helper.rb
+- spec/hierarchical_graph_spec.rb
+- spec/minitest_helper.rb