Graph
The graph data set has one data type, and that type is also named graph. all@ does not include it. The run config is config/library/graph.yaml (N=1 and N=100, bytes, no compression). An empty serializer filter selects the serializers mapped to this set. Tree codecs are not in that map.
Why this set
The graph set is one object network with shared nodes and a cycle. It exists because most codecs store trees, and a tree cannot represent two fields that point at the same object, or a pointer that comes back to its start. Those libraries are absent from this set. A missing row here is “this codec does not store a graph.” It is not a fidelity failure.
The set has one data type because the question is that one network. The shape uses both failures at once. Several orders share one region object, and the people form a ring. An encoding that copies each child, or that unrolls the ring into a list, is a different value. Packed layouts inline a reference, so a cycle is not a legal packed graph, and those rows are absent too. Typical uses are object graphs inside one process, such as a document whose records share a child.
The generator contract and the other sets are on Data sets.
Region { code: utf8, note: utf8, version: int32 } // note is 64 characters
Order { sku: utf8, qty: int32, region: Region } // reference, not a copy
Person { name: utf8, next: Person } // reference
Book { orders: Order[], people: Person[] }
Default: order_count: 32, region_count: 4, ring_size: 8, string_len: {min:8,max:16}.
Generator order, after the usual (seed, type_id, instance_index) mix:
- For each region:
codefromstring_len, thennoteof length 64, thenversionin 1…10. - For each order:
skufromstring_len, thenqtyin 1…100. Orderireferences regioni % region_count(the same object, eight times when the defaults divide evenly). - For each person:
namefromstring_len. Thenpeople[i].nextispeople[(i+1) % ring_size].
region and next are references. An inlined copy is a different graph. Tree codecs (JSON, Protocol Buffers, MessagePack, and the rest of the suite types) return unsupported and are skipped. They are not fidelity failures.
Fidelity is identity inside the restored graph, not asdict and not a walk that copies each child. The eight orders that name one region must point at one region object. Walking next eight times returns to the start, and people[i].next is the same object as people[(i+1) % 8]. A duplicated region or an unrolled ring scores 0. Field values still have to match. N>1 compares each graph on its own; nodes are not shared across the batch.
Dagr emits this shape as Book from schemas/v2/dagr/schema.py for the regular and frozen layouts only. Packed and frozen+packed inline a node reference, so a Person.next cycle is not a legal packed graph. dagr-packed and dagr-frozen-packed do not support this data type. The timed path is still full materialize (to_bytes / restore).