jumoku 0.1.2 → 0.1.3

data/vendor/git/plexus/lib/plexus/version.rb

@@ -0,0 +1,6 @@
+module Plexus
+  MAJOR = 0
+  MINOR = 5
+  PATCH = 3
+  VERSION = [MAJOR, MINOR, PATCH].join('.')
+end

data/vendor/git/plexus/plexus.gemspec

@@ -0,0 +1,24 @@
+# -*- encoding: utf-8 -*-
+require './lib/plexus/version'
+
+Gem::Specification.new do |s|
+  s.name = %q{plexus}
+  s.version = Plexus::VERSION
+  s.authors = ["Bruce Williams", "Jean-Denis Vauguet <jd@vauguet.fr>"]
+  s.summary = "A framework for graph data structures and algorithms."
+  s.description = %q{This library is based on GRATR and RGL.
+
+Graph algorithms currently provided are:
+
+* Topological Sort
+* Strongly Connected Components
+* Transitive Closure
+* Rural Chinese Postman
+* Biconnected
+}
+  s.email = %q{bruce@codefluency.com}
+  s.add_dependency "facets"
+  s.add_development_dependency "rspec"
+  s.add_development_dependency "yard"
+end
+

data/vendor/git/{graphy → plexus}/spec/edge_spec.rb

@@ -1,13 +1,12 @@
-require File.join(File.dirname(__FILE__), 'spec_helper')
-
-describe "Arc" do # :nodoc:
+require 'spec_helper'
 
+describe Arc do
   before do
     @e = Arc.new(1,2,'boo')
     @u = Edge.new(1,2,'hoo')
   end
 
-  describe "edge_new" do
+  describe "#edge_new" do
     it do
       proc { Arc.new }.should raise_error(ArgumentError)
       proc { Arc.new(1) }.should raise_error(ArgumentError)
@@ -16,7 +15,7 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "edge_getters" do
+  describe "#edge_getters" do
     it do
       @e.source.should == 1
       @e.target.should == 2
@@ -25,14 +24,14 @@ describe "Arc" do # :nodoc:
       @e[0].should == 1
       @e[1].should == 2
       @e[2].should == 'boo'
-      
+
       @e[-3].should == 1
       @e[-2].should == 2
       @e[-1].should == 'boo'
 
-      proc { @e[-4] }.should raise_error(IndexError) 
-      proc { @e[3] }.should raise_error(IndexError)  
-      
+      proc { @e[-4] }.should raise_error(IndexError)
+      proc { @e[3] }.should raise_error(IndexError)
+
       @e['source'].should == 1
       @e['target'].should == 2
       @e['label'].should == 'boo'
@@ -43,7 +42,7 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "edge_setters" do
+  describe "#edge_setters" do
     it do
       @e.source = 23
       @e.target = 42
@@ -82,7 +81,7 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "edge_simple_methods" do
+  describe "#edge_simple_methods" do
     it do
       @e.to_a.should == [1,2,'boo']
       @e.to_s.should == "(1-2 'boo')"
@@ -99,14 +98,14 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "edge_sort" do
+  describe "#edge_sort" do
     it do
       x = [ Arc.new(2,3), Arc.new(1,3), Arc.new(1,2), Arc.new(2,1) ].sort
       x.should == [Arc.new(1,2), Arc.new(1,3), Arc.new(2,1), Arc.new(2,3)]
     end
   end
 
-  describe "undirected_edge_new" do
+  describe "#undirected_edge_new" do
     it do
       proc { Edge.new }.should raise_error(ArgumentError)
       proc { Edge.new(1) }.should raise_error(ArgumentError)
@@ -115,7 +114,7 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "undirected_edge_getters" do
+  describe "#undirected_edge_getters" do
     it do
       @u.source.should == 1
       @u.target.should == 2
@@ -124,7 +123,7 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "undirected_edge_methods" do
+  describe "#undirected_edge_methods" do
     it do
       @u.label = nil
       @u.to_s.should == "(1=2)"
@@ -138,14 +137,14 @@ describe "Arc" do # :nodoc:
     end
   end
 
-  describe "undirected_edge_sort" do
+  describe "#undirected_edge_sort" do
     it do
       x = [Edge.new(12, 1), Edge.new(2,11)].sort
       x.should == [Edge.new(2,11), Edge.new(1,12)]
     end
   end
-  
-  describe "hash" do
+
+  describe "#hash" do
     it do
       Arc[1,2,:c].should == Arc[1,2,:b]
       Arc[1,2,:c].hash.should == Arc[1,2,:b].hash

data/vendor/git/{graphy → plexus}/spec/inspection_spec.rb

@@ -1,21 +1,21 @@
-require File.join(File.dirname(__FILE__), 'spec_helper')
+require 'spec_helper'
 
 describe "Inspection" do # :nodoc:
-  
   before do
-    @dg = DirectedMultiGraph[ 
-                             [0,0,1]   => 1,
-                             [1,2,2]   => 2, 
-                             [1,3,3]   => 4,
-                             [1,4,4]   => nil, 
-                             [4,1,5]   => 8, 
-                             [1,2,6]   => 16, 
-                             [3,3,7]   => 32, 
-                             [3,3,8]   => 64     ]
+    @dg = DirectedMultiGraph[
+                              [0,0,1]   => 1,
+                              [1,2,2]   => 2,
+                              [1,3,3]   => 4,
+                              [1,4,4]   => nil,
+                              [4,1,5]   => 8,
+                              [1,2,6]   => 16,
+                              [3,3,7]   => 32,
+                              [3,3,8]   => 64
+                            ]
     @dg[3] = 128
     @dg[0] = 256
   end
-  
+
   describe "inspection_without_labels" do
     it do
       @dg = Digraph[1,2,3,4,5,6]
@@ -23,7 +23,7 @@ describe "Inspection" do # :nodoc:
       reflect.should == @dg
     end
   end
-  
+
   describe "inspection_with_labels" do
     it do
       inspect = @dg.inspect
@@ -34,7 +34,5 @@ describe "Inspection" do # :nodoc:
       reflect.edges.inject(0) { |a,e| a += (reflect[e] || 0)}.should == 127
       reflect.vertices.inject(0) {|a,v| a += (reflect[v] || 0)}.should == 384
     end
-    
   end
-
 end

data/vendor/git/{graphy → plexus}/spec/neighborhood_spec.rb

@@ -1,7 +1,6 @@
 require File.join(File.dirname(__FILE__), 'spec_helper')
 
-describe "Neighborhood" do # :nodoc:
-  
+describe "Neighborhood" do
   before do
     @d = Digraph[:a,:b, :a,:f,
                  :b,:g,
@@ -12,7 +11,7 @@ describe "Neighborhood" do # :nodoc:
                  :g,:a, :g,:e]
     @w = [:a,:b]
   end
-  
+
   describe "open_out_neighborhood" do
     it do
       @d.set_neighborhood([:a],    :in).should == [:g]
@@ -24,7 +23,7 @@ describe "Neighborhood" do # :nodoc:
       ([:c]     - @d.open_pth_neighborhood(@w, 4, :out)).should == []
     end
   end
-  
+
   describe "closed_out_neighborhood" do
     it do
       (@w                     - @d.closed_pth_neighborhood(@w, 0, :out)).should == []
@@ -34,5 +33,4 @@ describe "Neighborhood" do # :nodoc:
       ([:a,:b,:c,:d,:e,:f,:g] - @d.closed_pth_neighborhood(@w, 4, :out)).should == []
     end
   end
-  
 end

data/vendor/git/{graphy → plexus}/spec/properties_spec.rb

@@ -1,6 +1,6 @@
 
 require File.join(File.dirname(__FILE__), 'spec_helper')
-require 'graphy/dot'
+require 'plexus/dot'
 
 # This test runs the classes from Appendix F in 
 # _Algorithmic_Graph_Theory_and_Perfect_Graphs,

data/vendor/git/{graphy → plexus}/spec/search_spec.rb

@@ -9,14 +9,14 @@ describe "Search" do # :nodoc:
   end
 
   # "Algorithmic Graph Theory and Perfect Graphs", Martin Charles
-  # Golumbic, 1980, Academic Press, page 39, Propery (D1) and (D2) of 
+  # Golumbic, 1980, Academic Press, page 39, Propery (D1) and (D2) of
   # depth first search
   describe "dfs_properties" do
     it do
       dfs = {}
       father = {}
       @directed.each do |vertex|
-        assign_dfsnumber_ancestry(@directed, dfs, father, vertex)  
+        assign_dfsnumber_ancestry(@directed, dfs, father, vertex)
         # Property (D1)
         father.keys.each {|v| dfs[father[v]].should be < dfs[v] }
         # Property (D2)
@@ -30,15 +30,15 @@ describe "Search" do # :nodoc:
   end
 
   # "Algorithmic Graph Theory and Perfect Graphs", Martin Charles
-  # Golumbic, 1980, Academic Press, page 40, Propery (B1), (B2) and (B3) of 
+  # Golumbic, 1980, Academic Press, page 40, Propery (B1), (B2) and (B3) of
   # breadth first search
   describe "bfs_properties" do
     it do
-      level  = {}  
+      level  = {}
       father = {}
       bfs    = {}
       @directed.each do |vertex|
-        assign_bfsnumber_ancestry(@directed, bfs, level, father, vertex)  
+        assign_bfsnumber_ancestry(@directed, bfs, level, father, vertex)
         # Property (B1)
         father.keys.each do |v|
           bfs[father[v]].should be < bfs[v]
@@ -107,7 +107,7 @@ describe "Search" do # :nodoc:
 
       # Heuristic from "Artificial Intelligence: A Modern Approach" by Stuart
       # Russell ande Peter Norvig, Prentice-Hall 2nd Edition, pg 95
-      straight_line_to_Bucharest = 
+      straight_line_to_Bucharest =
         {
         'Arad'           => 366,
         'Bucharest'      =>   0,
@@ -142,57 +142,57 @@ describe "Search" do # :nodoc:
       fv  = Proc.new {|v| list << "fv #{v}" }
       er  = Proc.new {|e| list << "er #{e}" }
       enr = Proc.new {|e| list << "enr #{e}" }
-      
+
       options = { :discover_vertex  => dv,
         :examine_vertex   => ev,
         :black_target     => bt,
         :finish_vertex    => fv,
         :edge_relaxed     => er,
         :edge_not_relaxed => enr }
-      
+
       result = romania.astar('Arad', 'Bucharest', h, options)
 
       result.should == ["Arad", "Sibiu", "Rimnicu Vilcea", "Pitesti", "Bucharest"]
       # This isn't the greatest test since the exact ordering is not
       # not specified by the algorithm. If someone has a better idea, please fix
       list.should ==  ["ev Arad",
-                    "er (Arad=Sibiu '99')",
-                    "dv Sibiu",
-                    "er (Arad=Timisoara '138')",
-                    "dv Timisoara",
-                    "er (Arad=Zerind '75')",
-                    "dv Zerind",
-                    "fv Arad",
-                    "ev Sibiu",
-                    "er (Rimnicu Vilcea=Sibiu '80')",
-                    "dv Rimnicu Vilcea",
-                    "er (Fagaras=Sibiu '99')",
-                    "dv Fagaras",
-                    "er (Oradea=Sibiu '151')",
-                    "dv Oradea",
-                    "enr (Arad=Sibiu '99')",
-                    "fv Sibiu",
-                    "ev Rimnicu Vilcea",
-                    "enr (Rimnicu Vilcea=Sibiu '80')",
-                    "er (Craiova=Rimnicu Vilcea '146')",
-                    "dv Craiova",
-                    "er (Pitesti=Rimnicu Vilcea '97')",
-                    "dv Pitesti",
-                    "fv Rimnicu Vilcea",
-                    "ev Fagaras",
-                    "enr (Fagaras=Sibiu '99')",
-                    "er (Bucharest=Fagaras '211')",
-                    "dv Bucharest",
-                    "fv Fagaras",
-                    "ev Pitesti",
-                    "enr (Pitesti=Rimnicu Vilcea '97')",
-                    "er (Bucharest=Pitesti '101')",
-                    "enr (Craiova=Pitesti '138')",
-                    "fv Pitesti",
-                    "ev Bucharest"]
+                       "er (Arad=Sibiu '99')",
+                       "dv Sibiu",
+                       "er (Arad=Timisoara '138')",
+                       "dv Timisoara",
+                       "er (Arad=Zerind '75')",
+                       "dv Zerind",
+                       "fv Arad",
+                       "ev Sibiu",
+                       "er (Rimnicu Vilcea=Sibiu '80')",
+                       "dv Rimnicu Vilcea",
+                       "er (Fagaras=Sibiu '99')",
+                       "dv Fagaras",
+                       "er (Oradea=Sibiu '151')",
+                       "dv Oradea",
+                       "enr (Arad=Sibiu '99')",
+                       "fv Sibiu",
+                       "ev Rimnicu Vilcea",
+                       "enr (Rimnicu Vilcea=Sibiu '80')",
+                       "er (Craiova=Rimnicu Vilcea '146')",
+                       "dv Craiova",
+                       "er (Pitesti=Rimnicu Vilcea '97')",
+                       "dv Pitesti",
+                       "fv Rimnicu Vilcea",
+                       "ev Fagaras",
+                       "enr (Fagaras=Sibiu '99')",
+                       "er (Bucharest=Fagaras '211')",
+                       "dv Bucharest",
+                       "fv Fagaras",
+                       "ev Pitesti",
+                       "enr (Pitesti=Rimnicu Vilcea '97')",
+                       "er (Bucharest=Pitesti '101')",
+                       "enr (Craiova=Pitesti '138')",
+                       "fv Pitesti",
+                       "ev Bucharest"]
     end
   end
-  
+
   describe "bfs_spanning_forest" do
     it do
       predecessor, roots = @tree.bfs_spanning_forest(1)
@@ -203,7 +203,7 @@ describe "Search" do # :nodoc:
       roots.sort.should == [1,3,5,6,23]
     end
   end
-  
+
   describe "dfs_spanning_forest" do
     it do
       predecessor, roots = @tree.dfs_spanning_forest(1)
@@ -214,7 +214,7 @@ describe "Search" do # :nodoc:
       roots.sort.should == [1,3,5,6,23]
     end
   end
-  
+
   describe "tree_from_vertex" do
     it do
       @tree.bfs_tree_from_vertex(1).should == {5=>2, 6=>2, 7=>6, 2=>1, 3=>1, 4=>1}

data/vendor/git/{graphy → plexus}/spec/spec_helper.rb

@@ -1,13 +1,9 @@
-$LOAD_PATH.unshift(File.dirname(__FILE__))
-$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
-require 'graphy'
-require 'spec'
-require 'spec/autorun'
+require File.expand_path("../../lib/plexus.rb",  __FILE__)
 
-include Graphy
+require 'plexus'
+include Plexus
 
 module AncestryHelper
-
   # "Algorithmic Graph Theory and Perfect Graphs", Martin Charles
   # Golumbic, 1980, Academic Press, page 38, Figure 2.6
   def assign_dfsnumber_ancestry(graph, dfsnumber, father, start)
@@ -20,7 +16,7 @@ module AncestryHelper
   end
 
   # "Algorithmic Graph Theory and Perfect Graphs", Martin Charles
-  # Golumbic, 1980, Academic Press, page 40, Figure 2.7 
+  # Golumbic, 1980, Academic Press, page 40, Figure 2.7
   def assign_bfsnumber_ancestry(graph, bfsnum, level, father, start)
     i = 0
     bfsnum.clear
@@ -29,7 +25,7 @@ module AncestryHelper
     rt = Proc.new {|v| level[v] = 0 }
     ev = Proc.new {|v| bfsnum[v]=(i+=1);level[v]=(level[father[v]]+1) if father[v]}
     te = Proc.new {|e| father[e.target] = e.source }
-    graph.dfs({:enter_vertex => ev, :tree_edge => te, 
+    graph.dfs({:enter_vertex => ev, :tree_edge => te,
                :root_vertex => rt, :start => start})
   end
 
@@ -51,6 +47,13 @@ module AncestryHelper
 
 end
 
-Spec::Runner.configure do |config|
+RSpec.configure do |config|
+  # Remove this line if you don't want RSpec's should and should_not
+  # methods or matchers
+  require 'rspec/expectations'
+  config.include RSpec::Matchers
   config.include AncestryHelper
+
+  # == Mock Framework
+  config.mock_with :rspec
 end