Dependency Graph With a Cycle (JSON)
A dependency graph containing a genuine three-node cycle between fictional plugins — the fixture that makes a naive recursive walker hang or blow the stack, with the cycle path stated so the expected answer is unambiguous. Every package, version, hash and licence is fictional — the tree describes nothing real.
{
"schema": "novus-sample/dependency-graph/1",
"root": "@orchard-example/gateway",
"directed": true,
"acyclic": false,
"note": "SAMPLE — fictional supply-chain data. Every package, registry, version, hash, licence, advisory identifier and signature in this document is invented. The cycle is deliberate.",
"nodes": [
{
"id": "@orchard-example/gateway",
"version": "4.2.0",
"depth": 0
},
{
"id": "example-plugin-a",
"version": "1.0.0",
"depth": 1
},
{
"id": "example-plugin-b",
"version": "1.1.0",
"depth": 1
},
{
"id": "example-plugin-c",
"version": "1.2.0",
"depth": 1
},
{
"id": "example-logger",
"version": "3.4.1",
"depth": 3
}
],
"edges": [
{
"from": "@orchard-example/gateway",
"to": "example-plugin-a",
"range": "^1.0.0"
},
{
"from": "example-plugin-a",
"to": "example-plugin-b",
"range": "^1.1.0"
},
{
"from": "example-plugin-b",
"to": "example-plugin-c",
"range": "^1.2.0"
},
{Specifications
- Seed
- 51200
- Sample Only
- true
- Nodes
- 5
- Edges
- 5
- Cycles
- 1
- Cycle Length
- 3
- Acyclic
- false
- Line Endings
- LF
Testing contract
Expected to recover- Scenario
- Traverse a dependency graph that contains a cycle.
- Expected result
- Walker terminates, reports the cycle a -> b -> c -> a, and does not recurse infinitely or duplicate example-logger.
What is a .json file?
JSON (JavaScript Object Notation) is a lightweight, text-based data-interchange format representing objects, arrays, strings, numbers, booleans, and null. It is language-independent, human-readable, and the dominant format for web APIs and configuration. It requires a single well-formed root value.
How to use this file
Use an example JSON file to test parsers and serializers, schema validation, Unicode and number-precision handling, and API request or response processing.
How to use this file for testing
“Dependency Graph With a Cycle (JSON)” is a deterministic Novus Examples fixture for JSON parsing, Graph data, Error handling. Flat, deeply nested, JSON Lines, and intentionally invalid JSON for testing parsers and error handling.
Documented properties for this file: seed 51200 · 5 nodes · 5 edges · LF. Compare results against paired or grouped companions on this page when present (clean↔damaged, searchable↔scanned, or format twins) so scores stay reproducible across runs.
Download the file once, keep the path stable in CI or local scripts, and treat the spec table as the contract: dimensions, seeds, field lists, and roles are intentional. Corrupt or invalid samples are labelled as such — expect parsers to fail loudly rather than silently accept them.
SBOM, lockfile, provenance, and advisory fixtures describe the same fabricated component tree across formats, so a converter or scanner can be diffed against a known answer. Every package name, version, hash, and advisory ID is invented — never treat a finding here as real.
Feed the file to your parser and assert it handles the documented quirks — quoted delimiters, embedded newlines, ragged rows, or invalid syntax; the valid↔invalid distinction is labelled in the title.
Code examples
import json
with open("dependency-graph-cycle.json") as f:
data = json.load(f)
print(type(data), len(data))Related files
- jsonnpm Lockfile With a Peer Conflict and Nested DuplicateAn npm lockfile where the fictional example-cache pins a peer of example-logger@2.9.0 while the rest of the tree resolves 3.4.1, forcing a nested node_modules duplicate — the shape a deduplication report must detect. Every package, version, hash and licence is fictional — the tree describes nothing real.

- jsonDependency Graph With Diamond Dependencies (JSON)An explicit node/edge dependency graph with in-degree, out-degree and depth precomputed, plus a diamonds array naming the two shared nodes and their parents — the reference answer for any graph builder run against the SBOMs and lockfiles here. Every package, version, hash and licence is fictional — the tree describes nothing real.

- jsonnpm ls Dependency Tree (JSON)The nested tree `npm ls --json` prints, where a shared dependency is REPEATED under every parent rather than deduplicated — so counting objects gives a larger number than the graph has nodes. Every package, version, hash and licence is fictional — the tree describes nothing real.

- jsonpipdeptree JSON Outputpipdeptree output, whose top level is an ARRAY rather than an object — the shape that breaks a loader written against npm's tree — with both installed and required versions on every edge. Every package, version, hash and licence is fictional — the tree describes nothing real.

- jsonCycloneDX 1.6 Minimal SBOM (One Component)The smallest CycloneDX document that is still valid: required metadata, one fictional component, and no dependencies array — for testing that a reader handles an SBOM with nothing optional present. Every package, version, hash and licence is fictional — the tree describes nothing real.

- jsonCycloneDX SBOM With Diamond Dependency GraphA CycloneDX 1.6 SBOM whose dependencies array contains two diamonds: the fictional example-logger is reached through three parents and example-json-path through two, both resolving to a single node. Every package, version, hash and licence is fictional — the tree describes nothing real.

Generated by generation/supply_chain.py. Free for any use, no attribution required — license.