v = Vertex.new
v.edges.should be_empty
end
+
+ it "creates a vertex with some parameters" do
+ v = Vertex.new :value1 => 1, :value2 => "value2", :value3 => :v3
+ v.value1.should == 1
+ v.value2.should == "value2"
+ v.value3.should == :v3
+ v.value4.should be_nil
+ end
end # #initialize
describe "adds attribues" do
e.vertices.should include(v)
e.vertices.should include(v1)
- e.should have(2).connections
+ e.should have(2).connections
end
+ it "connects two vertices by an edge with attributes" do
+ v1 = Vertex.new
+ v1.id = :v1
+ e = v.connect(v1, {:type => :edge_type})
+ e.type.should == :edge_type
+ end
+
it "creates a self-connection" do
e = v.connect v
e.should have(2).connections
end
+ it "creates a self-connection with an edge with attributes" do
+ e = v.connect(v, {:type => :edge_type})
+ e.type.should == :edge_type
+ end
+
end # #connect
+
+ describe "#neighbours" do
+ it "finds neighbours of a self loop" do
+ v << v
+ v.should have(1).neighbours
+ v.neighbours.should include v
+ end
+
+ it "finds neighbours on an edge" do
+ v1 = Vertex.new
+ v << v1
+ v.should have(1).neighbours
+ v.neighbours.should include v1
+ v1.should have(1).neighbours
+ v1.neighbours.should include v
+ end
+
+ it "finds neighbours with multiple edges" do
+ v1 = Vertex.new
+ v1.id = :v1
+ v << v1
+ v1 << v
+ v.should have(2).neighbours
+ v.neighbours.should include v1
+ v.neighbours.should_not include v
+ v1.should have(2).neighbours
+ v1.neighbours.should include v
+ v1.neighbours.should_not include v1
+ end
+
+ it "finds neighbours with multiple self loops" do
+ v << v << v << v
+ v.should have(3).neighbours
+ v.neighbours.should include v
+ v.neighbours.uniq.length.should == 1
+ end
+
+ it "finds neighbours with all sorts of edges" do
+ v1 = Vertex.new ; v1.id = :v1
+ v2 = Vertex.new ; v2.id = :v2
+ v3 = Vertex.new ; v3.id = :v3
+ v1 << v
+ v << v2
+ v2 << v3
+ v2 << v2
+
+ v.should have(2).neighbours
+ v.neighbours.should include v1
+ v.neighbours.should include v2
+
+ v1.should have(1).neighbours
+ v1.neighbours.should include v
+
+ v2.should have(3).neighbours
+ v2.neighbours.should include v
+ v2.neighbours.should include v2
+ v2.neighbours.should include v3
+
+ v3.should have(1).neighbours
+ v3.neighbours.should include v2
+ end
+
+ it "finds neighbours in graphs with several vertices" do
+ v1 = Vertex.new ; v1.id = :v1
+ v2 = Vertex.new ; v2.id = :v2
+ v3 = Vertex.new ; v3.id = :v3
+ v4 = Vertex.new ; v4.id = :v4
+ v << v1
+ v1 << v2
+ v2 << v3
+ v << v3
+ v4 << v3
+ v.should have(2).neighbours
+ v.neighbours.should include v1
+ v.neighbours.should include v3
+ v.neighbours.should_not include v
+ v1.should have(2).neighbours
+ v1.neighbours.should include v
+ v1.neighbours.should include v2
+ v1.neighbours.should_not include v1
+ v2.should have(2).neighbours
+ v2.neighbours.should include v1
+ v2.neighbours.should include v3
+ v2.neighbours.should_not include v2
+ v3.should have(3).neighbours
+ v3.neighbours.should include v
+ v3.neighbours.should include v2
+ v3.neighbours.should include v4
+ v3.neighbours.should_not include v3
+ v4.should have(1).neighbours
+ v4.neighbours.should include v3
+ v4.neighbours.should_not include v4
+ end
+
+ it "finds neighbours with multiple edges between vertices" do
+ v1 = Vertex.new ; v1.id = :v1
+ v2 = Vertex.new ; v2.id = :v2
+ v3 = Vertex.new ; v3.id = :v3
+ v1 << v1 << v
+ v << v2
+ v << v
+ v3 << v2
+ v2 << v3
+ v2 << v2
+
+ v.should have(3).neighbours
+ v.neighbours.should include v1
+ v.neighbours.should include v2
+ v.neighbours.should include v
+
+ v1.should have(2).neighbours
+ v1.neighbours.should include v
+ v1.neighbours.should include v1
+
+ v2.should have(4).neighbours
+ v2.neighbours.should include v
+ v2.neighbours.should include v2
+ v2.neighbours.should include v3
+ v2.neighbours.uniq.length.should == 3
+
+ v3.should have(2).neighbours
+ v3.neighbours.should include v2
+ v3.neighbours.uniq.length.should == 1
+ end
+ end # #neighbours
end
end