schemaxisGraphviz operation reference
Generated from the current declarations. Do not edit this file by hand.
Types, limits and defaults below describe resolved values. Runtime expressions must produce these types. Unknown options are rejected; defaults apply only when omitted. Constructor options must be constant after document composition.
Index#
layout#
Choose layout to automatically place named boxes and route directed edges. Use this for dependency/lineage graphs and feedback flows; it produces SVG, editable DOT, raw plain geometry and inspected JSON.
Native binding: dot -Kdot -Tplain -Tsvg; digraph, rankdir, node.label, directed edge. Output kind: ["image","text"].
Inputs: none.
| Option | Meaning | Type / constraints | Default |
|---|---|---|---|
nodes |
List every named task or entity, including disconnected ones, in stable presentation order. Supply 2–200 nodes with unique IDs. Labels are visible text; edge identity always uses IDs. | {"type":"array","items":{"type":"object","properties":{"id":{"type":"string","minLength":1,"maxLength":32,"required":true},"label":{"type":"string","minLength":1,"maxLength":24,"required":true}}},"minItems":2,"maxItems":200} |
required |
edges |
Declare 1–500 unique directed dependencies using node IDs. A source precedes a target in DAG mode. Duplicate pairs, self-edges and unknown endpoints fail; reversing a pair reverses the dependency. | {"type":"array","items":{"type":"object","properties":{"source":{"type":"string","minLength":1,"maxLength":32,"required":true},"target":{"type":"string","minLength":1,"maxLength":32,"required":true}}},"minItems":1,"maxItems":500} |
required |
rankDirection |
Choose TB to lay DAG dependencies from top to bottom, or LR from left to right. Omission uses TB. This changes layout orientation without changing topology; coordinates remain inches from lower left, and SVG uses inverted y. | {"type":"enum","values":["TB","LR"]} |
"TB" |
graphPolicy |
Choose dag for acyclic dependencies; omission uses dag and any cycle fails before native launch. Choose cyclic explicitly for feedback flows. Cyclic graphs preserve topology but do not promise every edge moves forward through ranks. | {"type":"enum","values":["dag","cyclic"]} |
"dag" |