rbgraph 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 565742a594907115555240ba8d9112b22b4254e2
+  data.tar.gz: 1d4f367ef3bd8ece33ec00bbd4258a2feb4d444e
+SHA512:
+  metadata.gz: 494dc5cd4a37f4744e311fefabfa43c68c8bc15dabee0da1dc0ebb7c4191096cc546933a2c75b269d1375765206453406e92ed723750a3074c1d782e19fcb958
+  data.tar.gz: d02edd56db4b14e52266ebb2d72137dd300a5b5624174ca69f74860b865cd11922d6f6ff5236ec7cff817a3793758d1b4a98eaee6eea8228a743c72900fa6133

data/Gemfile

@@ -0,0 +1,3 @@
+source "http://rubygems.org"
+
+gemspec

data/README.md

@@ -0,0 +1,45 @@
+# Rbgraph
+A simple and lightweight ruby implementation of graphs and traversal algorithms
+
+## General Requirements
+
+Install via rubygems
+
+```gem install rbgraph```
+
+or add it to your Gemfile
+
+```gem 'rbgraph'```
+
+## Example
+
+```ruby
+graph = Rbgraph::UndirectedGraph.new()
+graph.add_edge!({id: 1}, {id: 2})
+graph.add_edge!({id: 2}, {id: 3})
+graph.add_edge!({id: 1}, {id: 4})
+graph.add_edge!({id: 4}, {id: 5})
+graph.add_edge!({id: 3}, {id: 6})
+graph.add_edge!({id: 7}, {id: 8})
+graph.add_edge!({id: 7}, {id: 8})
+graph.add_edge!({id: 7}, {id: 9})
+graph.add_edge!({id: 10}, {id: 11})
+graph.add_edge!({id: 12}, {id: 1})
+
+t = Rbgraph::Traverser::BfsTraverser.new(graph)
+t.connected_components.sort { |a, b| b.size <=> a.size }.each do |subgraph|
+  puts subgraph.nodes.values.map(&:id).inspect
+end
+```
+
+will output
+
+```ruby
+[1, 2, 4, 12, 3, 5, 6]
+[7, 8, 9]
+[10, 11]
+```
+
+
+### 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

@@ -0,0 +1,33 @@
+module Rbgraph
+
+  class Edge
+
+    attr_accessor :id
+    attr_accessor :node1
+    attr_accessor :node2
+    attr_accessor :attributes
+
+    def initialize(node1, node2, attributes = {})
+      self.node1 = node1
+      self.node2 = node2
+      self.attributes = attributes
+      self.id = attributes[:id] || "#{node1.id}=#{self.class}=#{node2.id}"
+    end
+
+    def ==(node)
+      self.id == node.id
+    end
+    alias_method :==, :eql?
+
+    def hash
+      id
+    end
+
+    def merge(edge)
+      attributes.merge!(edge.attributes.reject { |k, v| k == :id })
+      self
+    end
+
+  end
+
+end

data/lib/rbgraph/graph.rb

@@ -0,0 +1,46 @@
+module Rbgraph
+
+  class Graph
+
+    attr_accessor :nodes
+    attr_accessor :edges
+
+    def initialize(nodes = {}, edges = {})
+      self.nodes = nodes
+      self.edges = edges
+    end
+
+    def size
+      nodes.values.length
+    end
+
+    def add_node!(node)
+      node = node.is_a?(Node) ? node : Node.new(node)
+      if nodes[node.id].nil?
+        nodes[node.id] = node
+      else
+        nodes[node.id].merge(node)
+      end
+      nodes[node.id]
+    end
+
+    def add_edge!(node1, node2, edge_attributes = {})
+      node1 = add_node!(node1)
+      node2 = add_node!(node2)
+      edge = Edge.new(node1, node2, edge_attributes)
+      edge = if edges[edge.id].nil?
+        edges[edge.id] = edge
+      else
+        edges[edge.id].merge(edge)
+      end
+      connect_nodes(node1, node2, edge)
+      edge
+    end
+
+    def connect_nodes(node1, node2, edge)
+      raise NotImplementedError("Cannot connect nodes on a general graph! Use either Directed or Undirected subclasses")
+    end
+
+  end
+
+end

data/lib/rbgraph/graphs/directed.rb

@@ -0,0 +1,11 @@
+module Rbgraph
+
+    class DirectedGraph < Graph
+
+      def connect_nodes(node1, node2, edge)
+        node1.connect_to(node2, edge)
+      end
+
+    end
+
+end

data/lib/rbgraph/graphs/undirected.rb

@@ -0,0 +1,12 @@
+module Rbgraph
+
+    class UndirectedGraph < Graph
+
+      def connect_nodes(node1, node2, edge)
+        node1.connect_to(node2, edge)
+        node2.connect_to(node1, edge)
+      end
+
+    end
+
+end

data/lib/rbgraph/node.rb

@@ -0,0 +1,40 @@
+module Rbgraph
+
+  class Node
+
+    attr_accessor :id
+    attr_accessor :attributes
+    attr_accessor :neighbors
+    attr_accessor :edges
+
+    def initialize(attributes = {})
+      self.attributes = attributes
+      raise "Node should have an id attribute!" if attributes[:id].nil?
+      self.id = attributes[:id]
+      self.neighbors = {}
+      self.edges = {}
+    end
+
+    def ==(node)
+      self.id == node.id
+    end
+    alias_method :==, :eql?
+
+    def hash
+      id
+    end
+
+    def merge(node)
+      attributes.merge!(node.attributes.reject { |k, v| k == :id })
+      self
+    end
+
+    def connect_to(node, edge)
+      neighbors[node.id] = node
+      edges[edge.id] = edge
+      self
+    end
+
+  end
+
+end

data/lib/rbgraph/traverser/bfs_traverser.rb

@@ -0,0 +1,52 @@
+module Rbgraph
+  module Traverser
+
+    class BfsTraverser
+
+      attr_accessor :graph
+      attr_accessor :connected_subgraphs
+      attr_accessor :visited_nodes
+      attr_accessor :unvisited_nodes
+      attr_accessor :queue
+
+      def initialize(graph)
+        self.graph = graph
+        self.connected_subgraphs = []
+        self.unvisited_nodes = Set.new [*graph.nodes.values]
+      end
+
+      def connected_components
+        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)
+        end
+        connected_subgraphs
+      end
+
+      def bfs_from_root(root)
+        subgraph = graph.class.new
+        visited_nodes.add(root)
+        queue.enq(root)
+        while !queue.empty? do
+          t = queue.deq
+          unvisited_nodes.delete(t)
+          yield(t) if block_given? # do sth on current node
+          t.neighbors.each do |nid, neighbor|
+            subgraph.add_edge!(t, neighbor)
+            if !visited_nodes.include?(neighbor)
+              visited_nodes.add(neighbor)
+              queue.enq(neighbor)
+            end
+          end
+        end
+        subgraph
+      end
+
+    end
+
+  end
+end

data/lib/rbgraph/traverser.rb

@@ -0,0 +1,7 @@
+module Rbgraph
+  module Traverser
+
+    autoload :BfsTraverser, 'rbgraph/traverser/bfs_traverser'
+
+  end
+end

data/lib/rbgraph.rb

@@ -0,0 +1,12 @@
+module Rbgraph
+
+  autoload :Graph, 'rbgraph/graph'
+  autoload :DirectedGraph, 'rbgraph/graphs/directed'
+  autoload :UndirectedGraph, 'rbgraph/graphs/undirected'
+
+  autoload :Node,  'rbgraph/node'
+  autoload :Edge,  'rbgraph/edge'
+
+  autoload :Traverser, 'rbgraph/traverser'
+
+end

metadata

@@ -0,0 +1,67 @@
+--- !ruby/object:Gem::Specification
+name: rbgraph
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- George Lamprianidis
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-12-03 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Generic Ruby graphs and operations on them!
+email: giorgos.lamprianidis@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- Gemfile
+- README.md
+- lib/rbgraph.rb
+- lib/rbgraph/edge.rb
+- lib/rbgraph/graph.rb
+- lib/rbgraph/graphs/directed.rb
+- lib/rbgraph/graphs/undirected.rb
+- lib/rbgraph/node.rb
+- lib/rbgraph/traverser.rb
+- lib/rbgraph/traverser/bfs_traverser.rb
+homepage: http://rubygems.org/gems/rbgraph
+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: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Generic Ruby graphs and operations on them!
+test_files: []