ds 0.0.4 → 0.0.6

data/test/test_digraph.rb

@@ -1,134 +0,0 @@
-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 5
-      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_graph.rb

@@ -1,80 +0,0 @@
-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 "#add should add new edge to graph." do
-    @graph.add('Jack','Lukas')
-    @graph.vertex_size.must_equal 4
-    assert @graph.edge?("Jack","Lukas")
-    assert @graph.edge?("Lukas","Jack")
-  end
-
-
-
-  it "#remove_edge should remove edge." do
-    @graph.remove("Marc","Jack")
-    @graph.vertex_size.must_equal 4
-    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_ordered_set.rb

@@ -1,28 +0,0 @@
-require 'help'
-
-describe "OrderedSet" do
-
-  before do
-    @set = OrderedSet.new
-    @set.push(:first).must_equal 0
-  end
-
-  it "#push should add new element to set and return its index." do
-    @set.push(:second).must_equal 1
-    @set.push(:first).must_equal 0
-  end
-
-  it "#index should return element index." do
-    @set.index(:first).must_equal 0
-    @set.push(:second)
-    @set.index(:second).must_equal 1
-    @set.index(:non_exist).must_be_nil
-  end
-
-  it "#to_a should return array." do
-    @set.push(:second)
-    @set.to_a.must_equal [:first,:second]
-  end
-
-end
-

data/test/test_ring.rb

@@ -1,28 +0,0 @@
-require 'help'
-
-describe "Cyclic List" do
-
-  before do
-    @ring = Ring.from_array([1,2,3,4,5,6,7])
-  end
-
-  it "#from_array should create ring from array." do
-    @ring.must_be_kind_of List
-    @ring.must_be_instance_of Ring
-    @ring.length.must_equal 7
-  end
-
-  it "should be looped." do
-    assert @ring.looped?
-  end
-
-  it "should has cycle." do
-    @ring.cycle_size.must_equal 7
-  end
-
-  it "#eliminate_by should remove elements by given offset until there is one element." do
-    @ring.eliminate_by(3).must_equal 4
-    @ring.eliminate_by(2).must_equal 1
-  end
-end
-