iconofthestoneage-doodl 0.0.2 → 0.0.4

data/spec/layout/layout_spec.rb

@@ -0,0 +1,146 @@
+require 'rspec_helper'
+require 'layout/layout'
+
+include Doodl
+
+describe Location do
+  before(:each) do
+    @v = Location.new(3, 3)
+  end
+  it "should be initialized using two fixnums" do
+    lambda { Location.new(0, 0) }.should_not raise_error(Exception)
+    lambda { Location.new(0.0, 0.0) }.should_not raise_error(Exception)
+    v = Location.new(1, 0)
+    v.x.should == 1
+    v.y.should == 0
+    v = Location.new(1.1, 0.1)
+    v.x.should == 1.1
+    v.y.should == 0.1
+  end
+
+  it "should be initialized with two points" do
+    lambda { Location.new(Location.new(0,0), Location.new(0,0)) }.should_not raise_error(Exception)
+    v = Location.new(Location.new(1, 1), Location.new(2, 2))
+    v.x.should == 1
+    v.y.should == 1
+  end
+
+  it "should return have an unary - operator" do
+     v = Location.new(1, 4)
+     w = -v
+     w.x.should == -1
+     w.y.should == -4
+     v.should_not == w
+  end
+
+  it "should have a / operator" do
+    x = @v / 2.0
+    x.x.should == 1.5
+    x.y.should == 1.5
+    x.should_not == @v
+    @v.x.should == 3
+    @v.y.should == 3
+    y = @v
+    y /= 3
+    y.x == 1
+    @v.should_not == y
+  end
+
+  it "should have a * operator" do
+    x = @v * 2.0
+    x.x.should == 6.0
+    x.y.should == 6.0
+    x.should_not == @v
+    @v.y.should == 3
+    @v.y.should == 3
+    y = @v
+    y *= 3
+    y.x.should == 9
+    @v.should_not == y
+  end
+
+  it "should have an + operator" do
+    x = @v + @v
+    x.x.should == 6.0
+    x.y.should == 6.0
+    x.should_not == @v
+    @v.x.should == 3
+    @v.y.should == 3
+    y = @v
+    y += x
+    y.x.should == 9
+    @v.should_not == y
+  end
+
+  it "should have an binary - operator" do
+    x = @v - @v
+    x.x.should == 0.0
+    x.y.should == 0.0
+    x.should_not == @v
+    @v.x.should == 3
+    @v.y.should == 3
+  end
+
+  it "should have a #div! method which alters and returns the vector" do
+    @v.div!(2.0).should == @v
+    @v.x.should == 1.5
+    @v.y.should == 1.5
+  end
+
+  it "should have a #mul! method which multiplies and retruns the vector" do
+    @v.mul!(2).should == @v
+    @v.x.should == 6
+    @v.y.should == 6
+  end
+
+  it "should have a #add! method which adds two scalars and returns the vector" do
+    @v.add!(1, 2).should == @v
+    @v.x.should == 4
+    @v.y.should == 5
+  end
+
+  it "should have a #add! method which adds an other vector returns the vector" do
+    @v.add!(Location.new(1, 2)).should == @v
+    @v.x.should == 4
+    @v.y.should == 5
+  end
+
+  it "should have a #sub! method which subtracts two scalars and returns the vector" do
+    @v.sub!(1, 2).should == @v
+    @v.x.should == 2
+    @v.y.should == 1
+  end
+
+  it "should have a #add! method which subtracts an other vector returns the vector" do
+    @v.sub!(Location.new(1, 2)).should == @v
+    @v.x.should == 2
+    @v.y.should == 1
+  end
+
+  it "should return the length of the vector when sent #length" do
+    @v.length.should == Math.sqrt(18)
+  end
+
+  it "should have the length of 1 when altered by sending #normalize!" do
+    v = Location.new(3.0, 4.0)
+    length = v.length
+    v.normalize!.should == v
+    v.length.should == 1
+    (v.x / v.y).should be_close(3.0/4.0, Float::EPSILON)
+  end
+
+  it "should have a rotate_radians! method" do
+    v = Location.new(1.0, 0.0)
+    v.rotate_radians!(Math::PI).should == v
+    v.x.should be_close(-1.0, Float::EPSILON)
+    v.y.should be_close(0.0, Float::EPSILON)
+  end
+
+  it "should have a rotate! method" do
+    v = Location.new(1.0, 0.0)
+    v.rotate!(180).should == v
+    v.x.should be_close(-1.0, Float::EPSILON)
+    v.y.should be_close(0.0, Float::EPSILON)
+  end
+
+end

data/spec/node_spec.rb

@@ -0,0 +1,179 @@
+# encoding: utf-8
+
+require 'rspec_helper'
+
+require 'enumerator'
+require "node"
+
+include Doodl
+
+describe "DirectedNode" do
+
+  before(:each) do
+    @node = DirectedNode.new
+  end
+
+  it "should add an edge when sent #add_edge" do
+    @node.should respond_to(:add_out_edge)
+    lambda { @node.add_out_edge(:edge) }.should_not raise_error(Exception)
+  end
+
+  it "should return whether it includes an added edge when sent #include_edge?(edge)" do
+    @node.should respond_to(:includes_out_edge?)
+    @node.add_out_edge(:edge)
+    @node.includes_out_edge?(:edge).should == true
+    @node.includes_out_edge?(:else).should == false
+  end
+
+  it "should return a Iterator that iterates over the added edge when sent #each_edge" do
+    @node.should respond_to(:each_out_edge)
+    @node.add_out_edge(:edge)
+    @node.add_out_edge(:other)
+    enum = Enumerable::Enumerator.new(@node, :each_out_edge)
+    enum.to_a.should == [:edge, :other]
+  end
+
+  it "should return the number of included nodes when sent #degree" do
+    @node.should respond_to(:out_degree)
+    @node.out_degree.should == 0
+    @node.add_out_edge(:edge1)
+    @node.out_degree.should == 1
+  end
+
+  it "should delete an included edge when sent delete_edge(edge)" do
+    @node.should respond_to(:del_out_edge)
+    @node.add_out_edge(:edge)
+    @node.del_out_edge(:edge)
+    @node.out_degree.should == 0
+    @node.add_out_edge(:edge)
+    @node.del_out_edge(:other)
+    @node.out_degree.should == 1
+  end
+end
+
+describe "UndirectedNode" do
+
+  before(:each) do
+    @node = UndirectedNode.new
+  end
+
+  it "should add an edge when sent #add_edge" do
+    @node.should respond_to(:add_edge)
+    lambda { @node.add_edge(:edge) }.should_not raise_error(Exception)
+  end
+
+  it "should return whether it includes an added edge when sent #include_edge?(edge)" do
+    @node.should respond_to(:includes_edge?)
+    @node.add_edge(:edge)
+    @node.includes_edge?(:edge).should == true
+    @node.includes_edge?(:else).should == false
+  end
+
+  it "should return a Iterator that iterates over the added edge when sent #each_edge" do
+    @node.should respond_to(:each_edge)
+    @node.add_edge(:edge)
+    @node.add_edge(:other)
+    enum = Enumerable::Enumerator.new(@node, :each_edge)
+    enum.to_a.should == [:edge, :other]
+  end
+
+  it "should return the number of included nodes when sent #degree" do
+    @node.should respond_to(:degree)
+    @node.degree.should == 0
+    @node.add_edge(:edge1)
+    @node.degree.should == 1
+  end
+
+  it "should delete an included edge when sent delete_edge(edge)" do
+    @node.should respond_to(:del_edge)
+    @node.add_edge(:edge)
+    @node.del_edge(:edge)
+    @node.degree.should == 0
+    @node.add_edge(:edge)
+    @node.del_edge(:other)
+    @node.degree.should == 1
+  end
+
+end
+
+describe "SimpleBidirectionalNode" do
+
+  before(:each) do
+    @node = SimpleBidirectionalNode.new
+  end
+
+  it "should add an edge when sent #add_in_edge" do
+    @node.should respond_to(:add_in_edge)
+    lambda { @node.add_in_edge(:edge) }.should_not raise_error(Exception)
+  end
+
+  it "should return whether it includes an added edge when sent #include_in_edge?(edge)" do
+    @node.should respond_to(:includes_in_edge?)
+    @node.add_in_edge(:edge)
+    @node.includes_in_edge?(:edge).should == true
+    @node.includes_in_edge?(:else).should == false
+  end
+
+  it "should return a Iterator that iterates over the added edge when sent #each_in_edge" do
+    @node.should respond_to(:each_in_edge)
+    @node.add_in_edge(:edge)
+    @node.add_in_edge(:other)
+    enum = Enumerable::Enumerator.new(@node, :each_in_edge)
+    enum.to_a.should == [:edge, :other]
+  end
+
+  it "should return the number of included nodes when sent #in_degree" do
+    @node.should respond_to(:in_degree)
+    @node.in_degree.should == 0
+    @node.add_in_edge(:edge1)
+    @node.in_degree.should == 1
+  end
+
+  it "should delete an included edge when sent delete_in_edge(edge)" do
+    @node.should respond_to(:del_in_edge)
+    @node.add_in_edge(:edge)
+    @node.del_in_edge(:edge)
+    @node.in_degree.should == 0
+    @node.add_in_edge(:edge)
+    @node.del_in_edge(:other)
+    @node.in_degree.should == 1
+  end
+
+  it "should add an edge when sent #add_out_edge" do
+    @node.should respond_to(:add_out_edge)
+    lambda { @node.add_out_edge(:edge) }.should_not raise_error(Exception)
+  end
+
+  it "should return whether it includes an added edge when sent #include_out_edge?(edge)" do
+    @node.should respond_to(:includes_out_edge?)
+    @node.add_out_edge(:edge)
+    @node.includes_out_edge?(:edge).should == true
+    @node.includes_out_edge?(:else).should == false
+  end
+
+  it "should return a Iterator that iterates over the added edge when sent #each_out_edge" do
+    @node.should respond_to(:each_out_edge)
+    @node.add_out_edge(:edge)
+    @node.add_out_edge(:other)
+    enum = Enumerable::Enumerator.new(@node, :each_out_edge)
+    enum.to_a.should == [:edge, :other]
+  end
+
+  it "should return the number of included nodes when sent #out_degree" do
+    @node.should respond_to(:out_degree)
+    @node.out_degree.should == 0
+    @node.add_out_edge(:edge1)
+    @node.out_degree.should == 1
+  end
+
+  it "should delete an included edge when sent delete_out_edge(edge)" do
+    @node.should respond_to(:del_out_edge)
+    @node.add_out_edge(:edge)
+    @node.del_out_edge(:edge)
+    @node.out_degree.should == 0
+    @node.add_out_edge(:edge)
+    @node.del_out_edge(:other)
+    @node.out_degree.should == 1
+  end
+
+end

data/spec/rspec_helper.rb

@@ -0,0 +1,9 @@
+# encoding: utf-8
+
+require "rubygems"
+require "spec"
+
+$LOAD_PATH.unshift File.join(File.dirname(__FILE__), 'lib')
+$LOAD_PATH.unshift File.join(File.dirname(__FILE__), 'spec')
+$LOAD_PATH.unshift File.join(File.dirname(__FILE__), '../lib')
+$LOAD_PATH.unshift File.join(File.dirname(__FILE__), '../spec')

data/spec/rspec_suite.rb

@@ -0,0 +1,12 @@
+# encoding: utf-8
+
+dir = File.dirname(__FILE__)
+files = Dir.glob("#{dir}/**/*_spec.rb")
+begin
+  require 'java'
+rescue LoadError => e
+  files -= Dir.glob("#{dir}/jruby/**/*_spec.rb")
+end
+files.each do |file|
+  require file
+end

data/spec/shortest_path/bellman_ford_spec.rb

@@ -0,0 +1,101 @@
+require "rspec_helper"
+require "graph"
+require "shortest_path/bellman_ford"
+
+include Doodl
+
+describe "BellbanFord" do
+
+  before(:each) do
+    @graph = DirectedGraph.new
+    @u = @graph.add_node
+    @v = @graph.add_node
+    @w = @graph.add_node
+    @x = @graph.add_node
+    @y = @graph.add_node
+    @z = @graph.add_node
+
+    @uv = @graph.add_edge(@u, @v)
+    @uw = @graph.add_edge(@u, @w)
+    @ux = @graph.add_edge(@u, @x)
+    @vx = @graph.add_edge(@v, @x)
+    @xz = @graph.add_edge(@x, @z)
+    @wy = @graph.add_edge(@w, @y)
+    @yz = @graph.add_edge(@y, @z)
+
+    @weight = @graph.attach_edge_data(:weight)
+    @weight[@uv] = 1
+    @weight[@uw] = 1
+    @weight[@ux] = 1
+    @weight[@vx] = 1
+    @weight[@xz] = 1
+    @weight[@wy] = 1
+    @weight[@yz] = 1
+  end
+
+  it "should raise an ArgumentError when not initialized a graph and a start node" do
+    lambda { BellmanFord.new(Object.new, :node) }.should raise_error(ArgumentError)
+  end
+
+  it "should raise an ArgumentError when not initialized with a start_node that is a graph member" do
+    lambda { BellmanFord.new(Graph.new, :node) }.should raise_error(ArgumentError)
+  end
+
+  it "should NOT raise an ArgumentError when initialized with a weighted graph, a contained node" do
+    graph = DirectedGraph.new
+    node = graph.add_node
+    lambda { BellmanFord.new(graph, node, Hash.new(1)) }.should_not raise_error(ArgumentError)
+  end
+
+  it "should return the distance 0 for the start node" do
+    bf = BellmanFord.new(@graph, @u, @weight)
+    bf.dist[@u].should == 0
+  end
+
+  it "should return the shortest distance d(u,x) with u being the source and x being a node of the graph when sent #dist[x]" do
+    bf = BellmanFord.new(@graph, @u, @weight)
+    bf.dist[@v].should == 1
+    bf.dist[@x].should == 1
+    bf.dist[@w].should == 1
+    bf.dist[@y].should == 2
+    bf.dist[@z].should == 2
+  end
+
+  it "should return INFINITY when sent #dist[x] if x is not reachable" do
+    bf = BellmanFord.new(@graph, @z, @weight)
+    bf.dist[@u].should == INFINITY
+  end
+
+  it "should return the previous node of x in the shortes path tree when sent #prev[x]" do
+    bf = BellmanFord.new(@graph, @u, @weight)
+    bf.prev[@u].should == nil
+    bf.prev[@v].should == @u
+    bf.prev[@x].should == @u
+    bf.prev[@y].should == @w
+    bf.prev[@z].should == @x
+  end
+
+  it "should return nil when sent #prev[x] and x is not reachable" do
+    fw = BellmanFord.new(@graph, @z, @weight)
+    fw.prev[@u].should == nil
+  end
+
+  it "should return an array containing the nodes of the shortest path when sent node_path_to(x)" do
+    bf = BellmanFord.new(@graph, @u, @weight)
+    bf.node_path_to(@u).should == [@u]
+    bf.node_path_to(@v).should == [@u, @v]
+    bf.node_path_to(@z).should == [@u, @x, @z]
+  end
+
+  it "should return an array of edge representing the shortest path, when sent edge_path_to" do
+    bf = BellmanFord.new(@graph, @u, @weight)
+    bf.edge_path_to(@u).should == []
+    bf.edge_path_to(@v).should == [@graph.get_edge(@u, @v)]
+    bf.edge_path_to(@z).should == [@graph.get_edge(@u, @x), @graph.get_edge(@x, @z)]
+    bf = BellmanFord.new(@graph, @u, Hash.new(1))
+    bf.edge_path_to(@u).should == []
+    bf.edge_path_to(@v).should == [@graph.get_edge(@u, @v)]
+    bf.edge_path_to(@z).should == [@graph.get_edge(@u, @x), @graph.get_edge(@x, @z)]
+  end
+
+end