iconofthestoneage-doodl 0.0.2 → 0.0.4

data/spec/shortest_path/dijkstra_spec.rb

@@ -0,0 +1,133 @@
+require "rspec_helper"
+
+require "shortest_path/dijkstra"
+
+include Doodl
+
+describe "DijkstraShortestPath with Directed Graph n[@u, @v, @w, @x, @y, @z] e[(uv), (uw), (ux), (vx), (xz), (wy), (yz)]" do
+  
+  before(:each) do
+    @g = DirectedGraph.new
+    @n = @g.add_node
+    
+    @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)
+  end
+  
+  it "should raise an ArgumentError when not initialized with a Graph" do
+    lambda { DijkstraShortestPath.new(:something, :else) }.should raise_error(ArgumentError)
+  end
+
+  it "should raise an ArgumentError when initialized with a source that is not part of the graph" do
+    lambda { DijkstraShortestPath.new(DirectedGraph.new, :node) }.should raise_error(ArgumentError)
+    lambda { DijkstraShortestPath.new(@g, @n) }.should_not raise_error(ArgumentError)
+  end
+  
+  it "should raise ArgumentError when initialized with a weight_key that isn't part of the graph" do
+    lambda { DijkstraShortestPath.new(@g, @n, :key) }.should raise_error(ArgumentError)
+    @g.attach_edge_data(:key)
+    lambda { DijkstraShortestPath.new(@g, @n, :key) }.should_not raise_error(ArgumentError)
+  end
+  
+  it "should return the shortest distance d(u,x) with u being the source and x being a node of the unweighted graph when sent #dist[x]" do
+    @dsp = DijkstraShortestPath.new(@graph, @u)
+    @dsp.dist[@u].should == 0
+    @dsp.dist[@v].should == 1
+    @dsp.dist[@x].should == 1
+    @dsp.dist[@w].should == 1
+    @dsp.dist[@y].should == 2
+    @dsp.dist[@z].should == 2
+  end
+  
+  it "should return INFINITY when sent #dist[x] if x is not reachable" do
+    n = @graph.add_node
+    @dsp = DijkstraShortestPath.new(@graph, @u)
+    @dsp.dist[n].should == INFINITY
+    @dsp = DijkstraShortestPath.new(@graph, @z)
+    @dsp.dist[@u].should == INFINITY
+  end
+  
+  it "should return the previous node of x in the shortes path tree when sent #prev[x]" do
+    @dsp = DijkstraShortestPath.new(@graph, @u)
+    @dsp.prev[@u].should == nil
+    @dsp.prev[@v].should == @u
+    @dsp.prev[@x].should == @u
+    @dsp.prev[@y].should == @w
+    @dsp.prev[@z].should == @x
+  end
+  
+  it "should return nil when sent #prev[x] and x is not reachable" do
+    n = @graph.add_node
+    @dsp = DijkstraShortestPath.new(@graph, @u)
+    @dsp.prev[n].should == nil
+  end
+  
+  it "should return an array containing the nodes of the shortest path when sent node_path_to(x)" do
+    @dsp = DijkstraShortestPath.new(@graph, @u)
+    @dsp.node_path_to(@u).should == [@u]
+    @dsp.node_path_to(@v).should == [@u, @v]
+    @dsp.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
+    @dsp = DijkstraShortestPath.new(@graph, @u)
+    @dsp.edge_path_to(@u).should == []
+    @dsp.edge_path_to(@v).should == [@graph.get_edge(@u, @v)]
+    @dsp.edge_path_to(@z).should == [@graph.get_edge(@u, @x), @graph.get_edge(@x, @z)]
+  end
+
+end
+
+describe "DijkstraShortestPath with Undirected Graph n = [a, b, c, d] e[(ab), (bc), (cd), (da)]" do
+  before(:each) do
+    @graph = UndirectedGraph.new
+    @a = @graph.add_node
+    @b = @graph.add_node
+    @c = @graph.add_node
+    @d = @graph.add_node
+    @ab = @graph.add_edge(@a, @b)
+    @bc = @graph.add_edge(@b, @c)
+    @cd = @graph.add_edge(@c, @d)
+    @da = @graph.add_edge(@d, @a)
+  end
+  
+  
+  it "should return the shortest distance d(u,x) with u being the source and x being a node of the unweighted undirected graph when sent #dist[x]" do
+    @dsp = DijkstraShortestPath.new(@graph, @a)
+    @dsp.dist[@a].should == 0
+    @dsp.dist[@b].should == 1
+    @dsp.dist[@c].should == 2
+    @dsp.dist[@d].should == 1
+  end
+  
+  it "should return the previous node of x in the shortes path tree when sent #prev[x]" do
+    @dsp = DijkstraShortestPath.new(@graph, @a)
+    @dsp.prev[@a].should == nil
+    @dsp.prev[@b].should == @a
+    @dsp.prev[@c].should == @b
+    @dsp.prev[@d].should == @a
+  end
+  
+  it "should return an array containing the nodes of the shortest path when sent node_path_to(x)" do
+    @dsp = DijkstraShortestPath.new(@graph, @a)
+    @dsp.node_path_to(@a).should == [@a]
+    @dsp.node_path_to(@b).should == [@a, @b]
+    @dsp.node_path_to(@c).should == [@a, @b, @c]
+    @dsp.node_path_to(@d).should == [@a, @d]
+  end
+  
+
+end

data/spec/shortest_path/floyd_warshall_spec.rb

@@ -0,0 +1,84 @@
+require "rspec_helper"
+require "shortest_path/floyd_warshall"
+
+include Doodl
+
+describe "floyd_warshall" 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)
+  end
+  
+  it "should raise an ArgumentError when not initialized with a Graph" do
+    lambda { FloydWarshall.new(:something, :else) }.should raise_error(ArgumentError)
+  end
+
+  it "should raise an ArgumentError when initialized with a source that is not part of the graph" do
+    lambda { FloydWarshall.new(DirectedGraph.new, :node) }.should raise_error(ArgumentError)
+    lambda { FloydWarshall.new(DirectedGraph.new) }.should_not raise_error(ArgumentError)
+  end
+  
+  it "should raise ArgumentError when initialized with a weight_key that isn't part of the graph" do
+    graph = DirectedGraph.new
+    lambda { FloydWarshall.new(graph, :key) }.should raise_error(ArgumentError)
+    graph.attach_edge_data(:key)
+    lambda { FloydWarshall.new(graph, :key) }.should_not raise_error(ArgumentError)
+  end
+  
+  it "should calculate all shortest paths" do
+    fw = FloydWarshall.new(@graph)
+    fw.dist[[@u,@u]].should == 0
+    fw.dist[[@u,@v]].should == 1
+    fw.dist[[@u,@x]].should == 1
+    fw.dist[[@u,@w]].should == 1
+    fw.dist[[@u,@y]].should == 2
+    fw.dist[[@u,@z]].should == 2
+  end
+  
+  it "should return INFINITY when sent #dist[x] if x is not reachable" do
+    n = @graph.add_node
+    fw = FloydWarshall.new(@graph)
+    fw.dist[[@u,n]].should == INFINITY
+    fw = FloydWarshall.new(@graph)
+    fw.dist[[@z,@u]].should == INFINITY
+  end
+  
+  it "should return the previous node of x in the shortes path tree when sent #prev[x]" do
+    fw = FloydWarshall.new(@graph)
+    fw.prev[[@u,@u]].should == nil
+    fw.prev[[@u,@v]].should == @u
+    fw.prev[[@u,@x]].should == @u
+    fw.prev[[@u,@y]].should == @w
+    fw.prev[[@u,@z]].should == @x
+  end
+  
+  it "should return an array containing the nodes of the shortest path when sent node_path(x, y)" do
+    fw = FloydWarshall.new(@graph)
+    fw.node_path(@u, @u).should == [@u]
+    fw.node_path(@u, @v).should == [@u, @v]
+    fw.node_path(@u, @z).should == [@u, @x, @z]
+  end
+  
+  it "should return an array of edge representing the shortest path, when sent edge_path(x, y)" do
+    fw = FloydWarshall.new(@graph)
+    fw.edge_path(@u, @u).should == []
+    fw.edge_path(@u, @v).should == [@graph.get_edge(@u, @v)]
+    fw.edge_path(@u, @z).should == [@graph.get_edge(@u, @x), @graph.get_edge(@x, @z)]
+  end
+  
+  
+end

data/spec/shortest_path/johnson_all_pair_spec.rb

@@ -0,0 +1,90 @@
+require 'rspec_helper'
+require 'shortest_path/johnson_all_pair'
+
+include Doodl
+
+describe "JohnsonAllPairShortestPaths" 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 with a Graph" do
+    lambda { JohnsonAllPairShortestPaths.new(:something, :else) }.should raise_error(ArgumentError)
+  end
+  
+  it "should NOT raise an ArgumentError when called without a weight key" do
+    lambda { JohnsonAllPairShortestPaths.new(DirectedGraph.new) }.should_not raise_error(ArgumentError)
+  end
+  
+  it "should calculate all shortest paths" do
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.dist[[@u,@u]].should == 0
+    japsp.dist[[@u,@v]].should == 1
+    japsp.dist[[@u,@x]].should == 1
+    japsp.dist[[@u,@w]].should == 1
+    japsp.dist[[@u,@y]].should == 2
+    japsp.dist[[@u,@z]].should == 2
+  end
+  
+  it "should return INFINITY when sent #dist[x] if x is not reachable" do
+    n = @graph.add_node
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.dist[[@u,n]].should == INFINITY
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.dist[[@z,@u]].should == INFINITY
+  end
+  
+  it "should return the previous node of x in the shortes path tree when sent #prev[x]" do
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.prev[[@u,@u]].should == nil
+    japsp.prev[[@u,@v]].should == @u
+    japsp.prev[[@u,@x]].should == @u
+    japsp.prev[[@u,@y]].should == @w
+    japsp.prev[[@u,@z]].should == @x
+  end
+  
+  it "should return an array containing the nodes of the shortest path when sent node_path(x, y)" do
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.node_path(@u, @u).should == [@u]
+    japsp.node_path(@u, @v).should == [@u, @v]
+    japsp.node_path(@u, @z).should == [@u, @x, @z]
+  end
+  
+  it "should return an array of edge representing the shortest path, when sent edge_path(x, y)" do
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.edge_path(@u, @u).should == []
+    japsp.edge_path(@u, @v).should == [@graph.get_edge(@u, @v)]
+    japsp.edge_path(@u, @z).should == [@graph.get_edge(@u, @x), @graph.get_edge(@x, @z)]
+  end
+  
+  it "should return the diameter when sent #diameter" do
+    japsp = JohnsonAllPairShortestPaths.new(@graph, @weight)
+    japsp.diameter.should == 2
+  end
+  
+  
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: iconofthestoneage-doodl
 version: !ruby/object:Gem::Version 
-  version: 0.0.2
+  version: 0.0.4
 platform: ruby
 authors: 
 - Marc Rummel
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2009-02-05 00:00:00 -08:00
+date: 2009-02-06 00:00:00 -08:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -40,8 +40,49 @@ extensions: []
 extra_rdoc_files: []
 
 files: 
+- lib/app/selfrunning.rb
+- lib/app/simple_app.rb
+- lib/app/simple_controller.rb
+- lib/app/simple_model.rb
+- lib/app/simple_view.rb
+- lib/breadth_first_search.rb
+- lib/connected_components.rb
+- lib/depth_first_search.rb
+- lib/edge.rb
+- lib/graph.rb
+- lib/graph_canvas.rb
+- lib/graph_generator.rb
+- lib/jruby/renderer.rb
+- lib/layout/collapse_layout.rb
+- lib/layout/fr_layout.rb
+- lib/layout/isom_layout.rb
+- lib/layout/kk_layout.rb
+- lib/layout/layout.rb
+- lib/layout/morph_layout.rb
+- lib/node.rb
+- lib/shortest_path/all_pair.rb
+- lib/shortest_path/bellman_ford.rb
+- lib/shortest_path/dijkstra.rb
+- lib/shortest_path/floyd_warshall.rb
+- lib/shortest_path/johnson_all_pair.rb
+- lib/shortest_path/single_source.rb
 - bin/doodl-app
 - bin/doodl-demo
+- spec/breadth_first_search_spec.rb
+- spec/connected_components_spec.rb
+- spec/depth_first_search_spec.rb
+- spec/edge_spec.rb
+- spec/graph_generator_spec.rb
+- spec/graph_spec.rb
+- spec/jruby/renderer_spec.rb
+- spec/layout/layout_spec.rb
+- spec/node_spec.rb
+- spec/rspec_helper.rb
+- spec/rspec_suite.rb
+- spec/shortest_path/bellman_ford_spec.rb
+- spec/shortest_path/dijkstra_spec.rb
+- spec/shortest_path/floyd_warshall_spec.rb
+- spec/shortest_path/johnson_all_pair_spec.rb
 has_rdoc: true
 homepage: http://iconofthestoneage.github.com/doodl
 post_install_message: