graphunk 0.5.2 → 0.5.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4679baf01a1d4c718afdf767d902cc84a707721e
-  data.tar.gz: 0321ab012c5fba8ae85d33c37e6f9e58e9aac334
+  metadata.gz: e9587a7e60d6decfe167c7c414bc67c9039c3e94
+  data.tar.gz: 4a4b27ead93655a13d6f7380bc52fb860e6fb87e
 SHA512:
-  metadata.gz: a918a86dad048a85b9300ab14f781ed8b313fcd433348ea7660eeecfaf40c40700681196c9316d0a2b295004e8042adb82b6d78e36204d2bafa102feeca47eab
-  data.tar.gz: 05bd5782911aeb7c4159dc6cb1d21eddb70944a86081dedf6c254245bf23cae8204f33dc82123dda3aefd50ea2d1a63395f34120759afa5b3ba32528f77fd126
+  metadata.gz: 9ce4bd2e43082797664f3e31155a6d5acdcc643a129cf2dafff4f59e617c5e026d89b02c9ef00178685945a3f1977d78cff876a08c67cdf7c1f8cb0d03dc1da7
+  data.tar.gz: 1791ca21dccc1f55a8b04f059127a39a1669157e4b80e8488f3d195420cfbe568034f0f97550817026aedf3c73cbc9bb9a73f7d2c3459a8c87857801a75fcbd5

data/lib/graphunk/undirected_graph.rb

@@ -158,29 +158,31 @@ module Graphunk
         transitive_orientation.add_edge(considered_edge.first, considered_edge.last)
 
         explore = lambda do |edge|
-          if unconsidered_edges.include? edge
-            adjacent_edges(edge.first, edge.last).each do |adjacent_edge|
-              next if unconsidered_edges.include? adjacent_edge
-
-              shared_vertex = adjacent_edge.select { |vertex| edge.include? vertex }.first
-              unshared_edge_vertex = edge.reject { |vertex| adjacent_edge.include? vertex }.first
-              unshared_adjacent_edge_vertex = adjacent_edge.reject { |vertex| edge.include? vertex }.first
-
-              unless edge_exists?(unshared_edge_vertex, unshared_adjacent_edge_vertex)
-                if transitive_orientation.edge_exists?(shared_vertex, unshared_adjacent_edge_vertex)
-                  transitive = false if transitive_orientation.edge_exists?(unshared_edge_vertex, shared_vertex)
-                  transitive_orientation.add_edge(shared_vertex, unshared_edge_vertex) unless transitive_orientation.edge_exists?(shared_vertex, unshared_edge_vertex)
-                  unconsidered_edges.delete(order_vertices(shared_vertex, unshared_edge_vertex))
-                else
-                  transitive = false if transitive_orientation.edge_exists?(shared_vertex, unshared_edge_vertex)
-                  transitive_orientation.add_edge(unshared_edge_vertex, shared_vertex) unless transitive_orientation.edge_exists?(unshared_edge_vertex, shared_vertex)
-                  unconsidered_edges.delete(order_vertices(shared_vertex, unshared_edge_vertex))
-                end
-
-                adjacent_edges(edge.first, edge.last).each { |neighbor| explore.call neighbor }
+          edge_set = false
+          adjacent_edges(edge.first, edge.last).each do |adjacent_edge|
+            next if unconsidered_edges.include? adjacent_edge
+
+            shared_vertex = adjacent_edge.select { |vertex| edge.include? vertex }.first
+            unshared_edge_vertex = edge.reject { |vertex| adjacent_edge.include? vertex }.first
+            unshared_adjacent_edge_vertex = adjacent_edge.reject { |vertex| edge.include? vertex }.first
+
+            unless edge_exists?(unshared_edge_vertex, unshared_adjacent_edge_vertex)
+              if transitive_orientation.edge_exists?(shared_vertex, unshared_adjacent_edge_vertex)
+                transitive = false if transitive_orientation.edge_exists?(unshared_edge_vertex, shared_vertex)
+                transitive_orientation.add_edge(shared_vertex, unshared_edge_vertex) unless transitive_orientation.edge_exists?(shared_vertex, unshared_edge_vertex)
+                unconsidered_edges.delete(order_vertices(shared_vertex, unshared_edge_vertex))
+                edge_set = true
+              else
+                transitive = false if transitive_orientation.edge_exists?(shared_vertex, unshared_edge_vertex)
+                transitive_orientation.add_edge(unshared_edge_vertex, shared_vertex) unless transitive_orientation.edge_exists?(unshared_edge_vertex, shared_vertex)
+                unconsidered_edges.delete(order_vertices(shared_vertex, unshared_edge_vertex))
+                edge_set = true
               end
+
             end
           end
+
+          adjacent_edges(edge.first, edge.last).each { |neighbor| explore.call neighbor if unconsidered_edges.include? neighbor } if edge_set
         end
 
         adjacent_edges(considered_edge.first, considered_edge.last).each { |neighbor_edge| explore.call neighbor_edge }

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: graphunk
 version: !ruby/object:Gem::Version
-  version: 0.5.2
+  version: 0.5.3
 platform: ruby
 authors:
 - Evan Hemsley