philiprehberger-dependency_graph 0.3.0 → 0.5.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2fc52e7f3c4c62be66dc6d19901b9d82c953fa8c5ea32f22b3cdada283c02fd5
-  data.tar.gz: d334350bfb017e0172ec0145718904875c94fd1568e6114f3a113b8f1a124ae1
+  metadata.gz: b91c3f882d45402ff3d62528249734aaa0ff45b1f56051cf3775a9b765538ba3
+  data.tar.gz: 7533cce9223239659948ad073b5c2f5e9b358c53b8c3d44d80760efb274f3335
 SHA512:
-  metadata.gz: bf8205242047d62b202affb156583a13d89cdeb3db6d59fb7c4eeec1d9fb0b06ea23ffe5da925f37d97dafe0fb1b1cec628deba7bd24b33ac975e049add9758a
-  data.tar.gz: 5116b0ec4782836b7b74b0f7135b842af9774b2108a9820212f0a73466840769f623688b5384084ca78597fd5299aa4ebb9b9a1dfdf3d4be5c7b5cd5b2c1a11d
+  metadata.gz: 561ce49d415c0c222b6813489a5f8e454690431a37447ee333ee83ebca3e8a90f662a9fcec2dc17faa3bbfb6a3bfb64aac4a50c9cb3e83e843bb5af9aee7d2cd
+  data.tar.gz: ebfb34c46ab091ff1f998100ac8141719c0bcc2e8b261db9e4d5ba375747f3fa7511ed4261eb52e0ed3d972b9d84df32c4b0f9a99c6ba9174334b72066102db6

data/CHANGELOG.md

@@ -7,6 +7,20 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.5.0] - 2026-05-01
+
+### Added
+- `Graph#in_degree(item)` — count of direct dependents (how many items depend on this one)
+- `Graph#out_degree(item)` — count of direct dependencies for an item
+
+## [0.4.0] - 2026-04-21
+
+### Added
+- `Graph#to_dot` — Graphviz DOT export for visualization
+
+### Fixed
+- `bug_report.yml` — require Ruby version; add Gem version input per guide
+
 ## [0.3.0] - 2026-04-09
 
 ### Added

data/README.md

@@ -77,6 +77,9 @@ graph.add(:d, depends_on: [:b, :c])
 graph.dependencies_of(:d)      # => [:b, :c]
 graph.all_dependencies_of(:d)  # => [:b, :c, :a]
 graph.dependents_of(:b)        # => [:c, :d]
+
+graph.out_degree(:d)           # => 2
+graph.in_degree(:b)            # => 2
 ```
 
 ### Path Finding
@@ -110,6 +113,23 @@ graph.add(:a).add(:b, depends_on: [:a]).add(:c, depends_on: [:b])
 graph.resolve  # => [:a, :b, :c]
 ```
 
+### Graphviz Export
+
+```ruby
+graph = Philiprehberger::DependencyGraph.new
+graph.add(:a)
+graph.add(:b, depends_on: [:a])
+graph.add(:c, depends_on: [:b])
+
+puts graph.to_dot
+# digraph dependencies {
+#   "b" -> "a";
+#   "c" -> "b";
+# }
+
+graph.to_dot(name: 'MyDeps')  # Customize the digraph name
+```
+
 ## API
 
 | Method | Description |
@@ -123,6 +143,8 @@ graph.resolve  # => [:a, :b, :c]
 | `Graph#dependencies_of(item)` | Direct dependencies of an item |
 | `Graph#all_dependencies_of(item)` | All transitive dependencies |
 | `Graph#dependents_of(item)` | Items that directly depend on an item |
+| `Graph#in_degree(item)` | Count of direct dependents for an item |
+| `Graph#out_degree(item)` | Count of direct dependencies for an item |
 | `Graph#path(from, to)` | Shortest dependency path (BFS), or nil |
 | `Graph#subgraph(*items)` | Extract a new graph with specified nodes |
 | `Graph#roots` | Nodes with no dependencies |
@@ -131,6 +153,7 @@ graph.resolve  # => [:a, :b, :c]
 | `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 |
+| `#to_dot(name:)` | Graphviz DOT representation |
 
 ## Development
 

data/lib/philiprehberger/dependency_graph/graph.rb

@@ -146,6 +146,28 @@ module Philiprehberger
         end
       end
 
+      # Number of direct dependencies for an item.
+      #
+      # Returns 0 for unknown items, matching the defensive behavior of
+      # {#dependencies_of}.
+      #
+      # @param item [Object] the item to query
+      # @return [Integer] count of direct dependencies
+      def out_degree(item)
+        (@nodes[item] || []).size
+      end
+
+      # Number of direct dependents for an item (how many items depend on it).
+      #
+      # Returns 0 for unknown items, matching the defensive behavior of
+      # {#dependents_of}.
+      #
+      # @param item [Object] the item to query
+      # @return [Integer] count of direct dependents
+      def in_degree(item)
+        @nodes.count { |_node, deps| deps.include?(item) }
+      end
+
       # Find shortest dependency path between two nodes using BFS
       #
       # @param from [Object] the starting node
@@ -298,18 +320,33 @@ module Philiprehberger
           !all_dependencies_of(node_b).include?(node_a)
       end
 
-      # Export the graph in Graphviz DOT format
+      # 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)};" }
+      # Nodes are emitted in alphabetical order (cast to string for sort key),
+      # and edges within a node are sorted alphabetically for deterministic
+      # output. Nodes that participate in at least one edge (incoming or
+      # outgoing) are emitted implicitly via the edge lines; truly isolated
+      # nodes are declared explicitly so they still appear in the rendered
+      # graph. Works on graphs containing cycles.
+      #
+      # @param name [String] the digraph name used in the `digraph` header
+      # @return [String] Graphviz DOT source, terminated by a newline
+      def to_dot(name: 'dependencies')
+        output = "digraph #{name} {\n"
+        depended_on = @nodes.each_with_object({}) do |(_node, deps), acc|
+          deps.each { |dep| acc[dep] = true }
+        end
+        sorted_nodes = @nodes.keys.sort_by(&:to_s)
+        sorted_nodes.each do |node|
+          deps = (@nodes[node] || []).sort_by(&:to_s)
+          if deps.empty?
+            output << "  #{dot_quote(node)};\n" unless depended_on[node]
+          else
+            deps.each { |dep| output << "  #{dot_quote(node)} -> #{dot_quote(dep)};\n" }
+          end
         end
-        lines << '}'
-        lines.join("\n")
+        output << "}\n"
+        output
       end
 
       # Calculate maximum dependency depth for a node (longest path from any root to this node)

data/lib/philiprehberger/dependency_graph/version.rb

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

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-dependency_graph
 version: !ruby/object:Gem::Version
-  version: 0.3.0
+  version: 0.5.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-09 00:00:00.000000000 Z
+date: 2026-05-02 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