build-dependency 1.5.1 → 1.6.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f3c41145e9e5f1251cf1cfb7107861ecf2c40ef3feca4331d24d44076f2f63db
-  data.tar.gz: e594691242223f8098dbe3963d0dbc66e483e411b8cc1ec6d91c580a9010e90c
+  metadata.gz: 22b38e2f183e26fb4db1cfc6e53c91c2cc3fd5efd026b3eb8dd62f225d309bdf
+  data.tar.gz: 2594cc69f37835c318a69e058de3b5875be3485f8edd47ba86713c8e316e4ce0
 SHA512:
-  metadata.gz: dbe10b950321cd725ae6324071042d319c7b212780db0c93e7cc48da4fa5514dc116c88748718bb2691bee9b005ca6f688f11e9364fa80b30e04d02287c5e110
-  data.tar.gz: f7db4f8757f8b8f98aff76a6d9f7f43ec765d84f8965b178763c7628c403d34dae8c27713f47d083cbb3707322f039d113aff504f8576e95e96e178a96be7715
+  metadata.gz: ca056c3755bde6ba73c490ea7af08e600c51068220d71fe84ace34d430a4ff996b922c25942cc3eb27809f1fe366c78d9ca2e8685d10407546674ab4ac7e7f86
+  data.tar.gz: 851a466463008e0e27abe6b576d3e0f9cf0bbe2c33ad5f46a6eb186f73c2cb0131f46b2063dd0fab4725d8f49208538946be712004d419c2f5e7fbbd440a7aec

data/lib/build/dependency/chain.rb

@@ -1,29 +1,15 @@
-# Copyright, 2017, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
-require_relative 'resolver'
+# Released under the MIT License.
+# Copyright, 2017-2026, by Samuel Williams.
 
-require 'set'
+require_relative "resolver"
+
+require "set"
 
 module Build
 	module Dependency
+		# A chain of dependencies that are resolved from a set of providers.
 		class Chain < Resolver
 			# An `UnresolvedDependencyError` will be thrown if there are any unresolved dependencies.
 			def self.expand(*args)
@@ -38,6 +24,10 @@ module Build
 				return chain
 			end
 			
+			# Initialize a dependency chain.
+			# @parameter dependencies [Array<String, Depends>] The dependencies to resolve.
+			# @parameter providers [Array<Provider>] The providers to use for resolution.
+			# @parameter selection [Array<String>] Explicitly selected dependencies for resolving ambiguity.
 			def initialize(dependencies, providers, selection = [])
 				super()
 				
@@ -57,8 +47,9 @@ module Build
 			# @attr [Array] The available providers which will be used to satisfy he required dependencies.
 			attr :providers
 			
+			# Freeze the chain and all its dependencies.
 			def freeze
-				return unless frozen?
+				return self if frozen?
 				
 				@selection.freeze
 				@dependencies.freeze

data/lib/build/dependency/partial_chain.rb

@@ -1,33 +1,22 @@
-# Copyright, 2017, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
-require_relative 'chain'
+# Released under the MIT License.
+# Copyright, 2017-2026, by Samuel Williams.
+
+require_relative "chain"
 
 module Build
 	module Dependency
 		class Chain
+			# Create a partial chain for a specific provider.
+			# @parameter provider [Provider] The provider to create a partial chain for.
+			# @returns [PartialChain] A partial chain containing only the provider's dependencies.
 			def partial(provider)
 				PartialChain.expand(self, provider.dependencies)
 			end
 		end
 		
+		# A partial dependency chain that resolves only a subset of dependencies.
 		class PartialChain < Resolver
 			# An `UnresolvedDependencyError` will be thrown if there are any unresolved dependencies.
 			def self.expand(*args)
@@ -38,6 +27,9 @@ module Build
 				return chain
 			end
 			
+			# Initialize a partial chain.
+			# @parameter chain [Chain] The parent chain to use for resolution.
+			# @parameter dependencies [Array<Depends>] The dependencies to resolve.
 			def initialize(chain, dependencies)
 				super()
 				
@@ -48,6 +40,8 @@ module Build
 				expand_top
 			end
 			
+			# Get the selection from the parent chain.
+			# @returns [Set<String>] The explicitly selected dependencies.
 			def selection
 				@chain.selection
 			end
@@ -55,12 +49,15 @@ module Build
 			# @attr [Array<Depends>] The list of dependencies that needs to be satisfied.
 			attr :dependencies
 			
+			# Get the providers from the parent chain.
+			# @returns [Array<Provider>] The available providers.
 			def providers
 				@chain.providers
 			end
 			
+			# Freeze the partial chain.
 			def freeze
-				return unless frozen?
+				return self if frozen?
 				
 				@chain.freeze
 				@dependencies.freeze

data/lib/build/dependency/provider.rb

@@ -1,27 +1,14 @@
-# Copyright, 2017, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
-require_relative 'set'
+# Released under the MIT License.
+# Copyright, 2017-2026, by Samuel Williams.
+
+require_relative "set"
 
 module Build
 	module Dependency
+		# Include the Provider module when Build::Dependency is included in a class.
+		# @parameter klass [Class] The class that is including Build::Dependency.
 		def self.included(klass)
 			klass.include(Provider)
 		end
@@ -79,7 +66,7 @@ module Build
 			end
 			
 			def wildcard?
-				self.name.is_a?(String) and self.name.include?('*')
+				self.name.is_a?(String) and self.name.include?("*")
 			end
 			
 			def match?(name)
@@ -119,9 +106,11 @@ module Build
 			end
 		end
 		
+		# A provider that can satisfy dependencies by providing named provisions.
 		module Provider
+			# Freeze the provider and all its provisions and dependencies.
 			def freeze
-				return unless frozen?
+				return self if frozen?
 				
 				provisions.freeze
 				dependencies.freeze
@@ -139,16 +128,19 @@ module Build
 				@priority ||= 0
 			end
 			
-			# @return Hash<String, Provision> a table of named provisions.
+			# @returns Hash<String, Provision> a table of named provisions.
 			def provisions
 				@provisions ||= {}
 			end
 			
-			# @return [IdentitySet<Dependency>]
+			# @returns [IdentitySet<Dependency>]
 			def dependencies
 				@dependencies ||= Set.new
 			end
 			
+			# Filter provisions that match a given dependency.
+			# @parameter dependency [Depends] The dependency to match against.
+			# @returns [Hash<String, Provision>] Provisions that match the dependency.
 			def filter(dependency)
 				provisions.select{|name, provision| dependency.match?(name)}
 			end
@@ -158,17 +150,23 @@ module Build
 				provisions.key?(dependency.name)
 			end
 			
+			# Get the provision for a given dependency.
+			# @parameter dependency [Depends] The dependency to get the provision for.
+			# @returns [Provision, nil] The provision, or nil if not found.
 			def provision_for(dependency)
 				return provisions[dependency.name]
 			end
 			
+			# Get a resolution for a given dependency.
+			# @parameter dependency [Depends] The dependency to get the resolution for.
+			# @returns [Resolution] The resolution combining the provision and dependency.
 			def resolution_for(dependency)
 				return Resolution.new(provision_for(dependency), dependency)
 			end
 			
 			# Add one or more provisions to the provider.
-			# @param [Array<String>] names the named provisions to add.
-			# @param [Hash<Symbol, Array>] aliases the aliases to add.
+			# @parameter names [Array<String>] the named provisions to add.
+			# @parameter aliases [Hash<Symbol, Array>] the aliases to add.
 			# @example A named provision.
 			# 	target.provides "Compiler/clang" do
 			# 		cxx "clang"
@@ -186,7 +184,7 @@ module Build
 			end
 			
 			# Add one or more dependencies to the provider.
-			# @param [Array<String>] names the dependency names to add.
+			# @parameter names [Array<String>] the dependency names to add.
 			# @example A named dependency.
 			# 	target.depends "Compiler/clang"
 			# @example A symbolic dependency.
@@ -197,6 +195,9 @@ module Build
 				end
 			end
 			
+			# Check if this provider depends on a given name.
+			# @parameter name [String] The name to check.
+			# @returns [Boolean] True if this provider depends on the given name.
 			def depends?(name)
 				dependencies.include?(name)
 			end

data/lib/build/dependency/resolver.rb

@@ -1,28 +1,16 @@
-# Copyright, 2017, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
-require 'set'
+# Released under the MIT License.
+# Copyright, 2017-2026, by Samuel Williams.
+
+require "set"
 
 module Build
 	module Dependency
+		# An error raised when dependencies cannot be resolved.
 		class UnresolvedDependencyError < StandardError
+			# Initialize the error with the unresolved chain.
+			# @parameter chain [Chain] The chain with unresolved dependencies.
 			def initialize(chain)
 				super "Unresolved dependency chain: #{chain.unresolved.inspect}!"
 				
@@ -34,7 +22,9 @@ module Build
 		
 		TOP = Depends.new("<top>").freeze
 		
+		# Base class for resolving dependencies.
 		class Resolver
+			# Initialize an empty resolver.
 			def initialize
 				@resolved = {}
 				@ordered = []
@@ -49,8 +39,9 @@ module Build
 			attr :unresolved
 			attr :conflicts
 			
+			# Freeze the resolver and all its internal state.
 			def freeze
-				return unless frozen?
+				return self if frozen?
 				
 				@resolved.freeze
 				@ordered.freeze

data/lib/build/dependency/set.rb

@@ -1,24 +1,9 @@
-# Copyright, 2015, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
-require 'forwardable'
+# Released under the MIT License.
+# Copyright, 2019-2026, by Samuel Williams.
+
+require "forwardable"
 
 module Build
 	module Dependency
@@ -26,6 +11,8 @@ module Build
 		class Set
 			include Enumerable
 			
+			# Initialize a new set with optional initial contents.
+			# @parameter contents [Array] Initial objects to add to the set.
 			def initialize(contents = [])
 				@table = {}
 				
@@ -40,6 +27,7 @@ module Build
 			
 			def_delegators :@table, :size, :empty?, :clear, :count, :[], :to_s, :inspect
 			
+			# Freeze the set.
 			def freeze
 				return self if frozen?
 				
@@ -48,14 +36,22 @@ module Build
 				super
 			end
 			
+			# Initialize a duplicate of another set.
+			# @parameter other [Set] The set to duplicate.
 			def initialize_dup(other)
 				@table = other.table.dup
 			end
 			
+			# Get the identity of an object for use as a hash key.
+			# @parameter object [Object] The object to get the identity for.
+			# @returns [String] The object's name.
 			def identity(object)
 				object.name
 			end
 			
+			# Add an object to the set.
+			# @parameter object [Object] The object to add.
+			# @raises [KeyError] If an object with the same identity already exists.
 			def add(object)
 				if include?(object)
 					raise KeyError, "Object #{identity(object)} already exists!"
@@ -66,18 +62,29 @@ module Build
 			
 			alias << add
 			
+			# Delete an object from the set.
+			# @parameter object [Object] The object to delete.
+			# @returns [Object, nil] The deleted object, or nil if not found.
 			def delete(object)
 				@table.delete(identity(object))
 			end
 			
+			# Check if the set includes an object.
+			# @parameter object [Object] The object to check for.
+			# @returns [Boolean] True if the set includes the object.
 			def include?(object)
 				@table.include?(identity(object))
 			end
 			
+			# Iterate over each object in the set.
+			# @yields [Object] Each object in the set.
 			def each(&block)
 				@table.each_value(&block)
 			end
 			
+			# Get a subset of objects by their names.
+			# @parameter names [Array<String>] The names of objects to retrieve.
+			# @returns [Array<Object>] The objects with the given names.
 			def slice(names)
 				names.collect{|name| @table[name]}
 			end

data/lib/build/dependency/version.rb

@@ -1,25 +1,12 @@
-# Copyright, 2017, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
+# Released under the MIT License.
+# Copyright, 2017-2026, by Samuel Williams.
+
+# @namespace
 module Build
+	# @namespace
 	module Dependency
-		VERSION = "1.5.1"
+		VERSION = "1.6.0"
 	end
 end

data/lib/build/dependency/visualization.rb

@@ -1,158 +1,94 @@
-# Copyright, 20127, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
+# frozen_string_literal: true
 
-require 'graphviz'
+# Released under the MIT License.
+# Copyright, 2017-2026, by Samuel Williams.
 
 module Build
 	module Dependency
+		# Generates Mermaid flowchart visualizations of dependency chains.
 		class Visualization
-			def initialize
-				@base_attributes = {
-					:shape => 'box',
-					:style => 'filled',
-					:fillcolor => 'white',
-					:fontname => 'Monaco',
-				}
-				
-				@provision_attributes = @base_attributes.dup
-				
-				@alias_attributes = @base_attributes.merge(
-					:fillcolor => 'lightgrey',
-				)
-				
-				@dependency_attributes = @base_attributes.merge(
-					:fillcolor => 'orange',
-				)
-				
-				@selection_attributes = {
-					:fillcolor => 'lightbrown',
-				}
-				
-				@private_edge_attributes = {
-					:arrowhead => 'empty',
-					:color => '#0000005f'
-				}
-				
-				@provider_attributes = {
-					:fillcolor => 'lightblue',
-				}
-				
-				@provider_edge_attributes = {
-					:arrowhead => 'none',
-				}
+			# Convert a name to a valid Mermaid node ID.
+			# @parameter name [String] The name to sanitize.
+			# @returns [String] A sanitized identifier safe for use in Mermaid diagrams.
+			def sanitize_id(name)
+				# Convert name to a valid Mermaid node ID
+				name.to_s.gsub(/[^a-zA-Z0-9_]/, "_")
 			end
 			
-			attr :base_attributes
-			attr :provision_attributes
-			
-			attr :provider_attributes
-			attr :provider_edge_attributes
-			
-			attr :alias_attributes
-			
-			attr :dependency_attributes
-			attr :selection_attributes
-			attr :private_edge_attributes
-			
+			# Generate a Mermaid flowchart diagram for a dependency chain.
+			# @parameter chain [Chain] The dependency chain to visualize.
+			# @returns [String] A Mermaid flowchart diagram in text format.
 			def generate(chain)
-				graph = Graphviz::Graph.new
-				graph.attributes[:ratio] = :auto
+				lines = ["flowchart LR"]
 				
-				dependencies = dependencies_by_name(chain.dependencies)
+				# Track nodes and their styles
+				nodes = {}
+				providers = ::Set.new
+				provisions_in_chain = ::Set.new
+				
+				# Collect all provisions in the chain
+				chain.provisions.each do |provision|
+					provisions_in_chain.add(provision.name.to_s)
+				end
 				
+				# Build the graph
 				chain.ordered.each do |resolution|
 					provider = resolution.provider
-					name = provider.name
-					
-					# Provider is the dependency that provides the dependency referred to by name.
-					node = graph.add_node(name.to_s, @base_attributes.dup)
+					name = provider.name.to_s
+					node_id = sanitize_id(name)
 					
-					if dependencies.include?(resolution.dependency.name)
-						node.attributes.update(@dependency_attributes)
-					elsif chain.selection.include?(provider.name)
-						node.attributes.update(@selection_attributes)
-					end
+					# Track this node
+					nodes[name] = node_id
 					
 					# A provision has dependencies...
 					provider.dependencies.each do |dependency|
-						if dependency_node = graph.nodes[dependency.name.to_s]
-							edge = node.connect(dependency_node)
-							
-							if dependency.private?
-								edge.attributes.update(@private_edge_attributes)
-							end
+						dep_name = dependency.name.to_s
+						dep_id = sanitize_id(dep_name)
+						
+						nodes[dep_name] ||= dep_id
+						
+						# Create edge from provider to dependency
+						if dependency.private?
+							lines << "    #{node_id}[#{name}] -.-> #{dep_id}[#{dep_name}]"
+						else
+							lines << "    #{node_id}[#{name}] --> #{dep_id}[#{dep_name}]"
 						end
 					end
 					
 					# A provision provides other provisions...
 					provider.provisions.each do |provision_name, provision|
-						next if name == provision_name
+						next if name == provision_name.to_s
 						
-						provides_node = graph.nodes[provision_name.to_s] || graph.add_node(provision_name.to_s, @provision_attributes)
+						provision_str = provision_name.to_s
+						provision_id = sanitize_id(provision_str)
 						
-						if provision.alias?
-							provides_node.attributes = @alias_attributes
-						end
+						nodes[provision_str] ||= provision_id
 						
-						node.attributes.update(@provider_attributes)
+						# Mark this node as a provider
+						providers.add(name)
 						
-						unless provides_node.connected?(node)
-							edge = provides_node.connect(node)
-							
-							edge.attributes.update(@provider_edge_attributes)
-						end
+						# Create edge from provision to provider (undirected)
+						lines << "    #{provision_id}[#{provision_str}] --- #{node_id}[#{name}]"
 					end
 				end
 				
-				chain.provisions.each do |provision|
-					node = graph.nodes[provision.name.to_s]
-					
-					node.attributes.update(penwidth: 2.0)
+				# Add styling
+				lines << ""
+				lines << "    %% Styles"
+				
+				# Style providers with light blue
+				providers.each do |name|
+					lines << "    style #{sanitize_id(name)} fill:#add8e6"
 				end
 				
-				# Put all dependencies at the same level so as to not make the graph too confusingraph.
-				done = Set.new
-				chain.ordered.each do |resolution|
-					provider = resolution.provider
-					name = "subgraph-#{provider.name}"
-					
-					subgraph = graph.nodes[name] || graph.add_subgraph(name, :rank => :same)
-					
-					provider.dependencies.each do |dependency|
-						next if done.include? dependency
-						
-						done << dependency
-						
-						if dependency_node = graph.nodes[dependency.name.to_s]
-							subgraph.add_node(dependency_node.name)
-						end
+				# Highlight provisions in the chain with a thicker border
+				provisions_in_chain.each do |name|
+					if node_id = nodes[name]
+						lines << "    style #{node_id} stroke-width:3px"
 					end
 				end
 				
-				return graph
-			end
-			
-			private
-			
-			def dependencies_by_name(dependencies)
-				dependencies.map{|depends| [depends.name, depends]}.to_h
+				return lines.join("\n")
 			end
 		end
 	end