ds 0.0.1

data/test/test_binary_tree.rb

@@ -0,0 +1,51 @@
+require 'help'
+
+describe BinaryTree do
+
+  before do
+
+    @bin_tree = BinaryTree.new
+    [2,5,8,9,11,12,14].each{|x| @bin_tree.insert(x)}
+
+    @izo_tree = BinaryTree.new
+    [2,7,8,3,11,12,14].each{|x| @izo_tree.insert(x)}
+
+    @bin_walker = TreeWalker.new(@bin_tree)
+
+  end
+    
+  it "#to_a should return tree converted to array." do
+    @bin_tree.to_a.must_equal [2,5,8,9,11,12,14]
+  end
+
+  it "#height should return tree height." do
+    @bin_tree.height.must_equal 3
+  end
+
+  it "#width should return tree width." do
+    @bin_tree.width.must_equal 4
+  end
+
+  it "#leaf_count should return number of tree leaves." do
+    @bin_tree.leaf_count.must_equal 4
+  end
+  
+  it "#get_leaves should return list of tree leaves." do
+    @bin_tree.get_leaves.to_a.collect{ |e| e.data }.must_equal [9,11,12,14]
+  end
+
+  it "#lowest_height should return node which lies closest to the root." do
+    assert @bin_tree.lowest_height.must_equal 9 
+  end
+
+  it "#mirror should mirror tree." do
+    @bin_tree.mirror!
+    @bin_tree.to_a.must_equal [2,8,5,14,12,11,9]
+  end
+
+  it "#isometric should check if tree is isometric to antother." do
+    assert @bin_tree.izometric?(@izo_tree)
+  end
+
+end
+

data/test/test_complete_binary_tree.rb

@@ -0,0 +1,30 @@
+require 'help'
+
+describe CompleteBinaryTree do
+
+  before do
+    @tree = CompleteBinaryTree.new(1,2,3,4,5,6,7)
+  end
+
+  it "#root should return root of the tree." do
+    @tree.root.must_equal 1
+  end
+
+  it "#left should return left child" do
+    @tree.left(1).must_equal 2
+    @tree.left(2).must_equal 4
+  end
+
+  it "#right should return right child" do
+    @tree.right(1).must_equal 3
+    @tree.right(2).must_equal 5
+  end
+
+  it "#parent should return parent." do
+    @tree.parent(4).must_equal 2
+    @tree.parent(5).must_equal 2
+    @tree.parent(2).must_equal 1
+  end
+
+end
+ 

data/test/test_digraph.rb

@@ -0,0 +1,134 @@
+require 'help'
+
+describe Digraph do
+
+  describe "without weighted edges" do
+
+    before do
+
+      edges = []
+      edges << Edge.new('Lukas','Marc')
+      edges << Edge.new('Lukas','Tom')
+      edges << Edge.new('Marc','Jack')
+      edges << Edge.new('Jack','Marc')
+      edges << Edge.new('Tom','Marc')
+
+      @digraph = Digraph.create(edges)
+
+    end
+
+    it "#degree should return vertex degree." do
+      @digraph.degree("Marc").must_equal 4
+      @digraph.degree("Tom").must_equal 2
+      @digraph.degree("Lukas").must_equal 2
+    end
+
+    it "#in_degree should return number of incoming edges to the vertex." do
+      @digraph.in_degree("Marc").must_equal 3
+      @digraph.in_degree("Tom").must_equal 1
+      @digraph.in_degree("Lukas").must_equal 0
+    end
+
+    it "#out_degree should return number of outgoing edges from vertex." do
+      @digraph.out_degree("Marc").must_equal 1
+      @digraph.out_degree("Tom").must_equal 1
+      @digraph.out_degree("Lukas").must_equal 2
+    end
+
+    it "#get_edge should return graph edge." do
+      lukas_tom = @digraph.get_edge("Lukas","Tom")
+      lukas_tom.from.must_equal "Lukas"
+      lukas_tom.to.must_equal "Tom"
+      lukas_tom.weight.must_equal 1
+      lukas_tom.must_be_instance_of Edge
+    end
+
+    it "#edge? should check if two vertex are connected." do
+      refute @digraph.edge?("Marc","Tom")
+      refute @digraph.edge?("Jack","Tom")
+      refute @digraph.edge?("Tom","Lukas")
+
+      assert @digraph.edge?("Tom","Marc")
+      assert @digraph.edge?("Lukas","Marc")
+    end
+
+    it "#neighbors should return array containing all neighbors for given vertex." do
+      n = @digraph.neighbors('Tom')
+      n.must_be_instance_of Array
+      n.size.must_equal 1
+      assert n.include?("Marc")
+      refute n.include?("Lukas")
+      refute n.include?("Jack")
+    end
+
+    it "#add_edge should add new edge." do
+      @digraph.add_edges([Edge.new("Marc","Kate")])
+      @digraph.vertex_size.must_equal 6
+      assert @digraph.edge?("Marc","Kate")
+      refute @digraph.edge?("Kate","Marc")
+      refute @digraph.edge?("Tom","Kate")
+    end
+
+    it "#remove_edge should remove edge." do
+      @digraph.remove("Marc","Jack")
+      @digraph.vertex_size.must_equal 4
+      refute @digraph.edge?("Marc","Jack")
+      assert @digraph.edge?("Jack","Marc")
+    end
+
+  end
+
+  describe "with weighted edges" do
+
+    before do
+      edges = []
+
+      edges << Edge.new(:A,:C,5)
+      edges << Edge.new(:A,:D,3)
+      edges << Edge.new(:A,:G,14)
+      edges << Edge.new(:C,:E,3)
+      edges << Edge.new(:C,:F,2)
+      edges << Edge.new(:D,:C,11)
+      edges << Edge.new(:D,:E,7)
+      edges << Edge.new(:D,:G,6)
+      edges << Edge.new(:G,:E,7)
+      edges << Edge.new(:E,:B,5)
+      edges << Edge.new(:G,:B,6)
+      edges << Edge.new(:F,:B,7)
+
+      @wdigraph = Digraph.create(edges)
+    end
+
+    it "edge should be assigned a weight." do
+      d_c = @wdigraph.get_edge(:D,:C)
+      d_c.weight.must_equal 11
+      d_c.from.must_equal :D
+      d_c.to.must_equal :C
+      d_c.must_be_instance_of Edge
+    end
+
+    it "#degree should return vertex degree." do
+      @wdigraph.degree(:E).must_equal 4
+      @wdigraph.degree(:C).must_equal 4
+      @wdigraph.degree(:A).must_equal 3
+    end
+
+    it "#in_degree should return number of incoming edges to the vertex." do
+      @wdigraph.in_degree(:E).must_equal 3
+      @wdigraph.in_degree(:C).must_equal 2
+      @wdigraph.in_degree(:A).must_equal 0
+    end
+
+    it "#out_degree should return number of outgoing edges from vertex." do
+      @wdigraph.out_degree(:E).must_equal 1
+      @wdigraph.out_degree(:B).must_equal 0
+      @wdigraph.out_degree(:A).must_equal 3
+    end
+
+    it "#bfs should iterate over graph in bfs order." do
+      @wdigraph.bfs(:A).must_equal [:A, :C, :D, :G, :E, :F, :B]
+    end
+  end
+end
+
+

data/test/test_expandable_array.rb

@@ -0,0 +1,26 @@
+require 'help'
+
+describe ExpandableArray do
+ 
+  describe "Zero Array" do
+    
+    before do
+      @zero_arr = ExpandableArray.new(0,0)
+      @zero_arr[0] = 1
+    end
+
+    it "access to element x should set all elements from array size to x to zero." do
+      @zero_arr.size.must_equal 1
+      @zero_arr[3].must_equal 0
+      @zero_arr.size.must_equal 4
+      @zero_arr.must_equal [1,0,0,0]
+    end
+
+    it "setting value on index x should set all elements from array size to x to zero." do
+      @zero_arr[5] = 2
+      @zero_arr.must_equal [1,0,0,0,0,2]
+    end
+  end
+end
+
+

data/test/test_graph.rb

@@ -0,0 +1,71 @@
+require 'help'
+
+describe Graph do
+
+  before do
+    edges = []
+    edges << Edge.new('Lukas','Marc')
+    edges << Edge.new('Lukas','Tom')
+    edges << Edge.new('Marc','Jack')
+    edges << Edge.new('Tom','Marc')
+    @graph = Graph.create(edges)
+  end
+
+  it "#vertex_size should return number of vertexes" do
+    @graph.vertex_size.must_equal 4
+  end
+
+  it "#degree should return degree for given vertex." do
+    @graph.degree("Marc").must_equal 3
+    @graph.degree("Jack").must_equal 1 
+    @graph.degree("Lukas").must_equal 2
+    @graph.degree("Tom").must_equal 2
+  end
+
+  it "#edge? should check if given vertexes are connected." do
+    assert @graph.edge?("Marc","Tom")
+    assert @graph.edge?("Tom","Marc")
+    refute @graph.edge?("Tom","Jack")
+    refute @graph.edge?("Jack","Tom")
+  end
+
+  it "#add_edges should add new edges." do
+    @graph.add_edges([Edge.new("Marc","Kate")])
+    @graph.vertex_size.must_equal 5
+    assert @graph.edge?("Marc","Kate")
+    assert @graph.edge?("Kate","Marc")
+    refute @graph.edge?("Tom","Kate")
+  end
+
+  it "#remove_edge should remove edge." do
+    @graph.remove("Marc","Jack")
+    @graph.vertex_size.must_equal 3
+    refute @graph.edge?("Marc","Jack")
+    refute @graph.edge?("Jack","Marc")
+  end
+
+  it "#neighbors should return all neighbors for given vertex." do
+    n = @graph.neighbors('Tom')
+    n.must_be_instance_of Array
+    n.size.must_equal 2
+    assert n.include?("Marc")
+    assert n.include?("Lukas")
+    refute n.include?("Jack")
+  end
+
+  it "should iterate edges." do 
+    r = []
+    @graph.each_edge{|e| r.push e}
+    r.size.must_equal 4
+  end
+
+  it "should iterate vertexes." do
+    r = []
+    @graph.each_vertex { |v| r.push v }
+    r.size.must_equal 4
+    r.sort.must_equal ['Jack','Lukas', 'Marc', 'Tom' ]
+  end
+
+end
+
+

data/test/test_list.rb

@@ -0,0 +1,138 @@
+require 'help'
+
+describe List do
+
+  before do
+    @list = List.from_array([1,2,3,4])
+    @list2 = List.from_array([4,5,7])
+  end
+
+  it "#from_array should transform array to list." do
+    @list.must_be_kind_of List  
+    @list.length.must_equal 4
+  end
+
+  it "#length should return list size." do
+    @list.length.must_equal 4
+    @list2.length.must_equal 3
+  end
+
+
+  it "#append should add element to the end of the list." do
+    x = 5
+    @list.append(x)
+    @list.length.must_equal 5
+    @list.last.must_be_same_as x 
+  end
+
+  it "#prepend should add element at the beginning of the list." do
+    x = 0
+    @list.prepend(x)
+    @list.length.must_equal 5
+    @list.first.must_be_same_as x
+  end
+
+  it "#remove should remove element from list." do
+    second = @list.head.next
+    @list.remove(second)
+    @list.to_a.must_equal [1,3,4]
+  end
+
+  it "#insert_before should insert new element before another." do
+    second = @list.head.next
+    @list.insert_before(9,second)
+    @list.to_a.must_equal [1,9,2,3,4]
+
+    @list.insert_before(8,@list.head)
+    @list.to_a.must_equal [8,1,9,2,3,4]
+
+    @list.insert_before(7,@list.tail)
+    @list.to_a.must_equal [8,1,9,2,3,7,4]
+
+  end
+
+  it "#insert_after should insert new element after another." do
+    second = @list.head.next
+    @list.insert_after(9,second)
+    @list.to_a.must_equal [1,2,9,3,4]
+  end
+
+
+  it "#head should point to first element of the list." do
+    @list.head.must_be_kind_of ListElement 
+    @list2.head.must_be_kind_of ListElement
+    @list.head.data.must_equal 1
+    @list2.head.data.must_equal 4
+  end
+
+  it "#tail sould point to last element of the list" do
+    @list.tail.must_be_kind_of ListElement 
+    @list2.tail.must_be_kind_of ListElement
+    @list.tail.next.must_be_nil    
+    @list2.tail.next.must_be_nil
+
+    @list.tail.data.must_equal 4
+    @list2.tail.data.must_equal 7
+  end
+
+  it "#first should return value of the first list element." do
+    @list.first.must_equal 1
+    @list2.first.must_equal 4
+  end
+
+
+  it "#last should return value of the last list element." do
+    @list.last.must_equal 4
+    @list2.last.must_equal 7
+  end
+
+  it "#zip? should check if two list are joined." do
+    refute @list.zip?(@list2)
+  end
+
+  it "#reverse! should reverse list" do
+    @list.reverse!.to_a.must_equal [4,3,2,1]
+    @list.reverse!.to_a.must_equal [1,2,3,4]
+    @list.reverse!.length.must_equal 4
+  end
+
+  it "#merge should merge two list into one." do
+    @list2.merge(@list).to_a.must_equal [1,2,3,4,4,5,7]
+  end
+
+  it "#orderize should order elements by evaluating block." do
+    not_sorted_list = List.from_array([3,-1,0,-8,2,0,1])
+    not_sorted_list.orderize{|elem| elem <=> 0}.to_a.must_equal [-1,-8,0,0,3,2,1]
+  end
+
+  it "#remove! should remove all elements that occur on the other list." do
+    @list.remove!(@list2).to_a.must_equal [1,2,3]
+  end
+
+  it "#looped? should check if list has cycle." do
+    refute @list2.looped?
+    refute @list.looped?
+  end
+
+  it "should include Enumerable methods." do
+    @list.map{ |e| e }.must_equal [1,2,3,4]
+    @list.inject(0){ |mem, var| mem = mem + var }.must_equal 10
+  end
+
+
+  describe "Zipped list" do
+
+    before do
+      last = @list.tail
+      @zipped = List.from_array([1,2])
+      @zipped.tail = last
+    end
+
+    it "#zip? should return true" do
+      assert @list.zip?(@zipped)
+    end
+
+  end
+
+  end
+