jumoku 0.2.0 → 0.2.1

metadata

@@ -2,7 +2,7 @@
 name: jumoku
 version: !ruby/object:Gem::Version 
   prerelease: 
-  version: 0.2.0
+  version: 0.2.1
 platform: ruby
 authors: 
 - Jean-Denis Vauguet <jd@vauguet.fr>
@@ -10,7 +10,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2011-07-08 00:00:00 +02:00
+date: 2011-07-10 00:00:00 +02:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -36,7 +36,7 @@ dependencies:
   type: :runtime
   version_requirements: *id002
 - !ruby/object:Gem::Dependency 
-  name: rspec
+  name: plexus
   prerelease: false
   requirement: &id003 !ruby/object:Gem::Requirement 
     none: false
@@ -44,10 +44,10 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version 
         version: "0"
-  type: :development
+  type: :runtime
   version_requirements: *id003
 - !ruby/object:Gem::Dependency 
-  name: yard
+  name: rspec
   prerelease: false
   requirement: &id004 !ruby/object:Gem::Requirement 
     none: false
@@ -57,6 +57,17 @@ dependencies:
         version: "0"
   type: :development
   version_requirements: *id004
+- !ruby/object:Gem::Dependency 
+  name: yard
+  prerelease: false
+  requirement: &id005 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+  type: :development
+  version_requirements: *id005
 description: Jumoku provides you with tree behaviors to mixin and tree classes to inherit from. Raw tree, common binary trees, custom trees...
 email: jd@vauguet.fr
 executables: []
@@ -67,7 +78,6 @@ extra_rdoc_files: []
 
 files: 
 - lib/jumoku.rb
-- lib/jumoku/tree_api.rb
 - lib/jumoku/ext/ext.rb
 - lib/jumoku/builders/raw_undirected_tree.rb
 - lib/jumoku/builders/tree.rb
@@ -78,92 +88,17 @@ files:
 - lib/jumoku/raw_tree_node.rb
 - lib/jumoku/classes/tree_classes.rb
 - lib/jumoku/support/support.rb
+- lib/jumoku/support/ruby_compatibility.rb
 - lib/jumoku/support/branch.rb
 - lib/jumoku/version.rb
-- 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/arborescence_spec.rb
 - spec/spec_helper.rb
+- spec/raw_directed_tree_spec.rb
 - spec/raw_undirected_tree_spec.rb
 - spec/tree_spec.rb
+- spec/behaviors/extended.rb
+- spec/behaviors/core_tree.rb
 - Gemfile
 - LICENSE
 - Rakefile

data/lib/jumoku/tree_api.rb

@@ -1,27 +0,0 @@
-module Jumoku
-  # This module defines the minimum set of methods required to build a tree
-  # which can use the algorithms defined in this library.
-  #
-  # A module based abiding to the TreeAPI must implement the following routines:
-  #
-  # * add_node!(n, l = nil) — adds a node to the tree and return the tree; l is an optional label (see Plexus library).
-  # * add_branch!(i, j = nil, l = nil) — adds a branch to the tree and return the tree. i can be a {Branch}, or (i,j) a node pair; l is an optional label.
-  # * remove_node!(n) — removes a node from the tree and return the tree.
-  # * remove_branch!(i, j = nil) — removes an edge from the graph and return the tree. i can be a {Branch}, or (i,j) a node pair.
-  # * nodes — returns an array of all nodes.
-  # * terminal_nodes — returns an array of all terminal nodes.
-  # * branches — returns an array of all branches.
-  #
-  module TreeAPI
-    # @raise [JumokuError] if the API is not completely implemented
-    #
-    def self.included(klass)
-      @api_methods ||= [:add_node!, :add_branch!, :remove_node!, :remove_branch!, :nodes, :terminal_nodes, :branches]
-      ruby_18 { @api_methods.each { |m| m.to_s } }
-
-      @api_methods.each do |meth|
-        raise JumokuError, "Must implement #{meth}" unless klass.instance_methods.include?(meth)
-      end
-    end
-  end
-end

data/vendor/git/plexus/CREDITS.md

@@ -1,31 +0,0 @@
-Credits
-=======
-
-From GRATR
-----------
-
-Shawn Garbett provided the following credits in GRATR:
-
-Many thanks to Robert Feldt which also worked on a graph library
-(http://rockit.sf.net/subprojects/graphr) who pointed me to BGL and many other
-graph resources. Manuel Simoni found a subtle bug in a preliminary version
-announced at http://rubygarden.com/ruby?RubyAlgorithmPackage/Graph.
-
-Robert kindly allowed to integrate his work on graphr, which I did not yet
-succeed. Especially his work to output graphs for
-GraphViz[http://www.research.att.com/sw/tools/graphviz/download.html] is much
-more elaborated than the minimal support in dot.rb.
-
-Jeremy Siek one of the authors of the nice book "The Boost Graph Library (BGL)"
-(http://www.boost.org/libs/graph/doc) kindly allowed to use the
-BGL documentation as a _cheap_ reference for GRATR. He and Robert also gave
-feedback and many ideas for GRATR.
-
-Dave Thomas for RDoc[http://rdoc.sourceforge.net] which generated what you read
-and Matz for Ruby. Dave included in the latest version of RDoc (alpha9) the
-module dot/dot.rb which I use instead of Roberts module to visualize graphs
-(see gratr/dot.rb).
-
-Horst Duchene for RGL which provided the basis for this library and his vision.
-
-Rick Bradley who reworked the library and added many graph theoretic constructs.

data/vendor/git/plexus/Gemfile

@@ -1,3 +0,0 @@
-source "http://rubygems.org"
-
-gemspec

data/vendor/git/plexus/Gemfile.lock

@@ -1,28 +0,0 @@
-PATH
-  remote: .
-  specs:
-    plexus (0.5.3)
-      facets
-
-GEM
-  remote: http://rubygems.org/
-  specs:
-    diff-lcs (1.1.2)
-    facets (2.9.1)
-    rspec (2.6.0)
-      rspec-core (~> 2.6.0)
-      rspec-expectations (~> 2.6.0)
-      rspec-mocks (~> 2.6.0)
-    rspec-core (2.6.4)
-    rspec-expectations (2.6.0)
-      diff-lcs (~> 1.1.2)
-    rspec-mocks (2.6.0)
-    yard (0.7.2)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  plexus!
-  rspec
-  yard

data/vendor/git/plexus/LICENSE

@@ -1,37 +0,0 @@
-Copyright (c) 2010 Jean-Denis Vauguet <jd@vauguet.fr>
-
-Copyright (c) 2009 Bruce Williams
-
-Copyright (c) 2007,2006 Shawn Patrick Garbett
-
-Copyright (c) 2002,2004,2005 by Horst Duchene
-
-Copyright (c) 2000,2001  Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-
-All rights reserved.
-
-Jeremy Siek was one of the principal developers of the Boost Graph library.
-Since this work is derivative, his name is included in the copyright list.
-
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
-    * Redistributions of source code must retain the above copyright notice(s),
-      this list of conditions and the following disclaimer.
-    * Redistributions in binary form must reproduce the above copyright notice,
-      this list of conditions and the following disclaimer in the documentation
-      and/or other materials provided with the distribution.
-    * Neither the name of the Bruce Williams nor the names of its contributors
-      may be used to endorse or promote products derived from this software
-      without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/vendor/git/plexus/README.md

@@ -1,208 +0,0 @@
-# Plexus (was 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, `Plexus::Arc` and `Plexus::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:
-
-`Plexus::Digraph` and its alias `Plexus::DirectedGraph`:
-
-* Single directed edges (arcs) between vertices
-* Loops are forbidden
-
-`Plexus::DirectedPseudoGraph`:
-
-* Multiple directed edges (arcs) between vertices
-* Loops are forbidden
-
-`Plexus::DirectedMultiGraph`:
-
-* Multiple directed edges (arcs) between vertices
-* Loops on vertices
-
-`Plexus::UndirectedGraph`, `Plexus::UndirectedPseudoGraph`, and
-`Graph::UndirectedMultiGraph` are similar but all edges are undirected.
-
-### Data Structures
-
-In order to modelize data structures, make use of the `Plexus::AdjacencyGraph`
-module which provides a generalized adjacency list and an edge list adaptor.
-
-The `Plexus::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:
-
-``` bash
-require 'rubygems' # only if you are using ruby 1.8.x
-require 'plexus'
-```
-
-If you'd like to include all the classes in the current scope (so you
-don't have to prefix with `Plexus::`), just:
-
-``` bash
-include Plexus
-```
-
-Let's play with the library a bit in IRB:
-
-``` bash
->> dg = Digraph[1,2, 2,3, 2,4, 4,5, 6,4, 1,6]
-=> Plexus::Digraph[[2, 3], [1, 6], [2, 4], [4, 5], [1, 2], [6, 4]]
-```
-
-A few properties of the graph we just created:
-
-``` bash
->> 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`:
-
-``` bash
->> dg.vertex?(Object)
-=> false
-
->> UndirectedGraph.new(dg).edges.sort.to_s
-=> "[Plexus::Edge[1,2,nil], Plexus::Edge[2,3,nil], Plexus::Edge[2,4,nil],
-      Plexus::Edge[4,5,nil], Plexus::Edge[1,6,nil], Plexus::Edge[6,4,nil]]"
-```
-
-Add inverse edge `(4-2)` to directed graph:
-
-``` bash
->> dg.add_edge!(4,2)
-=> Plexus::DirectedGraph[Plexus::Arc[1,2,nil], Plexus::Arc[1,6,nil], Plexus::Arc[2,3,nil],
-                          Plexus::Arc[2,4,nil], Plexus::Arc[4,5,nil], Plexus::Arc[4,2,nil],
-                          Plexus::Arc[6,4,nil]]
-```
-
-`(4-2) == (2-4)` in the undirected graph (4-2 doesn't show up):
-
-``` bash
-    >> UndirectedGraph.new(dg).edges.sort.to_s
-    => "[Plexus::Edge[1,2,nil], Plexus::Edge[2,3,nil], Plexus::Edge[2,4,nil],
-         Plexus::Edge[4,5,nil], Plexus::Edge[1,6,nil], Plexus::Edge[6,4,nil]]"
-```
-
-`(4-2) != (2-4)` in directed graphs (both show up):
-
-``` bash
->> dg.edges.sort.to_s
-=> "[Plexus::Arc[1,2,nil], Plexus::Arc[1,6,nil], Plexus::Arc[2,3,nil],
-      Plexus::Arc[2,4,nil], Plexus::Arc[4,2,nil], Plexus::Arc[4,5,nil],
-      Plexus::Arc[6,4,nil]]"
-
->> dg.remove_edge! 4,2
-=> Plexus::DirectedGraph[Plexus::Arc[1,2,nil], Plexus::Arc[1,6,nil], Plexus::Arc[2,3,nil],
-                          Plexus::Arc[2,4,nil], Plexus::Arc[4,5,nil], Plexus::Arc[6,4,nil]]
-```
-
-Topological sorting is realized with an iterator:
-
-``` bash
->> 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:
-
-``` bash
->> require 'plexus/dot'
->> dg.write_to_graphic_file('jpg','visualize')
-```
-
-Here's an example showing the module inheritance hierarchy:
-
-``` bash
->> 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(/Plexus/) }
->> 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
-
-[MIT License](http://en.wikipedia.org/wiki/MIT_License). See the LICENSE file.
-
-[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
-