jumoku 0.1.2 → 0.1.3

data/vendor/git/plexus/Rakefile

@@ -0,0 +1,25 @@
+# encoding: UTF-8
+require 'rubygems'
+begin
+  require 'bundler/setup'
+rescue LoadError
+  puts 'You must `gem install bundler` and `bundle install` to run rake tasks'
+end
+
+require 'rake'
+require 'rake/rdoctask'
+
+require 'rspec/core'
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec
+
+Rake::RDocTask.new(:rdoc) do |rdoc|
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title    = 'Plexus'
+  rdoc.options << '--line-numbers' << '--inline-source'
+  rdoc.rdoc_files.include('README.rdoc')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/vendor/git/{graphy → plexus}/TODO.md

@@ -14,7 +14,7 @@
 The following list was present in GRATR, and items may (or may not) be added to this library:
 
 * Primal Dual for combinatorial optimization problems
-* Min-Max Flow 
+* Min-Max Flow
 * Near optimal traveling salesman problem
 * Orientation of undirected graphs
 * Undirected graphs from ActiveRecord

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

@@ -0,0 +1,90 @@
+#--
+# Copyright (c) 2006 Shawn Patrick Garbett
+# Copyright (c) 2002,2004,2005 by Horst Duchene
+#
+# 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 Shawn Garbett 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.
+#++
+
+require 'set'
+
+module Plexus
+  # Plexus internals: graph builders and additionnal behaviors
+  autoload :GraphAPI,                     'plexus/graph_api'
+
+  autoload :GraphBuilder,                 'plexus/graph'
+  autoload :AdjacencyGraphBuilder,        'plexus/adjacency_graph'
+
+  autoload :DirectedGraphBuilder,         'plexus/directed_graph'
+  autoload :DigraphBuilder,               'plexus/directed_graph'
+  autoload :DirectedPseudoGraphBuilder,   'plexus/directed_graph'
+  autoload :DirectedMultiGraphBuilder,    'plexus/directed_graph'
+
+  autoload :UndirectedGraphBuilder,       'plexus/undirected_graph'
+  autoload :UndirectedPseudoGraphBuilder, 'plexus/undirected_graph'
+  autoload :UndirectedMultiGraphBuilder,  'plexus/undirected_graph'
+
+  autoload :Arc,                          'plexus/arc'
+  autoload :ArcNumber,                    'plexus/arc_number'
+  autoload :Biconnected,                  'plexus/biconnected'
+  autoload :ChinesePostman,               'plexus/chinese_postman'
+  autoload :Common,                       'plexus/common'
+  autoload :Comparability,                'plexus/comparability'
+
+  autoload :Dot,                          'plexus/dot'
+  autoload :Edge,                         'plexus/edge'
+  autoload :Labels,                       'plexus/labels'
+  autoload :MaximumFlow,                  'plexus/maximum_flow'
+  #autoload :Rdot,                        'plexus/dot'
+  autoload :Search,                       'plexus/search'
+  autoload :StrongComponents,             'plexus/strong_components'
+
+  # Plexus classes
+  autoload :AdjacencyGraph,               'plexus/classes/graph_classes'
+  autoload :DirectedGraph,                'plexus/classes/graph_classes'
+  autoload :Digraph,                      'plexus/classes/graph_classes'
+  autoload :DirectedPseudoGraph,          'plexus/classes/graph_classes'
+  autoload :DirectedMultiGraph,           'plexus/classes/graph_classes'
+  autoload :UndirectedGraph,              'plexus/classes/graph_classes'
+  autoload :UndirectedPseudoGraph,        'plexus/classes/graph_classes'
+  autoload :UndirectedMultiGraph,         'plexus/classes/graph_classes'
+
+  # ruby stdlib extensions
+  require 'plexus/ext'
+  # ruby 1.8.x/1.9.x compatibility
+  require 'plexus/ruby_compatibility'
+end
+
+# Vendored libraries
+
+require 'pathname'
+path = Pathname.new(__FILE__)
+$LOAD_PATH.unshift(path + '../../vendor') # http://ruby.brian-amberg.de/priority-queue/
+$LOAD_PATH.unshift(path + '../../vendor/priority-queue/lib')
+
+require 'rdot'
+require 'facets/hash'
+
+require 'priority_queue/ruby_priority_queue'
+PriorityQueue = RubyPriorityQueue
+

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/adjacency_graph.rb

@@ -1,4 +1,4 @@
-module Graphy
+module Plexus
 
   # This module provides the basic routines needed to implement the specialized builders:
   # {DigraphBuilder}, {UndirectedGraphBuilder}, {DirectedPseudoGraphBuilder},
@@ -42,7 +42,7 @@ module Graphy
       end
 
       # Copy any given graph into this graph.
-      params.select { |p| p.is_a? Graphy::GraphBuilder }.each do |g|
+      params.select { |p| p.is_a? Plexus::GraphBuilder }.each do |g|
         g.edges.each do |e| 
           add_edge!(e)
           edge_label_set(e, edge_label(e)) if edge_label(e)
@@ -75,7 +75,7 @@ module Graphy
     # @param [vertex] v (nil)
     # @return [Boolean]
     def edge?(u, v = nil)
-      u, v = u.source, u.target if u.is_a? Graphy::Arc
+      u, v = u.source, u.target if u.is_a? Plexus::Arc
       vertex?(u) and @vertex_dict[u].include?(v)
     end
 
@@ -106,7 +106,7 @@ module Graphy
     #   @return [AdjacencyGraph] `self`
     def add_edge!(u, v = nil, l = nil, n = nil)
       n = u.number if u.class.include? ArcNumber and n.nil?
-      u, v, l = u.source, u.target, u.label if u.is_a? Graphy::Arc
+      u, v, l = u.source, u.target, u.label if u.is_a? Plexus::Arc
 
       return self if not @allow_loops and u == v
 
@@ -144,10 +144,10 @@ module Graphy
     # Removes an edge from the graph.
     #
     # Can be called with both source and target as vertex,
-    # or with source and object of {Graphy::Arc} derivation.
+    # or with source and object of {Plexus::Arc} derivation.
     #
     # @overload remove_edge!(a)
-    #   @param [Graphy::Arc] a
+    #   @param [Plexus::Arc] a
     #   @return [AdjacencyGraph] `self`
     #   @raise [ArgumentError] if parallel edges are enabled
     # @overload remove_edge!(u, v)
@@ -156,7 +156,7 @@ module Graphy
     #   @return [AdjacencyGraph] `self`
     #   @raise [ArgumentError] if parallel edges are enabled and the {ArcNumber} of `u` is zero
     def remove_edge!(u, v = nil)
-      unless u.is_a? Graphy::Arc
+      unless u.is_a? Plexus::Arc
         raise ArgumentError if @parallel_edges
         u = edge_class[u,v]
       end
@@ -206,7 +206,7 @@ module Graphy
     # @fixme
     def adjacent(x, options = {})
       options[:direction] ||= :out
-      if !x.is_a?(Graphy::Arc) and (options[:direction] == :out || !directed?)
+      if !x.is_a?(Plexus::Arc) and (options[:direction] == :out || !directed?)
         if options[:type] == :edges
           i = -1
           @parallel_edges ?
@@ -221,4 +221,4 @@ module Graphy
     end
 
   end # Adjacency Graph
-end # Graphy
+end # Plexus

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/arc.rb

@@ -1,14 +1,12 @@
-module Graphy
-
+module Plexus
   # Arc includes classes for representing egdes of directed and
   # undirected graphs. There is no need for a Vertex class, because any ruby
   # object can be a vertex of a graph.
   #
-  # Arc's base is a Struct with a :source, a :target and a :label
+  # Arc's base is a Struct with a :source, a :target and a :label.
   Struct.new("ArcBase", :source, :target, :label)
 
   class Arc < Struct::ArcBase
-
     def initialize(p_source, p_target, p_label = nil)
       super(p_source, p_target, p_label)
     end
@@ -20,7 +18,9 @@ module Graphy
     alias == eql?
 
     # Returns (v,u) if self == (u,v).
-    def reverse() self.class.new(target, source, label); end
+    def reverse()
+      self.class.new(target, source, label)
+    end
 
     # Sort support.
     def <=>(rhs)
@@ -32,18 +32,14 @@ module Graphy
       l = label ? " '#{label.to_s}'" : ''
       "(#{source}-#{target}#{l})"
     end
-    
+
     # Hash is defined in such a way that label is not
     # part of the hash value
     # FIXME: I had to get rid of that in order to make to_dot_graph
     # work, but I can't figure it out (doesn't show up in the stack!)
-    #def hash
-      #puts "--- #{caller}"
-      ##puts source.inspect
-      ##puts target.inspect
-      #source.hash ^ (target.hash + 1)
-      #puts "---"
-    #end
+    def hash
+      source.hash ^ (target.hash + 1)
+    end
 
     # Shortcut constructor.
     #
@@ -51,15 +47,13 @@ module Graphy
     def self.[](p_source, p_target, p_label = nil)
       new(p_source, p_target, p_label)
     end
-    
-    #def inspect
-      #"#{self.class.to_s}[#{source.inspect},#{target.inspect},#{label.inspect}]"
-    #end
-    
-  end # Arc
-  
+
+    def inspect
+      "#{self.class.to_s}[#{source.inspect},#{target.inspect},#{label.inspect}]"
+    end
+  end
+
   class MultiArc < Arc
     include ArcNumber
   end
-
-end # Graphy
+end

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/arc_number.rb

@@ -1,4 +1,4 @@
-module Graphy
+module Plexus
   # This module handles internal numbering of edges in order to differente between mutliple edges.
   module ArcNumber
 
@@ -49,4 +49,4 @@ module Graphy
     end
 
   end # ArcNumber
-end # Graphy
+end # Plexus

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/biconnected.rb

@@ -1,4 +1,4 @@
-module Graphy
+module Plexus
 
   # Biconnected is a module for adding the biconnected algorithm to 
   # UndirectedGraphs
@@ -81,4 +81,4 @@ module Graphy
     end # biconnected
 
   end # Biconnected
-end # Graphy
+end # Plexus

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/chinese_postman.rb

@@ -1,4 +1,4 @@
-module Graphy
+module Plexus
   module ChinesePostman    
 
     # Returns the shortest walk that traverses all arcs at least
@@ -87,5 +87,5 @@ module Graphy
     end
 
   end # Chinese Postman
-end # Graphy
+end # Plexus
 

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/classes/graph_classes.rb

@@ -1,28 +1,28 @@
-module Graphy
+module Plexus
   # A generic {GraphBuilder Graph} class you can inherit from.
-  class Graph;                 include GraphBuilder;                 end
+  class Graph;                         include GraphBuilder;                 end
 
   # A generic {AdjacencyGraphBuilder AdjacencyGraph} class you can inherit from.
-  class AdjacencyGraph;        include AdjacencyGraphBuilder;        end
+  class AdjacencyGraph < Graph;        include AdjacencyGraphBuilder;        end
 
   # A generic {DirectedGraphBuilder DirectedGraph} class you can inherit from.
-  class DirectedGraph;         include DirectedGraphBuilder;         end
+  class DirectedGraph < Graph;         include DirectedGraphBuilder;         end
 
   # A generic {DigraphBuilder Digraph} class you can inherit from.
-  class Digraph;               include DigraphBuilder;               end
+  class Digraph < Graph;               include DigraphBuilder;               end
 
   # A generic {DirectedPseudoGraphBuilder DirectedPseudoGraph} class you can inherit from.
-  class DirectedPseudoGraph;   include DirectedPseudoGraphBuilder;   end
+  class DirectedPseudoGraph < Graph;   include DirectedPseudoGraphBuilder;   end
 
   # A generic {DirectedMultiGraphBuilder DirectedMultiGraph} class you can inherit from.
-  class DirectedMultiGraph;    include DirectedMultiGraphBuilder;    end
+  class DirectedMultiGraph < Graph;    include DirectedMultiGraphBuilder;    end
 
   # A generic {UndirectedGraphBuilder UndirectedGraph} class you can inherit from.
-  class UndirectedGraph;       include UndirectedGraphBuilder;       end
+  class UndirectedGraph < Graph;       include UndirectedGraphBuilder;       end
 
   # A generic {UndirectedPseudoGraphBuilder UndirectedPseudoGraph} class you can inherit from.
-  class UndirectedPseudoGraph; include UndirectedPseudoGraphBuilder; end
+  class UndirectedPseudoGraph < Graph; include UndirectedPseudoGraphBuilder; end
 
   # A generic {UndirectedMultiGraphBuilder UndirectedMultiGraph} class you can inherit from.
-  class UndirectedMultiGraph;  include UndirectedMultiGraphBuilder;  end
+  class UndirectedMultiGraph < Graph;  include UndirectedMultiGraphBuilder;  end
 end

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/common.rb

@@ -1,4 +1,4 @@
-module Graphy
+module Plexus
 
   # This class defines a cycle graph of size n.
   # This is easily done by using the base Graph
@@ -23,12 +23,12 @@ module Graphy
     end
 
     def edge?(u,v = nil)
-      u, v = [u.source, v.target] if u.is_a? Graphy::Arc
+      u, v = [u.source, v.target] if u.is_a? Plexus::Arc
       vertex?(u) && vertex?(v) && ((v-u == 1) or (u == @size && v = 1))
     end
 
     def edges
-      Array.new(@size) { |i| Graphy::Edge[i+1, (i+1) == @size ? 1 : i+2]}
+      Array.new(@size) { |i| Plexus::Edge[i+1, (i+1) == @size ? 1 : i+2]}
     end
   end # CycleBuilder
 
@@ -49,15 +49,15 @@ module Graphy
       return @edges if @edges      # cache edges
       @edges = []
       @size.times do |u|
-        @size.times { |v| @edges << Graphy::Edge[u+1, v+1]}
+        @size.times { |v| @edges << Plexus::Edge[u+1, v+1]}
       end
       @edges
     end
 
     def edge?(u, v = nil)
-      u, v = [u.source, v.target] if u.kind_of? Graphy::Arc
+      u, v = [u.source, v.target] if u.kind_of? Plexus::Arc
       vertex?(u) && vertex?(v)
     end
   end # CompleteBuilder
 
-end # Graphy
+end # Plexus

data/vendor/git/{graphy/lib/graphy → plexus/lib/plexus}/comparability.rb

@@ -1,4 +1,4 @@
-module Graphy
+module Plexus
   module Comparability
     
     # A comparability graph is an UndirectedGraph that has a transitive
@@ -19,7 +19,7 @@ module Graphy
         if classification[e].nil?
           k += 1
           classification[e] = k; classification[e.reverse] = -k
-          comparability &&= graphy_comparability_explore(e, k, classification)
+          comparability &&= plexus_comparability_explore(e, k, classification)
         end
       end; [classification, comparability]
     end
@@ -34,12 +34,12 @@ module Graphy
    
     # Taken from Figure 5.10, on pg. 130 of Martin Golumbic's, _Algorithmic_Graph_
     # _Theory_and_Perfect_Graphs.
-    def graphy_comparability_explore(edge, k, classification, space='')
-      ret = graphy_comparability_explore_inner(edge, k, classification, :forward, space)
-      graphy_comparability_explore_inner(edge.reverse, k, classification, :backward, space) && ret
+    def plexus_comparability_explore(edge, k, classification, space='')
+      ret = plexus_comparability_explore_inner(edge, k, classification, :forward, space)
+      plexus_comparability_explore_inner(edge.reverse, k, classification, :backward, space) && ret
     end
     
-    def graphy_comparability_explore_inner(edge, k, classification, direction,space)
+    def plexus_comparability_explore_inner(edge, k, classification, direction,space)
       comparability = true  
       adj_target = adjacent(edge[1])
       adjacent(edge[0]).select do |mt|
@@ -50,14 +50,14 @@ module Graphy
         if classification[e].nil?
           classification[e] = k
           classification[e.reverse] = -k
-          comparability = graphy_comparability_explore(e, k, classification, '  '+space) && comparability
+          comparability = plexus_comparability_explore(e, k, classification, '  '+space) && comparability
         elsif classification[e] == -k
           classification[e] = k
-          graphy_comparability_explore(e, k, classification, '  '+space)
+          plexus_comparability_explore(e, k, classification, '  '+space)
           comparability = false
         end
       end; comparability
-    end # graphy_comparability_explore_inner
+    end # plexus_comparability_explore_inner
     
   end # Comparability
-end # Graphy
+end # Plexus