tangle 0.2.1 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 745b0e3e2a81c5d3f7c79889774a90f0c6ec417cc9e1b55f9f716ad47a82a95e
-  data.tar.gz: b4a88c9eab9cfe842685510fae6a39fc48f39eda0a6e70c2325fa652b4a20039
+  metadata.gz: 68b534152678b108e1d5ad38d3947ac056fc1218a01f7bab10f73dcb0f6868bc
+  data.tar.gz: 9ebf86f0191780d2b49f69f8b3e2cf8a0b57ac9117ff7d5dff57a0bfd52fa346
 SHA512:
-  metadata.gz: 349814a3c91df5236c46aade369f5f1b5c6b90d3a555f91366986b465592492b00037f9b9e0ac39f8af2a369d78cf473d6582bfbdc9b79935280ac15c2969088
-  data.tar.gz: b8182efcff132d3202e291787db87418ed93982dac257d42f5f640187fe456fb6ab01c0ffd570157910dbdd1aae70a4d755286e218b1d0faf6c00fc3a342fe7e
+  metadata.gz: cdb0d5204e4e6fc4de0d1a54f92fb73d3808322b7478de49fb9c571998fb18c49f400cbff042c4bd38218d2c966a9e7ca5ac697b7120d26bd46193e157bca4a6
+  data.tar.gz: 2eacf5cfb13389a359566563d6d72fae9ee86d1d373030b8677f6674d38cdec2663b5d5dfbb66a75aac6018ea41539691c75fcbee93deb4cefe48bde7cf7b591

data/lib/tangle/graph.rb

@@ -1,3 +1,4 @@
+require 'tangle/mixin'
 require 'tangle/vertex'
 require 'tangle/edge'
 
@@ -8,6 +9,8 @@ module Tangle
   class Graph
     Edge = Tangle::Edge
 
+    include Tangle::Mixin::Connectedness::Graph
+
     # Initialize a new graph, optionally preloading it with vertices and edges
     #
     # Graph.new() => Graph

data/lib/tangle/mixin/connectedness.rb

@@ -0,0 +1,72 @@
+module Tangle
+  module Mixin
+    module Connectedness
+      #
+      # Mixin for adding connectedness to a graph
+      #
+      module Graph
+        # 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| vertex.connected?(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| !vertex.connected?(other) }
+        end
+
+        # A graph is connected if all vertices are connected to all vertices
+        # An empty graph is disconnected.
+        #
+        def connected?
+          return false if vertices.empty?
+
+          vertices.combination(2).all? do |pair|
+            this, that = pair.to_a
+            this.connected?(that)
+          end
+        end
+
+        # A graph is disconnected if any vertex is not connected to all other.
+        # An empty graph is disconnected.
+        #
+        def disconnected?
+          !connected?
+        end
+      end
+
+      #
+      # Mixin for adding connectedness to a vertex
+      #
+      module Vertex
+        # Two vertices are connected if there is a path between them,
+        # and a vertex is connected to itself.
+        #
+        def connected?(other)
+          raise GraphError unless @graph == other.graph
+          return true if self == other
+
+          connected_excluding?(other, Set[self])
+        end
+
+        protected
+
+        def connected_excluding?(other, history)
+          return true if adjacent?(other)
+
+          (neighbours - history).any? do |vertex|
+            vertex.connected_excluding?(other, history << self)
+          end
+        end
+      end
+    end
+  end
+end

data/lib/tangle/mixin.rb

@@ -0,0 +1 @@
+require 'tangle/mixin/connectedness'

data/lib/tangle/vertex.rb

@@ -1,5 +1,6 @@
 require 'delegate'
 require 'pp'
+require 'tangle/mixin'
 
 module Tangle
   #
@@ -7,6 +8,7 @@ module Tangle
   #
   class Vertex < SimpleDelegator
     include PP::ObjectMixin
+    include Tangle::Mixin::Connectedness::Vertex
 
     # Create a new vertex
     #
@@ -55,6 +57,12 @@ module Tangle
       @graph.edges { |edge| edge.include? self }
     end
 
+    # Return the set of adjacent vertices
+    #
+    def neighbours
+      Set.new(edges.map { |edge| edge.walk(self) })
+    end
+
     # If two vertices have the same vertex_id, they have the same value
     #
     def ==(other)
@@ -73,6 +81,13 @@ module Tangle
       @object_id == other.object_id
     end
 
+    # Two vertices are adjacent if there is an edge between them
+    #
+    def adjacent?(other)
+      raise GraphError unless @graph == other.graph
+      edges.any? { |edge| edge.walk(self) == other }
+    end
+
     attr_reader :graph
     attr_reader :name
     attr_reader :delegate

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: tangle
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.3.0
 platform: ruby
 authors:
 - Calle Englund
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-02-04 00:00:00.000000000 Z
+date: 2018-02-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: git-version-bump
@@ -102,6 +102,8 @@ files:
 - lib/tangle/edge.rb
 - lib/tangle/errors.rb
 - lib/tangle/graph.rb
+- lib/tangle/mixin.rb
+- lib/tangle/mixin/connectedness.rb
 - lib/tangle/simple/edge.rb
 - lib/tangle/simple/graph.rb
 - lib/tangle/version.rb