mpath_graph 0.0.5 → 0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c2354a81726eb5b8a4bd80b455cf4af841df2d93
-  data.tar.gz: 17664de8eb01ccbca0de86129ceb5b6eda0e740e
+  metadata.gz: fe98d3cf16c7b1260eec6fe214e67be4bb03581f
+  data.tar.gz: 6b63b914bbe6d13531b690b22379326bd2d854a8
 SHA512:
-  metadata.gz: 09153a85fff517838307db2ae213e305ce508417f735284b2228acbcaca329428920282c93062d5af7242c31b4bc38803621e2a680be32dabb2e988654eab800
-  data.tar.gz: 4393b92aa7c38480b58c2870d73e3d7835aea86d83b78542ecfb613478f5265ab90828fb819c28eef426cf0b7853b135a291c3aaf76abf755e25033474d142fc
+  metadata.gz: ea44cc2381b1af9bd296ae35d0071fa7de78bbf55d1c3cb054aff0bc285e8728c4d88d04592943f0be8744d01606cfc61367bfe49302bc0ce59786f0288526c9
+  data.tar.gz: 2c29f85da657ec31887bcb8eef9afa7679b1f5484037c8ee641e985f57f07fdfb61a5d7981786f83ed7fe458c8cb872a1c43c6584f63977ac1cd839fc583de6c

data/lib/mpath_graph.rb

@@ -215,6 +215,13 @@ module MPathGraph
       options[:initial_vertex] ||= edges[rnd_idx][rnd_idx%2]
       worm = [options[:initial_vertex]]
 
+      pbar = ProgressBar.create(
+        title: "Steps walked",
+        starting_at: 0,
+        output: STDERR,
+        format: "%t |%B| [%c]",
+        total: nil)
+
       while worm.size < options[:worm_size]
         return nil if worm.empty?
 
@@ -230,6 +237,8 @@ module MPathGraph
           neighbors = nil
 
           if worm.size == options[:worm_size]
+            pbar.increment
+
             if is_an_odd_hole?(worm, edges, options[:worm_size])
               # Check if current hole is also found
               repeated = false

data/lib/mpath_graph/version.rb

@@ -1,3 +1,3 @@
 module MPathGraph
-  VERSION = "0.0.5"
+  VERSION = "0.0.6"
 end

data/test/test_mpath_graph_odd_hole.rb

@@ -38,6 +38,27 @@ class TestMPathGraphOddHole < MiniTest::Unit::TestCase
   def test_rw_search
     found = MPathGraph::OddHole::rw_search(@doble_c5, holes_limit: 2)
     assert_equal 2, found.size
+
+    # edges = [[1,2],[1,5],[1,6],[1,19],[2,3],[3,4],[3,18],[4,5],
+    #   [4,9],[4,18],[5,6],[5,7],[6,7],[7,8],[7,10],[8,9],[8,13],
+    #   [10,11],[10,21],[11,12],[12,13],[13,14],[14,15],[15,16],
+    #   [16,17],[17,18],[19,20],[20,21]]
+
+    # options = {worm_size: 5, holes_limit: 2}
+    # found = MPathGraph::OddHole::rw_search(edges, options)
+    # assert_equal 2, found.size
+
+    # options = {worm_size: 7, holes_limit: 1}
+    # found = MPathGraph::OddHole::rw_search(edges, options)
+    # assert_equal 1, found.size
+    # assert_empty found.first-[7, 10, 21, 20, 19, 1, 6]
+    # assert_empty [7, 10, 21, 20, 19, 1, 6]-found.first
+
+    # options = {worm_size: 9, holes_limit: 1}
+    # found = MPathGraph::OddHole::rw_search(edges, options)
+    # assert_equal 1, found.size
+    # assert_empty found.first-[18, 4, 9, 8, 13, 14, 15, 16, 17]
+    # assert_empty [18, 4, 9, 8, 13, 14, 15, 16, 17]-found.first
   end
 
   def test_equivalents

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mpath_graph
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
 platform: ruby
 authors:
 - Israel Buitron
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-07-13 00:00:00.000000000 Z
+date: 2014-07-14 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: ruby-progressbar