tangle 0.8.2 → 0.11.0

data/.travis.yml

@@ -1,5 +0,0 @@
-sudo: false
-language: ruby
-rvm:
-  - 2.5.0
-before_install: gem install bundler -v 1.16.0

data/lib/tangle/graph.rb

@@ -1,81 +0,0 @@
-require 'tangle/mixin'
-require 'tangle/mixin/connectedness'
-require 'tangle/edge'
-require 'tangle/graph_vertices'
-require 'tangle/graph_edges'
-
-module Tangle
-  #
-  # Base class for all kinds of graphs
-  #
-  class Graph
-    include Tangle::GraphVertices
-    include Tangle::GraphEdges
-    include Tangle::Mixin::Initialize
-    Edge = Tangle::Edge
-    DEFAULT_MIXINS = Tangle::Mixin::Connectedness::MIXINS
-
-    # Initialize a new graph, preloading it with vertices and edges
-    #
-    # Graph[+vertices+] => Graph
-    # Graph[+vertices+, +edges+) => Graph
-    #
-    # When +vertices+ is a hash, it contains initialization kwargs as
-    # values and vertex names as keys. When +vertices+ is an array of
-    # initialization kwargs, the vertices will be be anonymous.
-    #
-    # +edges+ can contain an array of exactly two, either names of vertices
-    # or vertices.
-    #
-    # Any kwarg supported by Graph.new is also allowed.
-    #
-    def self.[](vertices, edges = {}, **kwargs)
-      graph = new(**kwargs)
-      vertices.each { |vertex| graph.add_vertex(vertex) }
-      edges.each { |from, to| graph.add_edge(from, to) }
-      graph
-    end
-
-    # Initialize a new graph, optionally preloading it with vertices and edges
-    #
-    # Graph.new() => Graph
-    # Graph.new(mixins: [MixinModule, ...], ...) => Graph
-    #
-    # +mixins+ is an array of modules that can be mixed into the various
-    # classes that makes up a graph. Initialization of a Graph, Vertex or Edge
-    # looks for submodules in each mixin, with the same name and extends
-    # any created object. Defaults to [Tangle::Mixin::Connectedness].
-    #
-    # Any subclass of Graph should also subclass Edge to manage its unique
-    # constraints.
-    #
-    def initialize(mixins: self.class::DEFAULT_MIXINS, **kwargs)
-      initialize_vertices
-      initialize_edges
-      initialize_mixins(mixins: mixins, **kwargs)
-    end
-
-    # Return a subgraph, optionally filtered by a vertex selector block
-    #
-    # subgraph => Graph
-    # subgraph { |vertex| ... } => Graph
-    #
-    # Unless a selector is provided, the subgraph contains the entire graph.
-    #
-    def subgraph(included = nil)
-      included ||= vertices
-      result = clone
-      vertices.each do |vertex|
-        result.remove_vertex(vertex) unless included.include?(vertex)
-        next unless block_given?
-        result.remove_vertex(vertex) unless yield(vertex)
-      end
-      result
-    end
-
-    def to_s
-      "#<#{self.class}: #{vertices.count} vertices, #{edges.count} edges>"
-    end
-    alias inspect to_s
-  end
-end

data/lib/tangle/graph_edges.rb

@@ -1,49 +0,0 @@
-require 'set'
-
-module Tangle
-  # Edge related methods in a graph
-  module GraphEdges
-    # Get all edges.
-    #
-    # edges => Array
-    #
-    def edges(vertex = nil)
-      return @edges if vertex.nil?
-      @vertices.fetch(vertex)
-    end
-
-    # Add a new edge to the graph
-    #
-    # add_edge(vtx1, vtx2, ...) => Edge
-    #
-    def add_edge(*vertices, **kvargs)
-      insert_edge(self.class::Edge.new(*vertices, mixins: @mixins, **kvargs))
-    end
-
-    # Remove an edge from the graph
-    def remove_edge(edge)
-      edge.each_vertex do |vertex|
-        @vertices.fetch(vertex).delete(edge)
-      end
-      @edges.delete(edge)
-    end
-
-    protected
-
-    # Insert a prepared edge into the graph
-    #
-    def insert_edge(edge)
-      @edges << edge
-      edge.each_vertex do |vertex|
-        @vertices.fetch(vertex) << edge
-      end
-      edge
-    end
-
-    private
-
-    def initialize_edges
-      @edges = Set[]
-    end
-  end
-end

data/lib/tangle/mixin/connectedness.rb

@@ -1,68 +0,0 @@
-module Tangle
-  module Mixin
-    #
-    # Mixins for adding connectedness features
-    #
-    module Connectedness
-      MIXINS = [Tangle::Mixin::Connectedness].freeze
-      #
-      # Mixin for adding connectedness to a graph
-      #
-      module Graph
-        # Two vertices are adjacent if there is an edge between them
-        def adjacent?(vertex, other)
-          edges(vertex).any? { |edge| edge[vertex] == other }
-        end
-
-        # Return the set of adjacent vertices
-        def adjacent(vertex)
-          Set.new(edges(vertex).map { |edge| edge.walk(vertex) })
-        end
-
-        # Get the largest connected subgraph for a vertex.
-        # Also aliased as :component and :connected_component
-        #
-        # connected_subgraph(vertex) => Graph
-        #
-        def connected_subgraph(vertex)
-          subgraph { |other| connected_vertices?(vertex, other) }
-        end
-        alias component connected_subgraph
-        alias connected_component connected_subgraph
-
-        # Get the largest subgraph that is not connected to a vertex, or what's
-        # left after removing the connected subgraph.
-        #
-        def disconnected_subgraph(vertex)
-          subgraph { |other| !connected_vertices?(vertex, other) }
-        end
-
-        # A graph is connected if all vertices are connected to all vertices
-        # An empty graph is disconnected.
-        #
-        def connected?(*tested_vertices)
-          tested_vertices = vertices if tested_vertices.empty?
-          return false if tested_vertices.empty?
-
-          tested_vertices.combination(2).all? do |pair|
-            this, that = pair.to_a
-            reachable(this).any? { |other| other == that }
-          end
-        end
-
-        # A graph is disconnected if any vertex is not connected to all other.
-        # An empty graph is disconnected.
-        #
-        def disconnected?(*tested_vertices)
-          !connected?(*tested_vertices)
-        end
-
-        # Return a breadth-first Enumerator for all reachable vertices,
-        # by transitive adjacency.
-        def reachable(start_vertex)
-          vertex_enumerator(start_vertex, :adjacent)
-        end
-      end
-    end
-  end
-end

data/lib/tangle/simple/graph.rb

@@ -1,17 +0,0 @@
-require 'tangle/graph'
-
-module Tangle
-  module Simple
-    #
-    # A simple graph, without loops and multiple edges
-    class Graph < Tangle::Graph
-      protected
-
-      def insert_edge(edge)
-        raise LoopError if edge.loop?
-        raise MultiEdgeError if adjacent?(*edge.each_vertex)
-        super
-      end
-    end
-  end
-end