Expand description
Typed adjacency: every edge carries a relationship type, and both directions are materialized.
The is-a hierarchy is crate::persist::Hierarchy; this is for the other
relationships a code system states between its concepts (RxNorm’s REL
and RELA, SNOMED CT’s attributes when they are served as a graph). No
spec governs the layout: our own design. Little-endian, a magic and
version prefix, the type names, then the outgoing and the incoming
adjacency as offsets with parallel type and node arrays, each node’s edges
sorted by type then node.
Structs§
- Relations
- The typed edges of a code system, both ways.
Enums§
- Relations
Error - A failure while building, reading, or writing the relations.