jumoku 0.1.2 → 0.1.3

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

@@ -100,7 +100,7 @@ describe "Triangulated" do #:nodoc:
   
   describe "lexicographic_queue" do
     it do
-      q = Graphy::Search::LexicographicQueue.new([1,2,3,4,5,6,7,8,9])
+      q = Plexus::Search::LexicographicQueue.new([1,2,3,4,5,6,7,8,9])
       q.pop.should == 9
       q.add_lexeme([3,4,5,6,7,8])
       q.pop.should == 8

metadata

@@ -2,7 +2,7 @@
 name: jumoku
 version: !ruby/object:Gem::Version 
   prerelease: 
-  version: 0.1.2
+  version: 0.1.3
 platform: ruby
 authors: 
 - Jean-Denis Vauguet <jd@vauguet.fr>
@@ -76,83 +76,86 @@ files:
 - lib/jumoku/support/support.rb
 - lib/jumoku/support/branch.rb
 - lib/jumoku/version.rb
-- vendor/git/graphy/LICENSE
-- vendor/git/graphy/lib/graphy/biconnected.rb
-- vendor/git/graphy/lib/graphy/arc.rb
-- vendor/git/graphy/lib/graphy/ruby_compatibility.rb
-- vendor/git/graphy/lib/graphy/dot.rb
-- vendor/git/graphy/lib/graphy/directed_graph.rb
-- vendor/git/graphy/lib/graphy/comparability.rb
-- vendor/git/graphy/lib/graphy/chinese_postman.rb
-- vendor/git/graphy/lib/graphy/graph_api.rb
-- vendor/git/graphy/lib/graphy/classes/graph_classes.rb
-- vendor/git/graphy/lib/graphy/strong_components.rb
-- vendor/git/graphy/lib/graphy/support/support.rb
-- vendor/git/graphy/lib/graphy/common.rb
-- vendor/git/graphy/lib/graphy/search.rb
-- vendor/git/graphy/lib/graphy/arc_number.rb
-- vendor/git/graphy/lib/graphy/maximum_flow.rb
-- vendor/git/graphy/lib/graphy/ext.rb
-- vendor/git/graphy/lib/graphy/labels.rb
-- vendor/git/graphy/lib/graphy/undirected_graph.rb
-- vendor/git/graphy/lib/graphy/edge.rb
-- vendor/git/graphy/lib/graphy/directed_graph/distance.rb
-- vendor/git/graphy/lib/graphy/directed_graph/algorithms.rb
-- vendor/git/graphy/lib/graphy/undirected_graph/algorithms.rb
-- vendor/git/graphy/lib/graphy/adjacency_graph.rb
-- vendor/git/graphy/lib/graphy/graph.rb
-- vendor/git/graphy/lib/graphy.rb
-- vendor/git/graphy/graphy.gemspec
-- vendor/git/graphy/Rakefile
-- vendor/git/graphy/VERSION
-- vendor/git/graphy/TODO.md
-- vendor/git/graphy/spec/spec.opts
-- vendor/git/graphy/spec/edge_spec.rb
-- vendor/git/graphy/spec/inspection_spec.rb
-- vendor/git/graphy/spec/digraph_spec.rb
-- vendor/git/graphy/spec/spec_helper.rb
-- vendor/git/graphy/spec/search_spec.rb
-- vendor/git/graphy/spec/triangulated_spec.rb
-- vendor/git/graphy/spec/multi_edge_spec.rb
-- vendor/git/graphy/spec/dot_spec.rb
-- vendor/git/graphy/spec/neighborhood_spec.rb
-- vendor/git/graphy/spec/complement_spec.rb
-- vendor/git/graphy/spec/biconnected_spec.rb
-- vendor/git/graphy/spec/undirected_graph_spec.rb
-- vendor/git/graphy/spec/chinese_postman_spec.rb
-- vendor/git/graphy/spec/strong_components_spec.rb
-- vendor/git/graphy/spec/community_spec.rb
-- vendor/git/graphy/spec/digraph_distance_spec.rb
-- vendor/git/graphy/spec/properties_spec.rb
-- vendor/git/graphy/examples/module_graph.rb
-- vendor/git/graphy/examples/self_graph.jpg
-- vendor/git/graphy/examples/visualize.rb
-- vendor/git/graphy/examples/visualize.jpg
-- vendor/git/graphy/examples/graph_self.rb
-- vendor/git/graphy/examples/module_graph.jpg
-- vendor/git/graphy/README.md
-- vendor/git/graphy/vendor/priority-queue/ext/priority_queue/CPriorityQueue/priority_queue.c
-- vendor/git/graphy/vendor/priority-queue/ext/priority_queue/CPriorityQueue/extconf.rb
-- vendor/git/graphy/vendor/priority-queue/README
-- vendor/git/graphy/vendor/priority-queue/Makefile
-- vendor/git/graphy/vendor/priority-queue/lib/priority_queue/c_priority_queue.rb
-- vendor/git/graphy/vendor/priority-queue/lib/priority_queue/poor_priority_queue.rb
-- vendor/git/graphy/vendor/priority-queue/lib/priority_queue/ruby_priority_queue.rb
-- vendor/git/graphy/vendor/priority-queue/lib/priority_queue.rb
-- vendor/git/graphy/vendor/priority-queue/benchmark/dijkstra.rb
-- vendor/git/graphy/vendor/priority-queue/CHANGELOG
-- vendor/git/graphy/vendor/priority-queue/doc/compare_big.gp
-- vendor/git/graphy/vendor/priority-queue/doc/compare_small.png
-- vendor/git/graphy/vendor/priority-queue/doc/compare_small.gp
-- vendor/git/graphy/vendor/priority-queue/doc/results.csv
-- vendor/git/graphy/vendor/priority-queue/doc/c-vs-rb.png
-- vendor/git/graphy/vendor/priority-queue/doc/compare_big.png
-- vendor/git/graphy/vendor/priority-queue/priority_queue.so
-- vendor/git/graphy/vendor/priority-queue/test/priority_queue_test.rb
-- vendor/git/graphy/vendor/priority-queue/setup.rb
-- vendor/git/graphy/vendor/priority-queue/compare_comments.rb
-- vendor/git/graphy/vendor/rdot.rb
-- vendor/git/graphy/CREDITS.md
+- vendor/git/plexus/LICENSE
+- vendor/git/plexus/lib/plexus/biconnected.rb
+- vendor/git/plexus/lib/plexus/arc.rb
+- vendor/git/plexus/lib/plexus/ruby_compatibility.rb
+- vendor/git/plexus/lib/plexus/dot.rb
+- vendor/git/plexus/lib/plexus/directed_graph.rb
+- vendor/git/plexus/lib/plexus/comparability.rb
+- vendor/git/plexus/lib/plexus/chinese_postman.rb
+- vendor/git/plexus/lib/plexus/graph_api.rb
+- vendor/git/plexus/lib/plexus/classes/graph_classes.rb
+- vendor/git/plexus/lib/plexus/strong_components.rb
+- vendor/git/plexus/lib/plexus/support/support.rb
+- vendor/git/plexus/lib/plexus/common.rb
+- vendor/git/plexus/lib/plexus/search.rb
+- vendor/git/plexus/lib/plexus/arc_number.rb
+- vendor/git/plexus/lib/plexus/maximum_flow.rb
+- vendor/git/plexus/lib/plexus/ext.rb
+- vendor/git/plexus/lib/plexus/labels.rb
+- vendor/git/plexus/lib/plexus/undirected_graph.rb
+- vendor/git/plexus/lib/plexus/edge.rb
+- vendor/git/plexus/lib/plexus/directed_graph/distance.rb
+- vendor/git/plexus/lib/plexus/directed_graph/algorithms.rb
+- vendor/git/plexus/lib/plexus/undirected_graph/algorithms.rb
+- vendor/git/plexus/lib/plexus/adjacency_graph.rb
+- vendor/git/plexus/lib/plexus/version.rb
+- vendor/git/plexus/lib/plexus/graph.rb
+- vendor/git/plexus/lib/plexus.rb
+- vendor/git/plexus/Rakefile
+- vendor/git/plexus/VERSION
+- vendor/git/plexus/TODO.md
+- vendor/git/plexus/plexus.gemspec
+- vendor/git/plexus/spec/spec.opts
+- vendor/git/plexus/spec/edge_spec.rb
+- vendor/git/plexus/spec/inspection_spec.rb
+- vendor/git/plexus/spec/digraph_spec.rb
+- vendor/git/plexus/spec/spec_helper.rb
+- vendor/git/plexus/spec/search_spec.rb
+- vendor/git/plexus/spec/triangulated_spec.rb
+- vendor/git/plexus/spec/multi_edge_spec.rb
+- vendor/git/plexus/spec/dot_spec.rb
+- vendor/git/plexus/spec/neighborhood_spec.rb
+- vendor/git/plexus/spec/complement_spec.rb
+- vendor/git/plexus/spec/biconnected_spec.rb
+- vendor/git/plexus/spec/undirected_graph_spec.rb
+- vendor/git/plexus/spec/chinese_postman_spec.rb
+- vendor/git/plexus/spec/strong_components_spec.rb
+- vendor/git/plexus/spec/community_spec.rb
+- vendor/git/plexus/spec/digraph_distance_spec.rb
+- vendor/git/plexus/spec/properties_spec.rb
+- vendor/git/plexus/Gemfile.lock
+- vendor/git/plexus/examples/module_graph.rb
+- vendor/git/plexus/examples/self_graph.jpg
+- vendor/git/plexus/examples/visualize.rb
+- vendor/git/plexus/examples/visualize.jpg
+- vendor/git/plexus/examples/graph_self.rb
+- vendor/git/plexus/examples/module_graph.jpg
+- vendor/git/plexus/README.md
+- vendor/git/plexus/vendor/priority-queue/ext/priority_queue/CPriorityQueue/priority_queue.c
+- vendor/git/plexus/vendor/priority-queue/ext/priority_queue/CPriorityQueue/extconf.rb
+- vendor/git/plexus/vendor/priority-queue/README
+- vendor/git/plexus/vendor/priority-queue/Makefile
+- vendor/git/plexus/vendor/priority-queue/lib/priority_queue/c_priority_queue.rb
+- vendor/git/plexus/vendor/priority-queue/lib/priority_queue/poor_priority_queue.rb
+- vendor/git/plexus/vendor/priority-queue/lib/priority_queue/ruby_priority_queue.rb
+- vendor/git/plexus/vendor/priority-queue/lib/priority_queue.rb
+- vendor/git/plexus/vendor/priority-queue/benchmark/dijkstra.rb
+- vendor/git/plexus/vendor/priority-queue/CHANGELOG
+- vendor/git/plexus/vendor/priority-queue/doc/compare_big.gp
+- vendor/git/plexus/vendor/priority-queue/doc/compare_small.png
+- vendor/git/plexus/vendor/priority-queue/doc/compare_small.gp
+- vendor/git/plexus/vendor/priority-queue/doc/results.csv
+- vendor/git/plexus/vendor/priority-queue/doc/c-vs-rb.png
+- vendor/git/plexus/vendor/priority-queue/doc/compare_big.png
+- vendor/git/plexus/vendor/priority-queue/priority_queue.so
+- vendor/git/plexus/vendor/priority-queue/test/priority_queue_test.rb
+- vendor/git/plexus/vendor/priority-queue/setup.rb
+- vendor/git/plexus/vendor/priority-queue/compare_comments.rb
+- vendor/git/plexus/vendor/rdot.rb
+- vendor/git/plexus/Gemfile
+- vendor/git/plexus/CREDITS.md
 - spec/spec.opts
 - spec/raw_tree_spec.rb
 - spec/spec_helper.rb

data/vendor/git/graphy/README.md

@@ -1,186 +0,0 @@
-# Graphy. A framework for graph theory, graph data structures and associated algorithms.
-
-Graph algorithms currently provided are:
-
-* Topological Sort
-* Strongly Connected Components 
-* Transitive Closure
-* Rural Chinese Postman
-* Biconnected
-
-These are based on more general algorithm patterns:
-
-* Breadth First Search 
-* Depth First Search 
-* A* Search
-* Floyd-Warshall
-* Best First Search
-* Djikstra's Algorithm
-* Lexicographic Search
-
-## A quick Tour
-
-### Arcs
-
-There are two vertices bound classes, `Graphy::Arc` and `Graphy::Edge`. The
-former defines directional edges, the latter undirected edges.
-
-### Vertices
-
-Vertices can be any `Object`.
-
-### Graph Types
-
-There are a number of different graph types, each of which provide
-different features and constraints:
-
-`Graphy::Digraph` and its alias `Graphy::DirectedGraph`:
-
-* Single directed edges (arcs) between vertices
-* Loops are forbidden
-
-`Graphy::DirectedPseudoGraph`:
-
-* Multiple directed edges (arcs) between vertices
-* Loops are forbidden
-
-`Graphy::DirectedMultiGraph`:
-
-* Multiple directed edges (arcs) between vertices
-* Loops on vertices
-
-`Graphy::UndirectedGraph`, `Graphy::UndirectedPseudoGraph`, and
-`Graph::UndirectedMultiGraph` are similar but all edges are undirected.
-
-### Data Structures
-
-In order to modelize data structures, make use of the `Graphy::AdjacencyGraph`
-module which provides a generalized adjacency list and an edge list adaptor.
-
-The `Graphy::Digraph` class is the general purpose "swiss army knife" of graph
-classes, most of the other classes are just modifications to this class.
-It is optimized for efficient access to just the out-edges, fast vertex
-insertion and removal at the cost of extra space overhead, etc.
-
-## Example Usage
-
-Using IRB, first require the library:
-
-    require 'rubygems' # only if you are using ruby 1.8.x
-    require 'graphy'
-
-If you'd like to include all the classes in the current scope (so you
-don't have to prefix with `Graphy::`), just:
-
-    include Graphy
-
-Let's play with the library a bit in IRB:
-
-    >> dg = Digraph[1,2, 2,3, 2,4, 4,5, 6,4, 1,6]
-    => Graphy::Digraph[[2, 3], [1, 6], [2, 4], [4, 5], [1, 2], [6, 4]] 
-
-A few properties of the graph we just created:
-
-    >> dg.directed?
-    => true
-    >> dg.vertex?(4)
-    => true
-    >> dg.edge?(2,4)
-    => true
-    >> dg.edge?(4,2)
-    => false
-    >> dg.vertices
-    => [1, 2, 3, 4, 5, 6]
-
-Every object could be a vertex, even the class object `Object`:
-
-    >> dg.vertex?(Object)
-    => false
-
-    >> UndirectedGraph.new(dg).edges.sort.to_s
-    => "[Graphy::Edge[1,2,nil], Graphy::Edge[2,3,nil], Graphy::Edge[2,4,nil],
-         Graphy::Edge[4,5,nil], Graphy::Edge[1,6,nil], Graphy::Edge[6,4,nil]]"
-
-Add inverse edge `(4-2)` to directed graph:
-
-    >> dg.add_edge!(4,2)
-    => Graphy::DirectedGraph[Graphy::Arc[1,2,nil], Graphy::Arc[1,6,nil], Graphy::Arc[2,3,nil],
-                             Graphy::Arc[2,4,nil], Graphy::Arc[4,5,nil], Graphy::Arc[4,2,nil],
-                             Graphy::Arc[6,4,nil]]
-
-`(4-2) == (2-4)` in the undirected graph (4-2 doesn't show up):
-
-    >> UndirectedGraph.new(dg).edges.sort.to_s
-    => "[Graphy::Edge[1,2,nil], Graphy::Edge[2,3,nil], Graphy::Edge[2,4,nil],
-         Graphy::Edge[4,5,nil], Graphy::Edge[1,6,nil], Graphy::Edge[6,4,nil]]"
-
-`(4-2) != (2-4)` in directed graphs (both show up):
-
-    >> dg.edges.sort.to_s
-    => "[Graphy::Arc[1,2,nil], Graphy::Arc[1,6,nil], Graphy::Arc[2,3,nil],
-         Graphy::Arc[2,4,nil], Graphy::Arc[4,2,nil], Graphy::Arc[4,5,nil],
-         Graphy::Arc[6,4,nil]]"
-
-    >> dg.remove_edge! 4,2
-    => Graphy::DirectedGraph[Graphy::Arc[1,2,nil], Graphy::Arc[1,6,nil], Graphy::Arc[2,3,nil],
-                             Graphy::Arc[2,4,nil], Graphy::Arc[4,5,nil], Graphy::Arc[6,4,nil]]
-
-Topological sorting is realized with an iterator:
-
-    >> dg.topsort         
-    => [1, 6, 2, 4, 5, 3]
-    >> y = 0; dg.topsort { |v| y += v }; y
-    => 21
-
-You can use DOT to visualize the graph:
-
-    >> require 'graphy/dot'
-    >> dg.write_to_graphic_file('jpg','visualize')
-
-Here's an example showing the module inheritance hierarchy:
-
-    >> module_graph = Digraph.new
-    >> ObjectSpace.each_object(Module) do |m|
-    >>   m.ancestors.each {|a| module_graph.add_edge!(m,a) if m != a} 
-    >> end
-    >> gv = module_graph.vertices.select {|v| v.to_s.match(/Graphy/) }
-    >> module_graph.induced_subgraph(gv).write_to_graphic_file('jpg','module_graph')
-
-Look for more in the examples directory.
- 
-## History
-
-This library is based on [GRATR][1] by Shawn Garbett (itself a fork of
-Horst Duchene's [RGL][2] library) which is heavily influenced by the [Boost][3]
-Graph Library (BGL).
-
-This fork attempts to modernize and extend the API and tests.
-
-## References
-
-For more information on Graph Theory, you may want to read:
-
-* the [documentation][3] for the Boost Graph Library
-* [the Dictionary of Algorithms and Data Structures][4]
-
-## Credits
-
-See CREDITS.markdown
-
-## TODO
-
-See TODO.markdown
-
-## CHANGELOG
-
-See CHANGELOG.markdown
-
-## License
-
-See LICENSE
-
-[1]: http://gratr.rubyforge.org
-[2]: http://rgl.rubyforge.org
-[3]: http://www.boost.org/libs/graph/doc
-[4]: http://www.nist.gov/dads/HTML/graph.html
-

data/vendor/git/graphy/Rakefile

@@ -1,61 +0,0 @@
-require 'rubygems'
-require 'rake'
-require 'yard'
-
-begin
-  require 'jeweler'
-  Jeweler::Tasks.new do |gem|
-    gem.name = "graphy"
-    gem.summary = "A Graph Theory Ruby library"
-    gem.description =<<-EOD
-A framework for graph data structures and algorithms.
-
-This library is based on GRATR and RGL.
-
-Graph algorithms currently provided are:
-
-* Topological Sort
-* Strongly Connected Components 
-* Transitive Closure
-* Rural Chinese Postman
-* Biconnected
-    EOD
-    gem.email = "bruce@codefluency.com"
-    gem.homepage = "http://github.com/bruce/graphy"
-    gem.authors = ["Bruce Williams"]
-  end
-  Jeweler::GemcutterTasks.new
-rescue LoadError
-  puts "Jeweler (or a dependency) not available. Install it with: sudo gem install jeweler"
-end
-
-require 'rake/rdoctask'
-Rake::RDocTask.new do |rdoc|
-  version = File.exist?('VERSION') ? File.read('VERSION') : ""
-
-  rdoc.rdoc_dir = 'rdoc'
-  rdoc.title = "graphy #{version}"
-  rdoc.rdoc_files.include('README*')
-  rdoc.rdoc_files.include('lib/**/*.rb')
-end
-
-#require 'spec/rake/spectask'
-#Spec::Rake::SpecTask.new(:spec) do |spec|
-  #spec.libs << 'lib' << 'spec'
-  #spec.spec_files = FileList['spec/**/*_spec.rb']
-#end
-
-#Spec::Rake::SpecTask.new(:rcov) do |spec|
-  #spec.libs << 'lib' << 'spec'
-  #spec.pattern = 'spec/**/*_spec.rb'
-  #spec.rcov = true
-#end
-
-#task :spec => :check_dependencies
-
-#task :default => :spec
-
-YARD::Rake::YardocTask.new do |t|
-  t.files   = ['lib/**/*.rb', 'README.md', 'TODO.md', 'CREDITS.md', 'LICENSE', 'VERSION']
-  #t.options = ['--any', '--extra', '--opts'] # optional
-end