philiprehberger-dependency_graph 0.3.0 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2fc52e7f3c4c62be66dc6d19901b9d82c953fa8c5ea32f22b3cdada283c02fd5
-  data.tar.gz: d334350bfb017e0172ec0145718904875c94fd1568e6114f3a113b8f1a124ae1
+  metadata.gz: d893dfbce550ce9ba6022f2f647b4b70cf2306a972b52b93ed096d7bc9384c9c
+  data.tar.gz: 57ef5e2ddea71da6b58e15adeb0e1d1d38443b455d99c17aa14a795cfdf7a421
 SHA512:
-  metadata.gz: bf8205242047d62b202affb156583a13d89cdeb3db6d59fb7c4eeec1d9fb0b06ea23ffe5da925f37d97dafe0fb1b1cec628deba7bd24b33ac975e049add9758a
-  data.tar.gz: 5116b0ec4782836b7b74b0f7135b842af9774b2108a9820212f0a73466840769f623688b5384084ca78597fd5299aa4ebb9b9a1dfdf3d4be5c7b5cd5b2c1a11d
+  metadata.gz: a3096da9a20d0a487aec73c8f5fccd26483e4ef6d19e237f767892f8ef3c5f1a8ad670d859b137b3c10c7afb4e28a86467e9485f0d081fe4bc1ca2be706eb0af
+  data.tar.gz: 657e23b74e72698eefd35515b25ce8f3a8d508107384460fac9d9d608589018d6b11705f49fd2547fe5d879fe5f06e68a2361d28cf2009adb5c560c6a572fef2

data/CHANGELOG.md

@@ -7,6 +7,14 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [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

@@ -110,6 +110,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 |
@@ -131,6 +148,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

@@ -298,18 +298,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.4.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.4.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-09 00:00:00.000000000 Z
+date: 2026-04-21 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