turbine-graph 0.1.0

data/lib/turbine/traversal/breadth_first.rb

@@ -0,0 +1,49 @@
+module Turbine
+  module Traversal
+    # Traverses the graph breadth-first, following each item to its adjacent
+    # items.
+    #
+    #        A
+    #       / \
+    #      B   C
+    #     /   / \
+    #    D   E   F
+    #   /   /
+    #  G   H
+    #
+    # In the above graph, using a breadth-first algorithm, starting from A,
+    # the nodes are traversed in the order B -> C -> D -> E -> F -> G -> H.
+    class BreadthFirst < Base
+
+      #######
+      private
+      #######
+
+      # Internal: Given a +node+ iterates through each of it's adjacent nodes
+      # using the +method+ and +args+ supplied when initializing the
+      # BreadthFirst instance.
+      #
+      # When the node itself has matching adjacent nodes, those will also be
+      # visited. If there are loops within the graph, they will not be
+      # followed; each node is visited no more than once.
+      #
+      # node  - The node from which to traverse.
+      # block - A block executed for each matching node.
+      #
+      # Returns nothing.
+      def visit(node, &block)
+        queue = node.public_send(@method, *@args).to_a.dup
+
+        while item = queue.shift
+          next if @seen[item]
+
+          @seen[item] = true
+          block.call(item)
+
+          queue.push(*fetch(item).public_send(@method, *@args).to_a)
+        end
+      end
+
+    end # BreadthFirst
+  end # Traversal
+end # Turbine

data/lib/turbine/traversal/depth_first.rb

@@ -0,0 +1,46 @@
+module Turbine
+  module Traversal
+    # Traverses the graph depth-first, following each edge from a node to its
+    # adjacent nodes, and to *their* adjacent nodes, etc...
+    #
+    #        A
+    #       / \
+    #      B   C
+    #     /   / \
+    #    D   E   F
+    #   /   /
+    #  G   H
+    #
+    # In the above graph, using a depth-first algorithm, starting from A,
+    # the nodes are traversed in the order B -> D -> G -> C -> E -> H -> F.
+    class DepthFirst < Base
+
+      #######
+      private
+      #######
+
+      # Internal: Given a +node+ iterates through each of it's adjacent nodes
+      # using the +method+ and +args+ supplied when initializing the
+      # DepthFirst instance.
+      #
+      # When the node itself has matching adjacent nodes, those will also be
+      # visited. If there are loops within the graph, they will not be
+      # followed; each node is visited no more than once.
+      #
+      # node  - The node from which to traverse.
+      # block - A block executed for each matching node.
+      #
+      # Returns nothing.
+      def visit(node, &block)
+        node.public_send(@method, *@args).each do |adjacent|
+          next if @seen[adjacent]
+
+          @seen[adjacent] = true
+          block.call(adjacent)
+          visit(fetch(adjacent), &block)
+        end
+      end
+
+    end # DepthFirst
+  end # Traversal
+end # Turbine

data/lib/turbine/version.rb

@@ -0,0 +1,4 @@
+module Turbine
+  # The current version of the Turbine library.
+  VERSION = '0.1.0'
+end

data/turbine.gemspec

@@ -0,0 +1,84 @@
+# -*- encoding: utf-8 -*-
+$LOAD_PATH.unshift File.expand_path('../lib', __FILE__)
+
+Gem::Specification.new do |s|
+  s.required_rubygems_version = '>= 1.3.6'
+
+  # The following four lines are automatically updates by the "gemspec"
+  # rake task. It it completely safe to edit them, but using the rake task
+  # is easier.
+  s.name              = 'turbine-graph'
+  s.version           = '0.1.0'
+  s.date              = '2013-04-10'
+  s.rubyforge_project = 'turbine-graph'
+
+  # You may safely edit the section below.
+
+  s.platform     = Gem::Platform::RUBY
+
+  s.authors      = [ 'Anthony Williams',
+                     'Dennis Schoenmakers',
+                     'Paolo Zaccagnini',
+                     'Sebastian Burkhard' ]
+
+  s.email        = [ 'hi@antw.me',
+                     'dennis.schoenmakers@quintel.com',
+                     'paolo.zaccagnini@quintel.com',
+                     'sebastian.burkhard@quintel.com' ]
+
+  s.homepage     = 'http://github.com/quintel/turbine'
+  s.summary      = 'An in-memory graph database written in Ruby.'
+  s.description  = 'An experiment in graph databases, with Ruby...'
+
+  s.require_path = 'lib'
+
+  s.add_development_dependency 'rake',  '>= 0.9.0'
+  s.add_development_dependency 'rspec', '>= 2.11.0'
+
+  s.rdoc_options     = ['--charset=UTF-8']
+  s.extra_rdoc_files = %w[LICENSE README.md]
+
+  # The manifest is created by the "gemspec" rake task. Do not edit it
+  # directly; your changes will be wiped out when you next run the task.
+
+  # = MANIFEST =
+  s.files = %w[
+    Gemfile
+    Guardfile
+    LICENSE
+    README.md
+    Rakefile
+    examples/energy.rb
+    examples/family.rb
+    lib/turbine.rb
+    lib/turbine/algorithms/filtered_tarjan.rb
+    lib/turbine/algorithms/tarjan.rb
+    lib/turbine/edge.rb
+    lib/turbine/errors.rb
+    lib/turbine/graph.rb
+    lib/turbine/node.rb
+    lib/turbine/pipeline/README.mdown
+    lib/turbine/pipeline/dsl.rb
+    lib/turbine/pipeline/expander.rb
+    lib/turbine/pipeline/filter.rb
+    lib/turbine/pipeline/journal.rb
+    lib/turbine/pipeline/journal_filter.rb
+    lib/turbine/pipeline/pump.rb
+    lib/turbine/pipeline/segment.rb
+    lib/turbine/pipeline/sender.rb
+    lib/turbine/pipeline/split.rb
+    lib/turbine/pipeline/trace.rb
+    lib/turbine/pipeline/transform.rb
+    lib/turbine/pipeline/traversal.rb
+    lib/turbine/pipeline/unique.rb
+    lib/turbine/properties.rb
+    lib/turbine/traversal/base.rb
+    lib/turbine/traversal/breadth_first.rb
+    lib/turbine/traversal/depth_first.rb
+    lib/turbine/version.rb
+    turbine.gemspec
+  ]
+  # = MANIFEST =
+
+  s.test_files = s.files.select { |path| path =~ /^spec\/.*\.rb/ }
+end

metadata

@@ -0,0 +1,120 @@
+--- !ruby/object:Gem::Specification
+name: turbine-graph
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- Anthony Williams
+- Dennis Schoenmakers
+- Paolo Zaccagnini
+- Sebastian Burkhard
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-04-10 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.9.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.9.0
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 2.11.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 2.11.0
+description: An experiment in graph databases, with Ruby...
+email:
+- hi@antw.me
+- dennis.schoenmakers@quintel.com
+- paolo.zaccagnini@quintel.com
+- sebastian.burkhard@quintel.com
+executables: []
+extensions: []
+extra_rdoc_files:
+- LICENSE
+- README.md
+files:
+- Gemfile
+- Guardfile
+- LICENSE
+- README.md
+- Rakefile
+- examples/energy.rb
+- examples/family.rb
+- lib/turbine.rb
+- lib/turbine/algorithms/filtered_tarjan.rb
+- lib/turbine/algorithms/tarjan.rb
+- lib/turbine/edge.rb
+- lib/turbine/errors.rb
+- lib/turbine/graph.rb
+- lib/turbine/node.rb
+- lib/turbine/pipeline/README.mdown
+- lib/turbine/pipeline/dsl.rb
+- lib/turbine/pipeline/expander.rb
+- lib/turbine/pipeline/filter.rb
+- lib/turbine/pipeline/journal.rb
+- lib/turbine/pipeline/journal_filter.rb
+- lib/turbine/pipeline/pump.rb
+- lib/turbine/pipeline/segment.rb
+- lib/turbine/pipeline/sender.rb
+- lib/turbine/pipeline/split.rb
+- lib/turbine/pipeline/trace.rb
+- lib/turbine/pipeline/transform.rb
+- lib/turbine/pipeline/traversal.rb
+- lib/turbine/pipeline/unique.rb
+- lib/turbine/properties.rb
+- lib/turbine/traversal/base.rb
+- lib/turbine/traversal/breadth_first.rb
+- lib/turbine/traversal/depth_first.rb
+- lib/turbine/version.rb
+- turbine.gemspec
+homepage: http://github.com/quintel/turbine
+licenses: []
+post_install_message: 
+rdoc_options:
+- --charset=UTF-8
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: 1.3.6
+requirements: []
+rubyforge_project: turbine-graph
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: An in-memory graph database written in Ruby.
+test_files: []