jumoku 0.2.0 → 0.2.1

data/vendor/git/plexus/Rakefile

@@ -1,25 +0,0 @@
-# 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/plexus/TODO.md

@@ -1,20 +0,0 @@
-# TODO
-
-## From the current Graphy project
-
-* code cleanup: syntax, typo
-* YARD documentation
-* hunt for buggy behaviors
-* a solid helper to check graphy object type in replacement of the current `is_a?` hack
-* have the `[]` class method propagate through nested module inclusions [see this topic](http://www.ruby-forum.com/topic/68638)
-* [Incremental heuristic search algorithms](http://en.wikipedia.org/wiki/Incremental_heuristic_search)?
-
-## From GRATR
-
-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
-* Near optimal traveling salesman problem
-* Orientation of undirected graphs
-* Undirected graphs from ActiveRecord

data/vendor/git/plexus/VERSION

@@ -1 +0,0 @@
-0.5.2

data/vendor/git/plexus/examples/graph_self.rb

@@ -1,56 +0,0 @@
-#!/usr/bin/ruby -I../lib
-
-require 'gratr'
-require 'gratr/dot'
-
-include GRATR
-
-# This program gives an example of dynamic analysis of a program's call stack,
-# that exports to dot and creates a jpg visualization of the call diagram.
-
-class GraphSelf
-  
-  # Setup some data to call Dijkstra's Algorithm
-  def initialize
-    @d = Digraph[ [:a,:b] => 9, [:a,:e] => 3,
-                  [:b,:c] => 2, [:b,:e] => 6,
-                  [:c,:d] => 1,
-                  [:d,:c] => 2,
-                  [:e,:b] => 2, [:e,:f] => 1,
-                  [:f,:c] => 2, [:f,:d] => 7, [:f,:e] => 2 ]
-
-    @call_stack = []
-    @call_graph = Digraph.new
-  end
-  
-  # Get the call graph variable
-  def call_graph() @call_graph; end
-  
-  # Turn capturing of call graph on
-  def capture_func
-    Proc.new do |event, f, l, id, b, klass|
-      # Only interested in the GRATR library itself
-      if ( klass.to_s =~ /GRATR/ ) 
-        case event.to_s
-          when /call/ 
-            method = "#{klass.to_s.split('::')[1]}.#{id}" # Removes GRATR:: 
-            @call_graph.add_edge!(@call_stack[-1],method) if @call_stack[-1] 
-            @call_stack.push(method)
-          when /return/ : @call_stack.pop
-        end
-      end
-    end
-  end 
-
-  # Run a capture of the call graph for Dijkstra's algorithm  
-  def run
-    set_trace_func capture_func
-    @d.dijkstras_algorithm(:a)
-    set_trace_func nil
-    self
-  end
-   
-end
-
-# Run a capture and generate the resulting jpg file
-GraphSelf.new.run.call_graph.write_to_graphic_file('jpg','self_graph')

data/vendor/git/plexus/examples/module_graph.rb

@@ -1,14 +0,0 @@
-#!/usr/bin/ruby -I../lib
-
-require 'gratr'
-require 'gratr/dot'
-
-include GRATR
-
-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(/GRATR/) && v.to_s != 'GRATR'}
-module_graph.induced_subgraph(gv).write_to_graphic_file('jpg','module_graph')

data/vendor/git/plexus/examples/visualize.rb

@@ -1,10 +0,0 @@
-#!/usr/bin/ruby -I../lib
-
-require 'gratr'
-require 'gratr/dot'
-
-import GRATR
-
-dg = Digraph[1,2, 2,3, 2,4, 4,5, 6,4, 1,6]
-
-dg.write_to_graphic_file('jpg','visualize')

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

@@ -1,90 +0,0 @@
-#--
-# 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/plexus/lib/plexus/adjacency_graph.rb

@@ -1,224 +0,0 @@
-module Plexus
-
-  # This module provides the basic routines needed to implement the specialized builders:
-  # {DigraphBuilder}, {UndirectedGraphBuilder}, {DirectedPseudoGraphBuilder},
-  # {UndirectedPseudoGraphBuilder}, {DirectedMultiGraphBuilder} and {UndirectedMultiGraphBuilder}
-  # modules, each of them streamlining {AdjacencyGraphBuilder}'s behavior. Those
-  # implementations rely on the {GraphBuilder}, under the control of the {GraphAPI}.
-  module AdjacencyGraphBuilder
-
-    # Defines a useful `push` -> `add` alias for arrays.
-    class ArrayWithAdd < Array 
-      alias add push
-    end
-
-    # This method is called by the specialized implementations
-    # upon graph creation.
-    #
-    # Initialization parameters can include:
-    #
-    # * an array of edges to add
-    # * one or several graphs to copy (will be merged if multiple)
-    # * `:parallel_edges` denotes that duplicate edges are allowed
-    # * `:loops denotes` that loops are allowed
-    #
-    # @param *params [Hash] the initialization parameters
-    def implementation_initialize(*params)
-      @vertex_dict = Hash.new    
-      clear_all_labels
-
-      # FIXME: could definitely make use of the activesupport helper
-      # extract_options! and facets' reverse_merge! technique
-      # to handle parameters
-      args = (params.pop if params.last.is_a? Hash) || {}
-
-      # Basic configuration of adjacency.
-      @allow_loops    = args[:loops]          || false
-      @parallel_edges = args[:parallel_edges] || false
-      @edgelist_class = @parallel_edges ? ArrayWithAdd : Set
-      if @parallel_edges
-        @edge_number      = Hash.new
-        @next_edge_number = 0 
-      end
-
-      # Copy any given graph into this graph.
-      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)
-        end
-        g.vertices.each do |v|
-          add_vertex!(v)
-          vertex_label_set(v, vertex_label(v)) if vertex_label(v)
-        end  
-      end
-
-      # Add all array edges specified.
-      params.select { |p| p.is_a? Array }.each do |a|
-        0.step(a.size-1, 2) { |i| add_edge!(a[i], a[i+1]) }
-      end
-    end
-
-    # Returns true if v is a vertex of this Graph
-    # (an "O(1)" implementation of `vertex?`).
-    #
-    # @param [vertex] v
-    # @return [Boolean]
-    def vertex?(v)
-      @vertex_dict.has_key?(v)
-    end
-
-    # Returns true if [u,v] or u is an {Arc}
-    # (an "O(1)" implementation of `edge?`).
-    #
-    # @param [vertex] u
-    # @param [vertex] v (nil)
-    # @return [Boolean]
-    def edge?(u, v = nil)
-      u, v = u.source, u.target if u.is_a? Plexus::Arc
-      vertex?(u) and @vertex_dict[u].include?(v)
-    end
-
-    # Adds a vertex to the graph with an optional label.
-    #
-    # @param [vertex(Object)] vertex any kind of Object can act as a vertex
-    # @param [#to_s] label (nil)
-    def add_vertex!(vertex, label = nil)
-      @vertex_dict[vertex] ||= @edgelist_class.new
-      self[vertex] = label if label
-      self
-    end
-
-    # Adds an edge to the graph.
-    # 
-    # Can be called in two basic ways, label is optional:
-    # @overload add_edge!(arc)
-    #   Using an explicit {Arc}
-    #   @param [Arc] arc an {Arc}[source, target, label = nil] object
-    #   @return [AdjacencyGraph] `self`
-    # @overload add_edge!(source, target, label = nil)
-    #   Using vertices to define an arc implicitly
-    #   @param [vertex] u
-    #   @param [vertex] v (nil)
-    #   @param [Label] l (nil)
-    #   @param [Integer] n (nil) {Arc arc} number of `(u, v)` (if `nil` and if `u`
-    #     has an {ArcNumber}, then it will be used)
-    #   @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? Plexus::Arc
-
-      return self if not @allow_loops and u == v
-
-      n = (@next_edge_number += 1) unless n if @parallel_edges
-      add_vertex!(u)
-      add_vertex!(v)
-      @vertex_dict[u].add(v)
-      (@edge_number[u] ||= @edgelist_class.new).add(n) if @parallel_edges
-
-      unless directed?
-        @vertex_dict[v].add(u)
-        (@edge_number[v] ||= @edgelist_class.new).add(n) if @parallel_edges
-      end
-
-      self[n ? edge_class[u,v,n] : edge_class[u,v]] = l if l
-      self
-    end
-
-    # Removes a given vertex from the graph.
-    #
-    # @param [vertex] v
-    # @return [AdjacencyGraph] `self`
-    def remove_vertex!(v)
-      # FIXME This is broken for multi graphs 
-      @vertex_dict.delete(v)
-      @vertex_dict.each_value { |adjList| adjList.delete(v) }
-      @vertex_dict.keys.each do |u| 
-        delete_label(edge_class[u,v]) 
-        delete_label(edge_class[v,u])
-      end
-      delete_label(v) 
-      self
-    end
-
-    # Removes an edge from the graph.
-    #
-    # Can be called with both source and target as vertex,
-    # or with source and object of {Plexus::Arc} derivation.
-    #
-    # @overload remove_edge!(a)
-    #   @param [Plexus::Arc] a
-    #   @return [AdjacencyGraph] `self`
-    #   @raise [ArgumentError] if parallel edges are enabled
-    # @overload remove_edge!(u, v)
-    #   @param [vertex] u
-    #   @param [vertex] v
-    #   @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? Plexus::Arc
-        raise ArgumentError if @parallel_edges
-        u = edge_class[u,v]
-      end
-      raise ArgumentError if @parallel_edges and (u.number || 0) == 0
-      return self unless @vertex_dict[u.source] # It doesn't exist
-      delete_label(u) # Get rid of label
-      if @parallel_edges
-        index = @edge_number[u.source].index(u.number)
-        raise NoArcError unless index
-        @vertex_dict[u.source].delete_at(index)
-        @edge_number[u.source].delete_at(index) 
-      else
-        @vertex_dict[u.source].delete(u.target) 
-      end
-      self
-    end
-
-    # Returns an array of vertices that the graph has.
-    #
-    # @return [Array] graph's vertices
-    def vertices
-      @vertex_dict.keys
-    end
-
-    # Returns an array of edges, most likely of class {Arc} or {Edge} depending 
-    # upon the type of graph.
-    #
-    # @return [Array]
-    def edges
-      @vertex_dict.keys.inject(Set.new) do |a,v|
-        if @parallel_edges and @edge_number[v]
-          @vertex_dict[v].zip(@edge_number[v]).each do |w|
-            s, t, n = v, w[0], w[1]
-            a.add(edge_class[s, t, n, edge_label(s, t, n)])
-          end
-        else
-          @vertex_dict[v].each do |w|
-            a.add(edge_class[v, w, edge_label(v, w)])
-          end
-        end
-        a
-      end.to_a
-    end
-
-    # FIXME, EFFED UP (but why?)
-    #
-    # @fixme
-    def adjacent(x, options = {})
-      options[:direction] ||= :out
-      if !x.is_a?(Plexus::Arc) and (options[:direction] == :out || !directed?)
-        if options[:type] == :edges
-          i = -1
-          @parallel_edges ?
-            @vertex_dict[x].map { |v| e = edge_class[x, v, @edge_number[x][i+=1]]; e.label = self[e]; e } :
-            @vertex_dict[x].map { |v| e = edge_class[x, v];  e.label = self[e]; e }
-        else
-          @vertex_dict[x].to_a
-        end
-      else
-        graph_adjacent(x,options)
-      end
-    end
-
-  end # Adjacency Graph
-end # Plexus