faebryk — низкоуровневый графовый API на Zig

engineering

graph is a Claude Code skill that covers the Zig-backed instance graph in faebryk: how GraphView, NodeReference, and EdgeReference work, plus the invariants around memory allocation and cleanup. The implementation spans three layers: the Zig core (`graph.zig`), Python bindings (`graph_py.zig`), and generated type stubs (`graph.pyi`). Critical rules include using only factory methods (`GraphView.create()`, `NodeReference.create()`, `EdgeReference.create()`), always calling `GraphView.destroy()` explicitly since Python GC does not reclaim Zig-side allocations, and staying within the fixed capacity of 6 dynamic attributes per node or edge. This skill is essential for developers building graph-traversal systems, working with the atopile compiler's typegraph construction, or debugging faebryk's graph visualization layer.