ds 0.0.2 → 0.0.3

data/lib/ds/ext/ext.rb

@@ -1,36 +0,0 @@
-module DS
-  module ArrayX
-
-    #Checks if array is already sorted.
-    def sorted?(order=:any)
-      return true if size < 2
-
-      case order
-      when :asc
-        (size-2).times{ |i| return false if self[i] > self[i+1] }
-      when :desc
-        (size-2).times{ |i| return false if self[i] < self[i+1] }
-      else
-        return (self[0] < self[1])? sorted?(:asc) : sorted?(:desc) 
-      end
-
-      true
-    end
-
-    #Pushes element e only if it is not already in the array. Returns index of
-    #elemnt e.
-    def push_uniq e
-      if include? e
-        index e
-      else
-        push e
-        size-1
-      end
-    end
-
-    #Tail
-    def tail
-      self[1..-1]
-    end
-  end
-end

data/lib/ds/graphs/graph_as_list.rb

@@ -1,48 +0,0 @@
-module DS
-  class GraphAsList
-
-    def initialize
-      @store = {}	 # the graph // {node => { edge1 => weight, edge2 => weight}, node2 => ...
-      @nodes = Array.new		 
-      @INFINITY = 1 << 64 	 
-    end
-
-    def add_edge(x,y,w=nil) 		# s= source, t= target, w= weight
-      if (not @store.has_key?(x))	 
-        @store[x] = {y=>w}		 
-      else
-        @store[x][y] = w         
-      end
-
-      # Begin code for non directed graph (inserts the other edge too)
-
-      if (not @store.has_key?(y))
-        @store[y] = {x=>w}
-      else
-        @store[y][x] = w
-      end
-
-      # End code for non directed graph (ie. deleteme if you want it directed)
-
-      if (not @nodes.include?(x))	
-        @nodes << x
-      end
-      if (not @nodes.include?(y))
-        @nodes << y
-      end	
-    end
-
-    def add_edges(edges)
-      for e in edges
-        add(e.from,e.to)   
-      end    
-    end
-
-    def each_vertex
-      @adj_matrix.keys.each do |vertex|
-        yield vertex
-      end
-    end
-
-  end
-end