graphos 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 0c01223437fbfd0807465f7c3e906beea53a3968
+  data.tar.gz: c22534c9913af9e5fe26f349ea47acae83076338
+SHA512:
+  metadata.gz: 1bc419449e7f18fed8132f94b9adf7322a9e556f61f0cc281a488d8cd856b45b3477596e17762e2205427dddabd8c84806881363719e19c779e1be83528b6984
+  data.tar.gz: 22504d8ce07925db07a2aab39d76db7b0201be6e0c0ff4f35205b9b767a9d602a0d963a5f5f0a5e34e34daf19d8ff27e9e0928cca17fc4d00dfc3675b64660b5

data/.gitignore

@@ -0,0 +1,16 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log
+.ruby-gemset
+.ruby-version

data/Gemfile

@@ -0,0 +1,6 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in graphos.gemspec
+gemspec
+
+gem "ruby-lxc", github: "lxc/ruby-lxc", require: "lxc"

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Bernardo Amorim
+
+MIT License
+
+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,31 @@
+# Graphos
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'graphos'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install graphos
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/graphos/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+
+task :default => :test
+task :test do
+    Dir.glob('./test/**/*_test.rb').each { |file| require file}
+end

data/graphos.gemspec

@@ -0,0 +1,28 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'graphos/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "graphos"
+  spec.version       = Graphos::VERSION
+  spec.authors       = ["Bernardo Amorim", "Pedro Volpi"]
+  spec.email         = ["contato@bamorim.com", "pedrovolpi@poli.ufrj.br"]
+  spec.summary       = %q{Educational gem to Graph Theory @ UFRJ}
+  spec.description   = %q{This gems implements some graph algorithms and representations.}
+  spec.homepage      = "https://github.com/bamorim/graphos"
+  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 "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest", "~> 5.4"
+  spec.add_development_dependency "minitest-reporters", "~> 1.0"
+  spec.add_development_dependency "pry", "~>0.10"
+
+  spec.add_dependency "algorithms", "~>0.6"
+end

data/lib/graphos.rb

@@ -0,0 +1,9 @@
+require "graphos/version"
+require "graphos/weighted/graph"
+require "graphos/weighted/text_factory"
+
+require "graphos/algorithm/dijkstra"
+require "graphos/algorithm/prim"
+
+module Graphos
+end

data/lib/graphos/algorithm/dijkstra.rb

@@ -0,0 +1,58 @@
+require "algorithms"
+require "graphos/path"
+module Graphos
+  module Algorithm
+    include Containers
+    ##
+    # Runs the dijstra algorithm on a given graph
+    # at a starting node
+    # This uses a Heap to get the lightest edge
+    def self.dijkstra graph, initial
+      #OK? E o path?
+      fathers = Array.new(graph.size)
+
+      #os paf
+      allPaths = Array.new(graph.size)
+
+      #OK #dist[v] = infinito
+      costs = Array.new(graph.size, Float::INFINITY)
+      #dist[s] = 0
+      costs[initial] = 0
+
+      #OK
+      heap = Heap.new{|x,y| (costs[x] <=> costs[y]) == -1}
+      (0...graph.size).each{|i| heap.push(i)}
+
+      update_cost = -> (idx,cost) do
+        costs[idx] = cost
+        heap.change_key(idx,idx)
+      end
+
+
+      #Para cada vértice v
+      #enquanto heap (S-V) != 0
+      while idx=heap.pop
+        #Selecione u em V-S, tal que dist[u] é mínima
+        u = graph[idx]
+        distu = costs[idx]
+        allPaths[idx] ||= Path.new
+        #Para cada vizinho v (edge.to) de u faça
+        u.edges.each do |edge|
+          #Se dist[v] > dist[u] + w(u,v) então
+          if costs[edge.to.index] > distu + edge.weight
+            #dist[v] = dist[u] + w(u,v)
+            fathers[edge.to.index] = u.index
+            update_cost.call(edge.to.index, distu + edge.weight)
+            #criar o Path entre root e v
+            #se existe já, tem q atualizar. O novo é o do pai + ele msm
+            allPaths[edge.to.index] = allPaths[u.index] + Path.new(edge)
+          end
+        end
+      end
+
+      allPaths
+    end
+
+  end
+end
+

data/lib/graphos/algorithm/prim.rb

@@ -0,0 +1,44 @@
+require "algorithms"
+module Graphos
+  module Algorithm
+    include Containers
+
+    ##
+    # Runs the prim algorithm in order to
+    # find a MST for a given graph.
+
+    def self.prim graph, initial
+      fathers = Array.new(graph.size)
+
+      costs = Array.new(graph.size, Float::INFINITY)
+      costs[initial] = 0
+
+      heap = Heap.new{|x,y| (costs[x] <=> costs[y]) == -1}
+      (0..graph.size-1).each{|i| heap.push(i)}
+
+      update_cost = -> (idx,cost) do
+        costs[idx] = cost
+        heap.change_key(idx,idx)
+      end
+
+      while idx=heap.pop
+        node = graph[idx]
+        node.edges.each do |edge|
+          if costs[edge.to.index] > edge.weight
+            fathers[edge.to.index] = node.index
+            update_cost.call(edge.to.index, edge.weight)
+          end
+        end
+      end
+
+      result = Weighted::Graph.new graph.size
+      fathers.each_with_index do |f,c|
+        if f
+          result.add_edge(f, c, costs[c])
+        end
+      end
+      result
+    end
+
+  end
+end

data/lib/graphos/path.rb

@@ -0,0 +1,39 @@
+require "algorithms"
+module Graphos
+  ##
+  # This class represents a collection of edges
+  # When adding an edge that does not start at
+  # the last node, it raises an error
+
+  class Path
+    class IncorretPathError < StandardError; end
+
+    attr_reader :cost, :path
+    def initialize edge=nil
+      if edge
+        @cost = edge.weight
+        @path = [edge]
+      else
+        @cost = 0
+        @path = []
+      end
+    end
+
+    def add_edge edge
+      if @path.last.to != edge.from
+        raise IncorrectPathError.new
+      end
+      @path += [node]
+      @cost += weight
+    end
+
+    def merge! paf
+      @cost += paf.cost
+      @path = @path + paf.path
+    end
+
+    def + path
+      dup.tap{|d| d.merge! path }
+    end
+  end
+end

data/lib/graphos/version.rb

@@ -0,0 +1,3 @@
+module Graphos
+  VERSION = "0.1.0"
+end

data/lib/graphos/weighted/edge.rb

@@ -0,0 +1,15 @@
+module Graphos
+  module Weighted
+
+    ##
+    # This class represents an edge in a weighted graph
+
+    class Edge
+      attr_reader :from, :to, :weight
+      def initialize from, to, weight
+        @from, @to, @weight = from, to, weight
+      end
+    end
+
+  end
+end

data/lib/graphos/weighted/graph.rb

@@ -0,0 +1,38 @@
+module Graphos
+  module Weighted
+
+    # :nodoc:
+    class Graph
+
+      require "graphos/weighted/node"
+      require "graphos/weighted/edge"
+
+
+      def initialize size
+        @nodes = (0..size-1).map{|i| Node.new i }
+      end
+
+      def size
+        @nodes.size
+      end
+
+      def add_edge from, to, weight
+        @nodes[from].add_edge(@nodes[to],weight)
+        @nodes[to].add_edge(@nodes[from],weight)
+      end
+
+      def edge from, to
+        @nodes[from].edge(to)
+      end
+
+      def [] i
+        @nodes[i]
+      end
+
+      def each_node
+        @nodes.each{|n| yield n}
+      end
+    end
+
+  end
+end

data/lib/graphos/weighted/node.rb

@@ -0,0 +1,38 @@
+module Graphos
+  module Weighted
+
+    ##
+    # This class represents a node in a weighted graph
+
+    class Node
+      attr_reader :index, :edges
+      def initialize index
+        @index = index
+        @edges = []
+      end
+
+      def add_edge to, weight
+        # Does a O(n) check deleting existing edges
+        @edges.delete_if{|n| n.to == to}
+        @edges << Edge.new(self, to, weight)
+      end
+
+      def degree
+        @edges.inject(0){|sum,e| sum+e.weight }
+      end
+
+      def neighbor_of? index
+        @edges.any? {|node| node.to.index == index }
+      end
+
+      def neighbors
+        @edges.map{|edge| edge.to}
+      end
+
+      def edge to
+        @edges.lazy.select{|e| e.to.index == to}.first
+      end
+    end
+
+  end
+end

data/lib/graphos/weighted/text_factory.rb

@@ -0,0 +1,15 @@
+module Graphos
+  module Weighted
+    module TextFactory
+      def self.read path
+        f = File.open(path,"r")
+        graph = Graph.new(f.gets.to_i)
+        while(line=f.gets)
+          args = line.split(/[ \n]+/)
+          graph.add_edge args[0].to_i-1, args[1].to_i-1, args[2].to_f
+        end
+        graph
+      end
+    end
+  end
+end

data/test/dijsktra_test.rb

@@ -0,0 +1,38 @@
+require_relative "minitest_helper.rb"
+require "graphos/weighted/graph"
+require "graphos/algorithm/dijkstra"
+
+class DijkstraTest < MiniTest::Test
+  def test_dijskstra
+    graph = Graphos::Weighted::Graph.new(5)
+    graph.add_edge 0, 1, 2
+    graph.add_edge 0, 2, 1
+    graph.add_edge 0, 4, 1
+    graph.add_edge 1, 2, 3
+    graph.add_edge 2, 4, 2
+    graph.add_edge 2, 3, 4
+
+    dij = Graphos::Algorithm.dijkstra graph, 0
+
+    assert_equal([],ipath(dij[0]))
+    assert_equal(0,dij[0].cost)
+
+    assert_equal([1],ipath(dij[1]))
+    assert_equal(2,dij[1].cost)
+
+    assert_equal([2],ipath(dij[2]))
+    assert_equal(1,dij[2].cost)
+
+    assert_equal([2,3],ipath(dij[3]))
+    assert_equal(5,dij[3].cost)
+
+    assert_equal([4],ipath(dij[4]))
+    assert_equal(1,dij[4].cost)
+  end
+
+private
+
+  def ipath path
+    path.path.map{|e| e.to.index}
+  end
+end

data/test/fixtures/wgraph.txt

@@ -0,0 +1,4 @@
+3
+1 2 1.5
+1 3 2
+2 3 2.5

data/test/minitest_helper.rb

@@ -0,0 +1,3 @@
+require 'minitest/reporters'
+Minitest::Reporters.use!(Minitest::Reporters::SpecReporter.new)
+require 'minitest/autorun' 

data/test/prim_test.rb

@@ -0,0 +1,24 @@
+require_relative "minitest_helper.rb"
+require "graphos/weighted/graph"
+require "graphos/algorithm/prim"
+
+class PrimTest < MiniTest::Test
+  def test_prim
+    graph = Graphos::Weighted::Graph.new(5)
+    graph.add_edge 0, 1, 2
+    graph.add_edge 0, 2, 1
+    graph.add_edge 0, 4, 1
+    graph.add_edge 1, 2, 3
+    graph.add_edge 2, 4, 2
+    graph.add_edge 2, 3, 4
+
+    mst = Graphos::Algorithm.prim graph, 0
+
+    assert_equal(nil, mst.edge(1,2))
+    assert_equal(nil, mst.edge(2,4))
+    assert_equal(2, mst.edge(1,0).weight)
+    assert_equal(1, mst.edge(0,4).weight)
+    assert_equal(1, mst.edge(0,2).weight)
+    assert_equal(4, mst.edge(2,3).weight)
+  end
+end

data/test/weighted/graph_test.rb

@@ -0,0 +1,55 @@
+require_relative "../minitest_helper.rb"
+require "graphos/weighted/graph"
+
+class WeightedGraphTest < MiniTest::Test
+  def test_initializing_and_size
+    graph = Graphos::Weighted::Graph.new 10
+    assert_equal(10, graph.size)
+  end
+
+  def test_degrees
+    graph = example
+
+    assert_equal(5, graph[0].degree)
+    assert_equal(7, graph[2].degree)
+  end
+
+  def test_edges
+    graph = example
+    assert_equal(3, graph.edge(0,1).weight)
+  end
+
+  def test_neighborhood
+    graph = example
+
+    assert(graph[0].neighbor_of? 1)
+    refute(graph[0].neighbor_of? 4)
+  end
+
+  def test_get_neighbors
+    graph = example
+
+    assert_equal(2, graph[0].neighbors.size)
+    assert_equal(3, graph[1].neighbors.size)
+  end
+
+  def test_edge_overwrite
+    graph = Graphos::Weighted::Graph.new 2
+    graph.add_edge(0,1,2)
+    graph.add_edge(0,1,3)
+    assert_equal(3, graph.edge(0,1).weight)
+    assert_equal(1, graph[0].edges.count)
+    assert_equal(1, graph[1].edges.count)
+  end
+
+private
+  
+  def example
+    graph = Graphos::Weighted::Graph.new 4
+    graph.add_edge(0,1,3)
+    graph.add_edge(0,2,2)
+    graph.add_edge(1,2,5)
+    graph.add_edge(1,3,10)
+    graph
+  end
+end

data/test/weighted/graph_text_factory_test.rb

@@ -0,0 +1,14 @@
+require_relative "../minitest_helper.rb"
+require "graphos/weighted/graph"
+require "graphos/weighted/text_factory"
+
+class WeightedGraphTextFactoryTest < MiniTest::Test
+  def test_text_factory
+    graph = Graphos::Weighted::TextFactory.read("test/fixtures/wgraph.txt")
+
+    assert_equal(3, graph.size)
+    assert_equal(1.5, graph.edge(0,1).weight)
+    assert_equal(2, graph.edge(0,2).weight)
+    assert_equal(2.5, graph.edge(1,2).weight)
+  end
+end

metadata

@@ -0,0 +1,157 @@
+--- !ruby/object:Gem::Specification
+name: graphos
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Bernardo Amorim
+- Pedro Volpi
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-11-10 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.4'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.4'
+- !ruby/object:Gem::Dependency
+  name: minitest-reporters
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.10'
+- !ruby/object:Gem::Dependency
+  name: algorithms
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
+description: This gems implements some graph algorithms and representations.
+email:
+- contato@bamorim.com
+- pedrovolpi@poli.ufrj.br
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- graphos.gemspec
+- lib/graphos.rb
+- lib/graphos/algorithm/dijkstra.rb
+- lib/graphos/algorithm/prim.rb
+- lib/graphos/path.rb
+- lib/graphos/version.rb
+- lib/graphos/weighted/edge.rb
+- lib/graphos/weighted/graph.rb
+- lib/graphos/weighted/node.rb
+- lib/graphos/weighted/text_factory.rb
+- test/dijsktra_test.rb
+- test/fixtures/wgraph.txt
+- test/minitest_helper.rb
+- test/prim_test.rb
+- test/weighted/graph_test.rb
+- test/weighted/graph_text_factory_test.rb
+homepage: https://github.com/bamorim/graphos
+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: Educational gem to Graph Theory @ UFRJ
+test_files:
+- test/dijsktra_test.rb
+- test/fixtures/wgraph.txt
+- test/minitest_helper.rb
+- test/prim_test.rb
+- test/weighted/graph_test.rb
+- test/weighted/graph_text_factory_test.rb