philiprehberger-dependency_graph 0.2.0 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: a9091598b68332edaee82a0a8a55bd23d3d00278c78466b88ac86b0e25651390
-  data.tar.gz: '0889cc1cdd1d277dc63b4c08228b6e091bacccbcb3670833d5015c4aec02cba9'
+  metadata.gz: 2fc52e7f3c4c62be66dc6d19901b9d82c953fa8c5ea32f22b3cdada283c02fd5
+  data.tar.gz: d334350bfb017e0172ec0145718904875c94fd1568e6114f3a113b8f1a124ae1
 SHA512:
-  metadata.gz: c9ecc7105f38fe9d6dcb1a63e2456d91883f26bb114b2097ea2bada656f80dfd77065c5143dadf579a9f29b07b069fc3c2fb98d39ddca7be71c65c1537275d9c
-  data.tar.gz: 37f0dc97583b44d80f9c046dd68375fc2749ac14f360905b0de8c64e3f630645814471d012f053434b91318ec9ab77ea9f6af0b3cb839846ed760bbc31d1ef1b
+  metadata.gz: bf8205242047d62b202affb156583a13d89cdeb3db6d59fb7c4eeec1d9fb0b06ea23ffe5da925f37d97dafe0fb1b1cec628deba7bd24b33ac975e049add9758a
+  data.tar.gz: 5116b0ec4782836b7b74b0f7135b842af9774b2108a9820212f0a73466840769f623688b5384084ca78597fd5299aa4ebb9b9a1dfdf3d4be5c7b5cd5b2c1a11d

data/CHANGELOG.md

@@ -7,6 +7,13 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.3.0] - 2026-04-09
+
+### Added
+- `Graph#reverse` — return a new graph with all edges flipped (useful for dependent analysis)
+- `Graph#all_dependents_of(item)` — transitive closure of items depending on a node
+- `Graph#independent?(a, b)` — check whether two nodes are mutually unreachable
+
 ## [0.2.0] - 2026-04-03
 
 ### Added

data/README.md

@@ -128,6 +128,9 @@ graph.resolve  # => [:a, :b, :c]
 | `Graph#roots` | Nodes with no dependencies |
 | `Graph#leaves` | Nodes with no dependents |
 | `Graph#depth(item)` | Maximum dependency depth of a node |
+| `Graph#reverse` | Return a new graph with all edges flipped |
+| `Graph#all_dependents_of(item)` | All transitive dependents of a node |
+| `Graph#independent?(a, b)` | Whether two nodes are mutually unreachable |
 
 ## Development
 

data/lib/philiprehberger/dependency_graph/graph.rb

@@ -208,6 +208,110 @@ module Philiprehberger
         @nodes.keys.reject { |node| depended_on.include?(node) }
       end
 
+      # Merge another graph into this one, combining nodes and dependencies
+      #
+      # @param other [Graph] another graph to merge
+      # @return [self]
+      def merge(other)
+        raise Error, 'Can only merge Graph instances' unless other.is_a?(self.class)
+
+        other.nodes.each do |node, deps|
+          @nodes[node] ||= []
+          deps.each do |dep|
+            @nodes[node] << dep unless @nodes[node].include?(dep)
+          end
+        end
+        self
+      end
+
+      # Remove a node and all edges referencing it
+      #
+      # @param item [Object] the item to remove
+      # @return [Boolean] true if the node existed, false otherwise
+      def remove(item)
+        return false unless @nodes.key?(item)
+
+        @nodes.delete(item)
+        @nodes.each_value { |deps| deps.delete(item) }
+        true
+      end
+
+      # Total number of nodes in the graph
+      #
+      # @return [Integer]
+      def size
+        @nodes.size
+      end
+
+      # Whether the graph has no nodes
+      #
+      # @return [Boolean]
+      def empty?
+        @nodes.empty?
+      end
+
+      # Return a new graph with all edges reversed (dependents become dependencies)
+      #
+      # @return [Graph] a new graph where each edge direction is flipped
+      def reverse
+        new_graph = self.class.new
+        @nodes.each_key { |node| new_graph.instance_variable_get(:@nodes)[node] ||= [] }
+        @nodes.each do |node, deps|
+          deps.each { |dep| new_graph.add(dep, depends_on: [node]) }
+        end
+        new_graph
+      end
+
+      # Return all transitive dependents of an item (direct + indirect)
+      #
+      # @param item [Object] the item to query
+      # @return [Array] all items that depend on this item, directly or transitively
+      def all_dependents_of(item)
+        return [] unless @nodes.key?(item)
+
+        visited = {}
+        queue = dependents_of(item)
+        result = []
+
+        until queue.empty?
+          dep = queue.shift
+          next if visited[dep]
+
+          visited[dep] = true
+          result << dep
+          queue.concat(dependents_of(dep))
+        end
+
+        result
+      end
+
+      # Check whether two nodes are independent (neither depends on the other transitively)
+      #
+      # @param node_a [Object]
+      # @param node_b [Object]
+      # @return [Boolean] true if neither node is reachable from the other
+      def independent?(node_a, node_b)
+        return false if node_a == node_b
+        return false unless @nodes.key?(node_a) && @nodes.key?(node_b)
+
+        !all_dependencies_of(node_a).include?(node_b) &&
+          !all_dependencies_of(node_b).include?(node_a)
+      end
+
+      # Export the graph in Graphviz DOT format
+      #
+      # @param name [String] the digraph name
+      # @return [String] DOT source
+      def to_dot(name: 'G')
+        lines = ["digraph #{name} {"]
+        @nodes.each_key { |node| lines << "  #{dot_quote(node)};" }
+        @nodes.each do |node, deps|
+          deps.each { |dep| lines << "  #{dot_quote(node)} -> #{dot_quote(dep)};" }
+        end
+        lines << '}'
+        lines.join("\n")
+      end
+
       # Calculate maximum dependency depth for a node (longest path from any root to this node)
       #
       # @param item [Object] the item to query
@@ -221,6 +325,10 @@ module Philiprehberger
 
       private
 
+      def dot_quote(node)
+        %("#{node.to_s.gsub('"', '\"')}")
+      end
+
       def build_path(visited, from, to)
         path = [to]
         current = to

data/lib/philiprehberger/dependency_graph/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module DependencyGraph
-    VERSION = '0.2.0'
+    VERSION = '0.3.0'
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-dependency_graph
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.3.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-04 00:00:00.000000000 Z
+date: 2026-04-09 00:00:00.000000000 Z
 dependencies: []
 description: Build and resolve dependency graphs using topological sort, detect cycles,
   generate parallel execution batches, query dependencies and dependents, find shortest