algorithms 0.1.0 → 0.2.0

data/lib/graphs/graph.rb

@@ -1,25 +0,0 @@
-class Graph
-  def initialize(string=nil, &block)
-    p block if block
-    @nodes = []
-  end
-  
-  def -(other)
-    @nodes << other
-  end
-  
-  def >(other)
-    @nodes << other
-  end
-end
-a = Graph.new
-b = []
-d = []
-
-a - b
-a > d
-
-Graph.new do
-  d - c
-  g - s
-end

data/spec/bst_spec.rb

@@ -1,31 +0,0 @@
-$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
-require "algorithms"
-
-begin
-  Containers::CBst
-  describe "binary search tree" do
-    it "should let user insert new elements with key" do
-      @bst = Containers::CBst.new
-      100.times { |x| @bst.insert(x, "hello : #{x}") }
-      @bst.size.should eql(100)
-    end
-
-    it "should allow users to delete elements" do
-      @bst = Containers::CBst.new
-      @bst.insert(10, "hello world")
-      @bst.insert(11, "hello world")
-      @bst.delete(11)
-      @bst.size.should eql(1)
-      @bst.delete(10)
-      @bst.size.should eql(0)
-    end
-
-    it "should throw exception on invalid key delete" do
-      @bst = Containers::CBst.new
-      @bst.insert(10,"Hello world")
-      lambda { @bst.delete(20) }.should raise_error(ArgumentError)
-      @bst.size.should eql(1)
-    end
-  end
-rescue Exception
-end