abstract_graph 1.0.0 → 1.1.0

data/spec/abstract_graph/graph/change_vertex_name_spec.rb

@@ -0,0 +1,40 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    before :all do
+      @vertex = "MyVertex"
+      @vertexchanged = "MyChangedName"
+    end
+
+    before :each do
+      @graph = Graph.new
+      @graph.add_vertex @vertex
+    end
+
+    describe "#change_vertex_name(String,String)" do
+
+      it "returns an object of class Graph" do
+        @graph.change_vertex_name( @vertex, @vertexchanged ).should be_an_instance_of(Graph)
+      end
+
+      it "changes the name of the vertex" do
+        @graph.change_vertex_name( @vertex, @vertexchanged )
+        @graph.has_vertex?( @vertex ).should be_false
+        @graph.has_vertex?( @vertexchanged ).should be_true
+      end
+
+      it "returns nil if the vertex does not exist" do
+        @graph.change_vertex_name( @vertexchanged, @vertex ).should be_nil
+      end
+
+      it "throws an exception if the name has already been taken" do
+        @graph.add_vertex @vertexchanged
+        expect { @graph.change_vertex_name( @vertex, @vertexchanged ) }.to raise_error
+      end
+
+    end
+
+  end
+end

data/spec/abstract_graph/graph/dup_spec.rb

@@ -1,37 +1,42 @@
 require 'spec_helper'
 
 module AbstractGraph
-  module Composition
-    describe Graph do
+  describe Graph do
 
-      before :each do
-        @graph = Graph.new
-        @graph.add_vertex "MyVertex"
-      end
+    before :each do
+      @graph = Graph.new
+      @graph.add_vertex "MyVertex"
+      @graph.add_vertex "MyOtherVertex"
+      @graph.add_edge "MyEdge", "MyVertex", "MyOtherVertex"
+    end
 
-      describe "#dup" do
+    describe "#dup" do
 
-        it "returns a graph object" do
-          @graph.dup.should be_an_instance_of(Graph)
-        end
+      it "returns a graph object" do
+        @graph.dup.should be_an_instance_of(Graph)
+      end
 
-        it "has a different id than the original graph" do
-          @graph.object_id.should_not == @graph.dup.object_id
-        end
+      it "has a different id than the original graph" do
+        @graph.object_id.should_not == @graph.dup.object_id
+      end
 
-        it "copies over the existing vertices" do
-          graphdup = @graph.dup
-          graphdup.has_vertex?( "MyVertex" ).should be_true
-        end
+      it "copies over the existing vertices" do
+        graphdup = @graph.dup
+        graphdup.has_vertex?( "MyVertex" ).should be_true
+      end
 
-        it "will not modify the original if it is modified" do
-          graphdup = @graph.dup
-          graphdup.vertices.clear
-          @graph.vertices.size.should == 1
-        end
+      it "copies over the existing edges" do
+        graphdup = @graph.dup
+        graphdup.has_edge?( "MyEdge" ).should be_true
+      end
 
+      it "will not modify the original if it is modified" do
+        graphdup = @graph.dup
+        graphdup.vertices.clear
+        @graph.vertices.size.should == 2
       end
 
     end
+
   end
 end

data/spec/abstract_graph/graph/get_edge_name_spec.rb

@@ -0,0 +1,38 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    before :all do
+      # create the 3-path
+      @v1 = "v1"
+      @v2 = "v2"
+      @v3 = "v3"
+      @e1 = "e1"
+      @e2 = "e2"
+    end
+
+    before :each do
+      @graph = Graph.new
+      @graph.add_vertex @v1
+      @graph.add_vertex @v2
+      @graph.add_vertex @v3
+      @graph.add_edge @e1, @v1, @v2
+      @graph.add_edge @e2, @v3, @v2
+    end
+
+    describe "#get_edge_name(String,String)" do
+
+      it "returns the name of the edge connecting the two string vertices" do
+        @graph.get_edge_name( @v1, @v2 ).should eql(@e1)
+        @graph.get_edge_name( @v2, @v3 ).should eql(@e2)
+      end
+
+      it "returns nil if the two vertices are not adjacent" do
+        @graph.get_edge_name( @v1, @v3).should be_nil
+      end
+
+    end
+
+  end
+end

data/spec/abstract_graph/graph/has_edge_spec.rb

@@ -1,31 +1,29 @@
 require 'spec_helper'
 
 module AbstractGraph
-  module Composition
-    describe Graph do
+  describe Graph do
 
-      before :each do
-        @vertex1 = "Vertex1"
-        @vertex2 = "Vertex2"
-        @graph = Graph.new
-        @graph.add_vertex @vertex1
-        @graph.add_vertex @vertex2
-      end
-
-      describe "#has_edge?(String)" do
+    before :each do
+      @vertex1 = "Vertex1"
+      @vertex2 = "Vertex2"
+      @graph = Graph.new
+      @graph.add_vertex @vertex1
+      @graph.add_vertex @vertex2
+    end
 
-        it "returns whether the string name is a named edge in the graph" do
-          @graph.add_edge( "MyEdge", @vertex1, @vertex2 )
-          @graph.has_edge?( "MyEdge" ).should be_true
-        end
+    describe "#has_edge?(String)" do
 
-        it "returns false when the string is not a named edge" do
-          @graph.has_edge?( "MyVertex" ).should be_false
-          @graph.has_edge?( "AlsoFalse" ).should_not be_nil
-        end
+      it "returns whether the string name is a named edge in the graph" do
+        @graph.add_edge( "MyEdge", @vertex1, @vertex2 )
+        @graph.has_edge?( "MyEdge" ).should be_true
+      end
 
+      it "returns false when the string is not a named edge" do
+        @graph.has_edge?( "MyVertex" ).should be_false
+        @graph.has_edge?( "AlsoFalse" ).should_not be_nil
       end
 
     end
+
   end
 end

data/spec/abstract_graph/graph/has_vertex_spec.rb

@@ -1,27 +1,25 @@
 require 'spec_helper'
 
 module AbstractGraph
-  module Composition
-    describe Graph do
+  describe Graph do
 
-      before :each do
-        @graph = Graph.new
-      end
-
-      describe "#has_vertex?(String)" do
+    before :each do
+      @graph = Graph.new
+    end
 
-        it "returns whether the string name is a named vertex in the graph" do
-          @graph.add_vertex "MyVertex"
-          @graph.has_vertex?( "MyVertex" ).should be_true
-        end
+    describe "#has_vertex?(String)" do
 
-        it "returns false when the string is not a named vertex" do
-          @graph.has_vertex?( "MyVertex" ).should be_false
-          @graph.has_vertex?( "AlsoFalse" ).should_not be_nil
-        end
+      it "returns whether the string name is a named vertex in the graph" do
+        @graph.add_vertex "MyVertex"
+        @graph.has_vertex?( "MyVertex" ).should be_true
+      end
 
+      it "returns false when the string is not a named vertex" do
+        @graph.has_vertex?( "MyVertex" ).should be_false
+        @graph.has_vertex?( "AlsoFalse" ).should_not be_nil
       end
 
     end
+
   end
 end

data/spec/abstract_graph/graph/is_adjacent_spec.rb

@@ -0,0 +1,36 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    before :all do
+      @vertex1 = "Vertex1"
+      @vertex2 = "Vertex2"
+      @vertex3 = "Vertex3"
+      @edge1 = "Edge1"
+      @edge2 = "Edge2"
+    end
+
+    before :each do
+      @graph = Graph.new
+      @graph.add_vertex @vertex1
+      @graph.add_vertex @vertex2
+      @graph.add_vertex @vertex3
+      @graph.add_edge @edge1, @vertex1, @vertex2
+      @graph.add_edge @edge2, @vertex2, @vertex3
+    end
+
+    describe "#is_adjacent?(String,String)" do
+
+      it "returns true if two vertices are joined with an edge" do
+        @graph.is_adjacent?( @vertex1, @vertex2 ).should be_true
+      end
+
+      it "returns false if two vertices are not joined with an edge" do
+        @graph.is_adjacent?( @vertex1, @vertex3 ).should be_false
+      end
+
+    end
+
+  end
+end

data/spec/abstract_graph/graph/merge_vertices_spec.rb

@@ -0,0 +1,199 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    before :all do
+      # we're building a 4-cycle!
+      @v1 = "v1"
+      @v2 = "v2"
+      @v3 = "v3"
+      @v4 = "v4"
+      @vmerged = "vMerged"
+      @e1 = "e1"
+      @e2 = "e2"
+      @e3 = "e3"
+      @e4 = "e4"
+    end
+
+    before :each do
+      @g = Graph.new
+      @g.add_vertex @v1
+      @g.add_vertex @v2
+      @g.add_vertex @v3
+      @g.add_vertex @v4
+      @g.add_edge @e1, @v1, @v2
+      @g.add_edge @e2, @v2, @v3
+      @g.add_edge @e3, @v3, @v4
+      @g.add_edge @e4, @v4, @v1
+    end
+
+    describe "#merge_vertices(String,String,String)" do
+
+      it "returns an object of type graph" do
+        @g.merge_vertices( @v1, @v2, @vmerged ).should be_an_instance_of(Graph)
+      end
+
+      it "does not modify the original graph" do
+        @g.merge_vertices @v1, @v2, @vmerged
+        @g.has_vertex?( @v1 ).should be_true
+        @g.has_vertex?( @v2 ).should be_true
+      end
+
+      it "removes the first two vertices" do
+        @gnext = @g.merge_vertices @v1, @v2, @vmerged
+        @gnext.has_vertex?( @v1 ).should be_false
+        @gnext.has_vertex?( @v2 ).should be_false
+      end
+
+      it "creates a vertex of the third string" do
+        @gnext = @g.merge_vertices @v1, @v2, @vmerged
+        @gnext.has_vertex?( @vmerged ).should be_true
+      end
+
+      it "removes the edge connecting the two vertices" do
+        @gnext = @g.merge_vertices @v1, @v2, @vmerged
+        @gnext.has_edge?( @e1 ).should be_false
+      end
+
+      it "connects the merged vertex with the vertices adjacent to the previous two" do
+        @gnext = @g.merge_vertices @v1, @v2, @vmerged
+        @gnext.is_adjacent?( @vmerged, @v3 ).should be_true
+        @gnext.is_adjacent?( @vmerged, @v4 ).should be_true
+        @gnext = @g.merge_vertices @v1, @v3, @vmerged
+        @gnext.is_adjacent?( @vmerged, @v2 ).should be_true
+        @gnext.is_adjacent?( @vmerged, @v4 ).should be_true
+      end
+
+      it "preserves the edges of the first vertex over the second" do
+        @gnext = @g.merge_vertices @v1, @v3, @vmerged
+        @gnext.has_edge?( @e1 ).should be_true
+        @gnext.has_edge?( @e2 ).should be_false
+        @gnext.has_edge?( @e3 ).should be_false
+        @gnext.has_edge?( @e4 ).should be_true
+      end
+
+    end
+
+    describe "#merge_vertices!(String,String,String)" do
+
+      it "returns an object of type graph" do
+        @g.merge_vertices!( @v1, @v2, @vmerged ).should be_an_instance_of(Graph)
+      end
+
+      it "modifies the original graph" do
+        @g.merge_vertices! @v1, @v2, @vmerged
+        @g.has_vertex?( @v1 ).should be_false
+        @g.has_vertex?( @v2 ).should be_false
+      end
+
+      it "removes the first two vertices" do
+        @g.merge_vertices! @v1, @v2, @vmerged
+        @g.has_vertex?( @v1 ).should be_false
+        @g.has_vertex?( @v2 ).should be_false
+      end
+
+      it "creates a vertex of the third string" do
+        @g.merge_vertices! @v1, @v2, @vmerged
+        @g.has_vertex?( @vmerged ).should be_true
+      end
+
+      it "removes the edge connecting the two vertices" do
+        @g.merge_vertices! @v1, @v2, @vmerged
+        @g.has_edge?( @e1 ).should be_false
+      end
+
+      it "connects the merged vertex with the vertices adjacent to the previous two" do
+        @g.merge_vertices! @v1, @v3, @vmerged
+        @g.is_adjacent?( @vmerged, @v2 ).should be_true
+        @g.is_adjacent?( @vmerged, @v4 ).should be_true
+      end
+
+      it "preserves the edges of the first vertex over the second" do
+        @g.merge_vertices! @v1, @v3, @vmerged
+        @g.has_edge?( @e1 ).should be_true
+        @g.has_edge?( @e2 ).should be_false
+        @g.has_edge?( @e3 ).should be_false
+        @g.has_edge?( @e4 ).should be_true
+      end
+
+    end
+
+    describe "#merge_vertices(Array,String)" do
+
+      it "deletes the vertices in the array" do
+        arr = [ @v1, @v2 ]
+        @gnext = @g.merge_vertices( arr, @vmerged )
+        arr.each do |v|
+          @gnext.has_vertex?( v ).should be_false
+        end
+      end
+
+      it "removes the edges connecting the vertices in the array" do
+        arrV = [ @v1, @v2, @v3 ]
+        arrE = [ @e1, @e2 ]
+        @gnext = @g.merge_vertices( arrV, @vmerged )
+        arrE.each do |e|
+          @gnext.has_edge?( e ).should be_false
+        end
+      end
+
+      it "connects the merged vertex with the vertices in the array" do
+        arr = [ @v1, @v3 ]
+        @gnext = @g.merge_vertices( arr, @vmerged )
+        [ @v2, @v4 ].each do |v|
+          @gnext.is_adjacent?( @vmerged, v ).should be_true
+        end
+      end
+
+      it "preserves the edges of earlier vertices than later" do
+        arr = [ @v1, @v3 ]
+        @gnext = @g.merge_vertices( arr, @vmerged )
+        @gnext.has_edge?( @e1 ).should be_true
+        @gnext.has_edge?( @e2 ).should be_false
+        @gnext.has_edge?( @e3 ).should be_false
+        @gnext.has_edge?( @e4 ).should be_true
+      end
+
+    end
+
+    describe "#merge_vertices!(Array,String)" do
+
+      it "deletes the vertices in the array" do
+        arr = [ @v1, @v2 ]
+        @g.merge_vertices!( arr, @vmerged )
+        arr.each do |v|
+          @g.has_vertex?( v ).should be_false
+        end
+      end
+
+      it "removes the edges connecting the vertices in the array" do
+        arrV = [ @v1, @v2, @v3 ]
+        arrE = [ @e1, @e2 ]
+        @g.merge_vertices!( arrV, @vmerged )
+        arrE.each do |e|
+          @g.has_edge?( e ).should be_false
+        end
+      end
+
+      it "connects the merged vertex with the vertices in the array" do
+        arr = [ @v1, @v3 ]
+        @g.merge_vertices!( arr, @vmerged )
+        [ @v2, @v4 ].each do |v|
+          @g.is_adjacent?( @vmerged, v ).should be_true
+        end
+      end
+
+      it "preserves the edges of earlier vertices than later" do
+        arr = [ @v1, @v3 ]
+        @g.merge_vertices!( arr, @vmerged )
+        @g.has_edge?( @e1 ).should be_true
+        @g.has_edge?( @e2 ).should be_false
+        @g.has_edge?( @e3 ).should be_false
+        @g.has_edge?( @e4 ).should be_true
+      end
+
+    end
+
+  end
+end

data/spec/abstract_graph/graph/split_vertex_spec.rb

@@ -0,0 +1,104 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    before :all do
+      @v1       = "v1"
+      @v2       = "v2"
+      @v3       = "v3"
+      @v4       = "v4"
+      @vsplit1  = "v1-1"
+      @vsplit2  = "v1-2"
+      @e1       = "e1"
+      @e2       = "e2"
+      @e3       = "e3"
+      @e4       = "e4"
+      @esplit1  = "e1-1"
+      @esplit2  = "e1-2"
+    end
+
+    before :each do
+      @g5path   = Graph.path_graph 5
+      @g = Graph.new
+      @g.add_vertex @v1
+      @g.add_vertex @v2
+      @g.add_vertex @v3
+      @g.add_vertex @v4
+      @g.add_edge   @e1, @v1, @v2
+      @g.add_edge   @e2, @v2, @v3
+      @g.add_edge   @e3, @v3, @v4
+      @g.add_edge   @e4, @v4, @v2
+    end
+
+    describe "#split_vertex(String)" do
+
+      it "returns an object of type graph" do
+        @g.split_vertex(@v1).should be_an_instance_of(Graph)
+      end
+
+      it "does not modify the original graph" do
+        @g.split_vertex(@v1)
+        @g.has_vertex?( @v1 ).should be_true
+        @g.has_vertex?( @v2 ).should be_true
+        @g.has_edge?( @e1 ).should be_true
+        @g.has_vertex?( @vsplit1 ).should be_false
+        @g.has_vertex?( @vsplit2 ).should be_false
+        @g.has_edge?( @esplit1 ).should be_false
+      end
+
+      it "removes the original vertex and adjacent edges" do
+        @gnext = @g.split_vertex @v1
+        @gnext.has_vertex?( @v1 ).should be_false
+        @gnext.has_edge?( @e1 ).should be_false
+
+        @gnext = @g5path.split_vertex "v4"
+        @gnext.has_vertex?("v4").should be_false
+        @gnext.has_vertex?( "e6" ).should be_false
+        @gnext.has_vertex?( "e12" ).should be_false
+      end
+
+      it "adds split versions of the original vertex and adjacent edges" do
+        @gnext = @g.split_vertex @v1
+        @gnext.has_vertex?( @vsplit1 ).should be_true
+        @gnext.has_vertex?( @vsplit2 ).should be_true
+        @gnext.has_edge?( @esplit1 ).should be_true
+        @gnext.has_edge?( @esplit2 ).should be_true
+
+        @gnext = @g5path.split_vertex "v4"
+        @gnext.has_vertex?( "v4-1" ).should be_true
+        @gnext.has_vertex?( "v4-2" ).should be_true
+        @gnext.has_edge?( "e6-1" ).should be_true
+        @gnext.has_edge?( "e6-2" ).should be_true
+        @gnext.has_edge?( "e12-1" ).should be_true
+        @gnext.has_edge?( "e12-2" ).should be_true
+      end
+
+      it "connects the split vertices with previous adjacent vertices" do
+        @gnext = @g.split_vertex @v1
+        @gnext.is_adjacent?( @vsplit1, @v2 ).should be_true
+        @gnext.is_adjacent?( @vsplit2, @v2 ).should be_true
+
+        @gnext = @g5path.split_vertex "v4"
+        @gnext.is_adjacent?( "v4-1", "v2" ).should be_true
+        @gnext.is_adjacent?( "v4-2", "v2" ).should be_true
+        @gnext.is_adjacent?( "v4-1", "v8" ).should be_true
+        @gnext.is_adjacent?( "v4-2", "v8" ).should be_true
+      end
+
+      it "can be chained to create very elaborate graphs very fast" do
+        @gnext = @g5path.split_vertex("v2").split_vertex("v4")
+        @gnext.is_adjacent?( "v2-1", "v1" ).should be_true
+        @gnext.is_adjacent?( "v2-2", "v1" ).should be_true
+        @gnext.is_adjacent?( "v4-1", "v8" ).should be_true
+        @gnext.is_adjacent?( "v4-2", "v8" ).should be_true
+        @gnext.is_adjacent?( "v4-1", "v2-1" ).should be_true
+        @gnext.is_adjacent?( "v4-2", "v2-1" ).should be_true
+        @gnext.is_adjacent?( "v4-1", "v2-2" ).should be_true
+        @gnext.is_adjacent?( "v4-2", "v2-2" ).should be_true
+      end
+
+    end
+
+  end
+end

data/spec/abstract_graph/graph/templates/complete_bipartite_graph_spec.rb

@@ -0,0 +1,63 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    describe ".complete_bipartite_graph(Integer,Integer)" do
+
+      before :all do
+        @n, @m = 5, 6
+        @graphknm = Graph.complete_bipartite_graph @n, @m
+        @graphk1010 = Graph.complete_bipartite_graph 10, 10
+      end
+
+      it "returns an object of class Graph" do
+        Graph.complete_bipartite_graph(1, 1).should be_an_instance_of(Graph)
+      end
+
+      it "creates as many vertices as the sum of the Integers, named with powers of two" do
+        (@n + @m).times do |i|
+          @graphknm.has_vertex?("v#{2**i}").should be_true
+        end
+        @graphk1010.has_vertex?("v#{2**19}").should be_true
+      end
+
+      it "ensures the first Integer vertices have second Integer degree" do
+        (@n).times do |i|
+          @graphknm.adjacency_list("v#{2**i}").size.should eql(@m)
+        end
+      end
+
+      it "ensures the second Integer vertices are vertices (First Integer..Second Integer - 1) and have first integer degree" do
+        (@m).times do |i|
+          @graphknm.adjacency_list("v#{2**(i+@n)}").size.should eql(@n)
+        end
+      end
+
+      it "creates as many edges as the product of the Integers" do
+        adjacencies = 0
+        (@n + @m).times do |i|
+          adjacencies += @graphknm.adjacency_list("v#{2**i}").size
+        end
+        adjacencies.should eql(@n*@m*2)
+      end
+
+      it "contains the proper edges" do
+        nVertices = @n.times.collect {|i| 2**i}
+        mVertices = @m.times.collect {|i| 2**(i+@n)}
+        edges = []
+        nVertices.each do |n|
+          mVertices.each do |m|
+            edges << n + m
+          end
+        end
+        edges.each do |e|
+          @graphknm.has_edge?("e#{e}").should be_true
+        end
+
+      end
+
+    end
+
+  end
+end

data/spec/abstract_graph/graph/templates/complete_graph_spec.rb

@@ -0,0 +1,36 @@
+require 'spec_helper'
+
+module AbstractGraph
+  describe Graph do
+
+    describe ".complete_graph(Integer)" do
+
+      before :all do
+        @n = 5
+        @graphkn = Graph.complete_graph @n
+        @graphk10 = Graph.complete_graph 10
+      end
+
+      it "returns an object of class Graph" do
+        Graph.complete_graph(1).should be_an_instance_of(Graph)
+      end
+
+      it "creates as many vertices as the integer, named with powers of two" do
+        @n.times do |i|
+          @graphkn.has_vertex?("v#{2**i}").should be_true
+        end
+        @graphk10.has_vertex?("v#{2**9}").should be_true
+      end
+
+      it "creates an edge between each vertex" do
+        n = @n.times.collect { |i| 2**i }
+        n.combination(2).each do |i|
+          @graphkn.has_edge?("e#{i[0]+i[1]}").should be_true
+        end
+        @graphk10.has_edge?("e768").should be_true
+      end
+
+    end
+
+  end
+end