philiprehberger-dependency_graph 0.4.0 → 0.6.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: d893dfbce550ce9ba6022f2f647b4b70cf2306a972b52b93ed096d7bc9384c9c
-  data.tar.gz: 57ef5e2ddea71da6b58e15adeb0e1d1d38443b455d99c17aa14a795cfdf7a421
+  metadata.gz: 9041e502079017386899d6e6333b3da03684b8f30afde0e9b432345a3770da7e
+  data.tar.gz: 0b21f4dcf958d6e0d4c6511427d130a3f4ef2a91b2df0c0350cbda64c85778da
 SHA512:
-  metadata.gz: a3096da9a20d0a487aec73c8f5fccd26483e4ef6d19e237f767892f8ef3c5f1a8ad670d859b137b3c10c7afb4e28a86467e9485f0d081fe4bc1ca2be706eb0af
-  data.tar.gz: 657e23b74e72698eefd35515b25ce8f3a8d508107384460fac9d9d608589018d6b11705f49fd2547fe5d879fe5f06e68a2361d28cf2009adb5c560c6a572fef2
+  metadata.gz: 572bd0a2ab419176f76d55908b7022375a3eb7f565e2b7a3aa9de4903bd627b4d46a93a52ccb4a89e1f5188f7f83468e2f3da55e38fab18ee52b721261daa22b
+  data.tar.gz: 6c1fe938a2fe004bfaba2e1a32dd6864efb43709a841b2fb61bbc01464aa7758e178b5ec993fd1148ebc0795cb74d1b40e09ae900dad5cfa3340e8aa349dd5ad

data/CHANGELOG.md

@@ -7,6 +7,17 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.6.0] - 2026-05-12
+
+### Added
+- `Graph#remove(item)` deletes a node and every incident edge; returns `true` when present, `false` when the node is unknown
+
+## [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

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
@@ -133,6 +136,7 @@ graph.to_dot(name: 'MyDeps')  # Customize the digraph name
 |--------|-------------|
 | `DependencyGraph.new` | Create a new empty graph |
 | `Graph#add(item, depends_on:)` | Add an item with dependencies |
+| `Graph#remove(item)` | Remove a node and all incident edges; returns true when present, false otherwise |
 | `Graph#resolve` | Topological sort, dependencies first |
 | `Graph#parallel_batches` | Group into parallel execution batches |
 | `Graph#cycle?` | Check if the graph contains cycles |
@@ -140,6 +144,8 @@ graph.to_dot(name: 'MyDeps')  # Customize the digraph name
 | `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 |

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

data/lib/philiprehberger/dependency_graph/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module DependencyGraph
-    VERSION = '0.4.0'
+    VERSION = '0.6.0'
   end
 end

metadata

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