X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=lib%2Fgraph.njae%2Fvertex.rb;h=4ac903c2bea7f9424ab34ecb9c6a8b42a57cab88;hb=99e4223d9b3baef392d4a6b0b996078f06fcadf7;hp=bf14dddac07ce079f13a5d4de2409d8292d449c0;hpb=c34def40508c16cfc815fa02c8743d071491af7b;p=graph.njae.git diff --git a/lib/graph.njae/vertex.rb b/lib/graph.njae/vertex.rb index bf14ddd..4ac903c 100644 --- a/lib/graph.njae/vertex.rb +++ b/lib/graph.njae/vertex.rb @@ -1,24 +1,22 @@ -require 'ostruct' - # A simple graph library module GraphNjae # A vertex in a graph. The edge can have arbitrary attributes,treated as # method names. class Vertex < OpenStruct - def initialize - super + def initialize(values = {}) + super(values) self.edges = [] self end # Connect this vertex to another, creating an Edge to do so, and returning # the Edge - def connect(other) - e = Edge.new + def connect(other, edge_attributes = {}) + e = Edge.new edge_attributes e << self << other - self.edges << e - other.edges << e unless self === other + # self.edges << e + # other.edges << e unless self === other e end @@ -31,10 +29,32 @@ module GraphNjae # Return the set of neighbouring vertices def neighbours - vertices = self.edges.map {|e| e.vertices}.flatten - vertices_to_me = vertices.select {|v| v == self} - other_vertices = vertices.select {|v| v != self} - (vertices_to_me[1..-1] || []) + other_vertices + #vertices = self.edges.map {|e| e.vertices}.flatten + #vertices_to_me = vertices.select {|v| v == self} + #other_vertices = vertices.select {|v| v != self} + #(vertices_to_me[1..-1] || []) + other_vertices# + self.edges.map {|e| e.vertices.take_while {|v| v != self} + + e.vertices.drop_while {|v| v != self}[1..-1]}.flatten + end + + def to_s + '' + end + + def to_dot(opts = {}) + if block_given? + yield self + else + dot = self.object_id.to_s + if opts.size > 0 + dot << ' {' + dot << opts.keys.map { |k| + (k.to_s + ' = "' + self.instance_eval(opts[k].to_s).to_s) + '"' + }.join(', ') + dot << '}' + end + dot << ';' + end end end