mpath_graph 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: d7b6e50d3b2aba78f3916fe417dbb9652e6c028d
-  data.tar.gz: 4e65ecd1d69aa8b692183050da44819dc63a7e56
+  metadata.gz: d8a5503ae715087d19084692a16bbec0e69e2253
+  data.tar.gz: 541cfae204b640553c6237e23938eecb7b3a29c9
 SHA512:
-  metadata.gz: da13ccac14270b6e38af0cc5130dee05e97cf7a627b4db0a7eddd03b643b83331ede683346e1a8cb9ffaa32af039e12d23682760c5b1d9e5a74c7aabd81acb50
-  data.tar.gz: 2664b8ee4407f970234e452f968cc041fbe21be8cc02e763fdf67d62b5fd88a26c8b83125850bf1bdb19c5a75ea1f8eadcdcf42dc291cf25b8c8a14d3d83f101
+  metadata.gz: 44fdf9724d60e0467483dd98026b2b6416e208378b721eed0bb65aee077916f7f6b5ae6bd4e6d0e44766edd401c441d4154b89e6ffd2c88fc855eac0331d9cde
+  data.tar.gz: f5377c43f9aedb4e1ef4720cf07a01251eac237f9b52dd4a004ee1cf502d31e0e9fef605f5623417ab06dac28d4bd753ad7f13d9f9c4b325e4b100c6a211a8dc

data/lib/mpath_graph.rb

@@ -191,6 +191,83 @@ module MPathGraph
   end
 
   module OddHole
+    def self.equivalents(hole)
+      perms = [hole.reverse]
+      tmp = Array.new hole
+
+      (hole.size-1).times do
+        tmp << tmp.shift
+        perms << Array.new(tmp)
+        perms << Array.new(tmp.reverse)
+      end
+
+      perms
+    end
+
+    def self.rw_search(edges, options = {})
+      options[:holes_limit]    ||= 0
+      holes_found = []
+      options[:worm_size]      ||= 5
+      return nil if edges.size < options[:worm_size]
+
+      prng = Random.new
+      rnd_idx = prng.rand(edges.size)
+      options[:initial_vertex] ||= edges[rnd_idx][rnd_idx%2]
+      worm = [options[:initial_vertex]]
+
+      while worm.size < options[:worm_size]
+        return nil if worm.empty?
+
+        neighbors = MPathGraph::find_neighbors(worm.last, edges)
+        neighbors = neighbors - worm
+
+        if neighbors.empty?
+          worm.pop
+          next
+        else
+          rnd_idx = prng.rand(neighbors.size)
+          worm << neighbors[rnd_idx]
+          neighbors = nil
+
+          if worm.size == options[:worm_size]
+            if is_an_odd_hole?(worm, edges, options[:worm_size])
+              # Check if current hole is also found
+              repeated = false
+              holes_found.each do |h|
+                if worm == h
+                  repeated = true
+                  break
+                end
+
+                equivalents(h).each do |e|
+                  if worm == e
+                    repeated = true
+                    break
+                  end
+                end
+                break if repeated
+              end
+
+              # Add to found list if not found yet
+              unless repeated
+                holes_found << worm
+                if options[:holes_limit] > 0 && holes_found.size == options[:holes_limit]
+                  return holes_found
+                end
+              end
+
+              # Leave only first element in worm
+              worm = [worm.last]
+              next
+            else
+              worm.shift
+              next
+            end
+          end
+        end
+      end
+    end
+
     def self.rw_search_first(edges, options = {})
       options[:worm_size]      ||= 5
       return nil if edges.size < options[:worm_size]

data/lib/mpath_graph/version.rb

@@ -1,3 +1,3 @@
 module MPathGraph
-  VERSION = "0.0.3"
+  VERSION = "0.0.4"
 end

data/test/test_mpath_graph.rb

@@ -9,6 +9,7 @@ class TestMPathGraphOddHole < MiniTest::Unit::TestCase
     @oh5_e = [[1,2],[1,5],[2,3],[3,4],[4,5]]
     @oh7_e = [[1,2],[1,7],[2,3],[3,4],[4,5],[5,6],[6,7]]
     @g = [[1,2],[1,5],[2,3],[3,4],[4,5]]
+    @doble_c5 = [[0,6],[0,9],[1,2],[1,5],[1,6],[2,3],[3,4],[4,5],[6,7],[7,8],[8,9]]
   end
 
   def test_is_an_odd_hole?
@@ -32,5 +33,18 @@ class TestMPathGraphOddHole < MiniTest::Unit::TestCase
   def test_rw_search_first
     computed = MPathGraph::OddHole::rw_search_first(@g)
     assert_equal [1,2,3,4,5], computed.sort
+
+  def test_rw_search
+    found = MPathGraph::OddHole::rw_search(@doble_c5, holes_limit: 2)
+    assert_equal 2, found.size
+  end
+
+  def test_equivalents
+    hole = [1,2,3,4,5]
+    exp = [[5,4,3,2,1],[2,3,4,5,1],[1,5,4,3,2],[3,4,5,1,2],[2,1,5,4,3],
+      [4,5,1,2,3],[3,2,1,5,4],[5,1,2,3,4],[4,3,2,1,5]]
+    result = MPathGraph::OddHole::equivalents(hole)
+    assert_same exp.size, result.size
+    assert [], exp-result
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: mpath_graph
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Israel Buitron