philiprehberger-dependency_graph 0.5.0 → 0.6.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/CHANGELOG.md +5 -0
- data/README.md +1 -0
- data/lib/philiprehberger/dependency_graph/version.rb +1 -1
- metadata +2 -2
checksums.yaml
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
---
|
|
2
2
|
SHA256:
|
|
3
|
-
metadata.gz:
|
|
4
|
-
data.tar.gz:
|
|
3
|
+
metadata.gz: 9041e502079017386899d6e6333b3da03684b8f30afde0e9b432345a3770da7e
|
|
4
|
+
data.tar.gz: 0b21f4dcf958d6e0d4c6511427d130a3f4ef2a91b2df0c0350cbda64c85778da
|
|
5
5
|
SHA512:
|
|
6
|
-
metadata.gz:
|
|
7
|
-
data.tar.gz:
|
|
6
|
+
metadata.gz: 572bd0a2ab419176f76d55908b7022375a3eb7f565e2b7a3aa9de4903bd627b4d46a93a52ccb4a89e1f5188f7f83468e2f3da55e38fab18ee52b721261daa22b
|
|
7
|
+
data.tar.gz: 6c1fe938a2fe004bfaba2e1a32dd6864efb43709a841b2fb61bbc01464aa7758e178b5ec993fd1148ebc0795cb74d1b40e09ae900dad5cfa3340e8aa349dd5ad
|
data/CHANGELOG.md
CHANGED
|
@@ -7,6 +7,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
|
|
|
7
7
|
|
|
8
8
|
## [Unreleased]
|
|
9
9
|
|
|
10
|
+
## [0.6.0] - 2026-05-12
|
|
11
|
+
|
|
12
|
+
### Added
|
|
13
|
+
- `Graph#remove(item)` deletes a node and every incident edge; returns `true` when present, `false` when the node is unknown
|
|
14
|
+
|
|
10
15
|
## [0.5.0] - 2026-05-01
|
|
11
16
|
|
|
12
17
|
### Added
|
data/README.md
CHANGED
|
@@ -136,6 +136,7 @@ graph.to_dot(name: 'MyDeps') # Customize the digraph name
|
|
|
136
136
|
|--------|-------------|
|
|
137
137
|
| `DependencyGraph.new` | Create a new empty graph |
|
|
138
138
|
| `Graph#add(item, depends_on:)` | Add an item with dependencies |
|
|
139
|
+
| `Graph#remove(item)` | Remove a node and all incident edges; returns true when present, false otherwise |
|
|
139
140
|
| `Graph#resolve` | Topological sort, dependencies first |
|
|
140
141
|
| `Graph#parallel_batches` | Group into parallel execution batches |
|
|
141
142
|
| `Graph#cycle?` | Check if the graph contains cycles |
|
metadata
CHANGED
|
@@ -1,14 +1,14 @@
|
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
|
2
2
|
name: philiprehberger-dependency_graph
|
|
3
3
|
version: !ruby/object:Gem::Version
|
|
4
|
-
version: 0.
|
|
4
|
+
version: 0.6.0
|
|
5
5
|
platform: ruby
|
|
6
6
|
authors:
|
|
7
7
|
- Philip Rehberger
|
|
8
8
|
autorequire:
|
|
9
9
|
bindir: bin
|
|
10
10
|
cert_chain: []
|
|
11
|
-
date: 2026-05-
|
|
11
|
+
date: 2026-05-12 00:00:00.000000000 Z
|
|
12
12
|
dependencies: []
|
|
13
13
|
description: Build and resolve dependency graphs using topological sort, detect cycles,
|
|
14
14
|
generate parallel execution batches, query dependencies and dependents, find shortest
|