+ product_graph << Vertex.new({:g1_vertex => v1, :g2_vertex => v2})
+ end
+ end
+ self.edges.each do |e1|
+ e1_vertices = e1.vertices
+ other.edges.each do |e2|
+ e2_vertices = e2.vertices
+ source = product_graph.vertices.find {|v| v.g1_vertex == e1_vertices[0] and v.g2_vertex == e2_vertices[0]}
+ destination = product_graph.vertices.find {|v| v.g1_vertex == e1_vertices[1] and v.g2_vertex == e2_vertices[1]}
+ product_graph.connect source, destination
+ source = product_graph.vertices.find {|v| v.g1_vertex == e1_vertices[0] and v.g2_vertex == e2_vertices[1]}
+ destination = product_graph.vertices.find {|v| v.g1_vertex == e1_vertices[1] and v.g2_vertex == e2_vertices[0]}
+ product_graph.connect source, destination
+ end
+ end
+ product_graph
+ end
+
+
+ def initial_similarity
+ self.vertices.each do |v|
+ if block_given?
+ v.initial_similarity = yield v
+ else
+ v.initial_similarity = 1.0
+ end
+ v.similarity = v.initial_similarity
+ end
+ end
+
+ # Performs similarity flooding on a graph
+ # Assumes that the initial similarity has already been calculated
+ def similarity_flood(opts = {})
+ max_iterations = opts[:iterations] || 100
+ max_residual = opts[:max_residual] || 0.001
+ iteration = 1
+ residual = max_residual + 1
+ while residual > max_residual and iteration <= max_iterations
+ self.vertices.each do |v|
+ v.last_similarity = v.similarity
+ end
+ self.vertices.each do |v|
+ n = v.neighbours.length
+ v.neighbours.each do |neighbour|
+ neighbour.similarity += v.last_similarity / n
+ end
+ end
+ max_similarity = vertices.max {|v, w| v.similarity <=> w.similarity}.similarity
+ self.vertices.each do |v|
+ v.similarity = v.similarity / max_similarity