plexus 0.5.5 → 0.5.6

data/lib/plexus.rb

@@ -30,8 +30,6 @@ 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'
 

data/lib/plexus/adjacency_graph.rb

@@ -4,7 +4,7 @@ module Plexus
   # {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}.
+  # implementations rely on the {GraphBuilder}.
   module AdjacencyGraphBuilder
 
     # Defines a useful `push` -> `add` alias for arrays.

data/lib/plexus/ext.rb

@@ -28,7 +28,7 @@ class Object
   #
   #     class A; include Digraph; end
   #     a.singleton_class.ancestors
-  #     # => [Plexus::GraphAPI, Plexus::DirectedGraph::Algorithms, ...
+  #     # => [Plexus::DirectedGraph::Algorithms, ...
   #           Plexus::Labels, Enumerable, Object, Plexus, Kernel, BasicObject]
   #     a.is_a? Plexus::Graph
   #     # => true

data/lib/plexus/graph.rb

@@ -1,7 +1,6 @@
 module Plexus
-  # Using the methods required by the {GraphAPI}, it implements all the
-  # *basic* functions of a {Graph} using *only* functions
-  # requested in {GraphAPI}. The process is under the control of the pattern
+  # Using only a basic methods set, it implements all the *basic* functions
+  # of a graph. The process is under the control of the pattern
   # {AdjacencyGraphBuilder}, unless a specific implementation is specified
   # during initialization.
   #
@@ -49,7 +48,6 @@ module Plexus
         # These inclusions trigger some validations checks by the way.
         include(args[:implementation]       ? args[:implementation]       : Plexus::AdjacencyGraphBuilder)
         include(args[:algorithmic_category] ? args[:algorithmic_category] : Plexus::DigraphBuilder       )
-        include Plexus::GraphAPI
       end
 
       implementation_initialize(*params)

data/lib/plexus/undirected_graph/algorithms.rb

@@ -20,7 +20,7 @@ module Plexus
 
       def remove_edge!(u, v=nil)
         unless u.kind_of? Plexus::Arc
-          raise ArgumentError if @parallel_edges 
+          raise ArgumentError if @parallel_edges
           u = edge_class[u,v]
         end
         super(u.reverse) unless u.source == u.target
@@ -49,7 +49,7 @@ module Plexus
 
       def chromatic_number
         return triangulated_chromatic_number if triangulated?
-        raise NotImplementedError    
+        raise NotImplementedError
       end
 
       # An interval graph can have its vertices into one-to-one

data/lib/plexus/version.rb

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

metadata

@@ -2,7 +2,7 @@
 name: plexus
 version: !ruby/object:Gem::Version 
   prerelease: 
-  version: 0.5.5
+  version: 0.5.6
 platform: ruby
 authors: 
 - Bruce Williams
@@ -95,7 +95,6 @@ files:
 - lib/plexus/directed_graph.rb
 - lib/plexus/comparability.rb
 - lib/plexus/chinese_postman.rb
-- lib/plexus/graph_api.rb
 - lib/plexus/classes/graph_classes.rb
 - lib/plexus/strong_components.rb
 - lib/plexus/support/support.rb

data/lib/plexus/graph_api.rb

@@ -1,35 +0,0 @@
-module Plexus
-  # This module defines the minimum set of functions required to make a graph that can
-  # use the algorithms defined by this library.
-  #
-  # Each implementation module must implement the following routines:
-  #
-  #   * directed?                # Is the graph directed?
-  #   * add_vertex!(v,l=nil)     # Add a vertex to the graph and return the graph. `l` is an optional label.
-  #   * add_edge!(u,v=nil,l=nil) # Add an edge to the graph and return the graph. `u` can be an {Arc} or {Edge}, or `u,v` a {Edge} pair. The last parameter `l` is an optional label.
-  #   * remove_vertex!(v)        # Remove a vertex to the graph and return the graph.
-  #   * remove_edge!(u,v=nil)    # Remove an edge from the graph and return the graph.
-  #   * vertices                 # Returns an array of of all vertices.
-  #   * edges                    # Returns an array of all edges.
-  #   * edge_class               # Returns the class used to store edges.
-  module GraphAPI
-    # @raise if the API is not completely implemented
-    def self.included(klass)
-      @api_methods ||= [:directed?, :add_vertex!, :add_edge!, :remove_vertex!, :remove_edge!, :vertices, :edges, :edge_class]
-      ruby_18 { @api_methods.each { |m| m.to_s } }
-      
-      @api_methods.each do |meth| 
-        raise "Must implement #{meth}" unless klass.instance_methods.include?(meth)
-      end
-
-      klass.class_eval do
-        # Is this right?
-        alias remove_arc! remove_edge!
-        alias add_arc!    add_edge!
-        alias arcs        edges
-        alias arc_class   edge_class
-      end
-    end
-
-  end # GraphAPI
-end # Plexus