feat: Include desc in dependency graphs

Author: kspurgin

lib/kiba/extend/registry/ancestorable.rb

@@ -8,18 +8,14 @@ module Registry
       # Mixin module for getting Node and Edge properties from RegisteredSource
       #   and RegisteredLookup objects
       module Ancestorable
+        include NodeLabelable
+
         def node
           Diagrams::Elements::Node.new(id: node_id, label: node_label)
         end
 
         def node_id = key.to_s
 
-        def node_label
-          return node_id unless supplied
-
-          "#{node_id} (supplied)"
-        end
-
         def edge
           Diagrams::Elements::Edge.new(
             source_id: edge_source_id,

lib/kiba/extend/registry/node_labelable.rb

@@ -0,0 +1,17 @@
+# frozen_string_literal: true
+
+module Kiba
+  module Extend
+    module Registry
+      # Mixin module for generating Node label for dependency graph
+      module NodeLabelable
+        def node_label
+          return "#{node_id} (supplied)" if supplied
+          return node_id if desc.empty?
+
+          "#{node_id}\n#{desc}"
+        end
+      end
+    end
+  end
+end

lib/kiba/extend/registry/treeable.rb

@@ -8,6 +8,8 @@ module Extend
     module Registry
       # Mixin module for generating dependency tree diagram for entry
       module Treeable
+        include NodeLabelable
+
         def parents
           files = creator.files
           [files[:source], files[:lookup]].compact
@@ -41,7 +43,9 @@ def traverse_up(elements)
             .compact
         end
 
-        def node = Diagrams::Elements::Node.new(id: key, label: key)
+        def node_id = key
+
+        def node = Diagrams::Elements::Node.new(id: node_id, label: node_label)
 
         def nodes = ancestors.uniq { |anc| anc.key }
           .map { |anc| anc.node } + [node]