@knowvah/dot-engine 0.1.0

package/dist/model/algData.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algData.d.ts","sourceRoot":"","sources":["../../src/model/algData.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEtC;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;CACxB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IACrB,mEAAmE;IACnE,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC;IACnB,gEAAgE;IAChE,MAAM,EAAE,KAAK,GAAG,IAAI,CAAC;IACrB,yDAAyD;IACzD,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,gDAAgD;IAChD,GAAG,EAAE,MAAM,CAAC;IACZ,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC;IACb,8DAA8D;IAC9D,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC;IAChB,iFAAiF;IACjF,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,2DAA2D;IAC3D,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvB,yDAAyD;IACzD,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,KAAK,EAAE,OAAO,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,OAAO,CAAC;IAChB,KAAK,EAAE,OAAO,CAAC;IACf,EAAE,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACpC,KAAK,EAAE,OAAO,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,OAAO,CAAC;CACtB;AAED;;;;;GAKG;AACH,eAAO,MAAM,WAAW,KAAO,CAAC;AAEhC;;;;;;;;;GASG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,0FAA0F;IAC1F,YAAY,EAAE,MAAM,CAAC;IACrB,uFAAuF;IACvF,WAAW,EAAE,MAAM,CAAC;IACpB,kFAAkF;IAClF,SAAS,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAC;IACvB,2FAA2F;IAC3F,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC;IACpB,4EAA4E;IAC5E,IAAI,EAAE,MAAM,CAAC;IACb;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,qFAAqF;IACrF,QAAQ,CAAC,YAAY,EAAE,KAAK,CAAC;CAC9B;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,WAAW,GACnB,UAAU,GACV,YAAY,GACZ,UAAU,GACV,SAAS,GACT,UAAU,GACV,UAAU,GACV,YAAY,GACZ,YAAY,GACZ,gBAAgB,CAAC"}

package/dist/model/cgraph-ops.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Faithful TypeScript port of the cgraph subgraph/node operations needed by
+ * later layout passes (e.g. dot's newrank fill_ranks, which creates a
+ * `_new_rank` subgraph and adds anonymous placeholder nodes).
+ *
+ * Nodes are owned by the root graph and keyed by name in each graph's
+ * `nodes` Map; subgraph membership is presence in that subgraph's `nodes`
+ * Map. A node in a subgraph is a member of every enclosing graph up to and
+ * including root (Subgraph Ownership Semantics).
+ *
+ * @see lib/cgraph/node.c
+ * @see lib/cgraph/subg.c
+ */
+import type { Graph } from './graph.js';
+import { Node } from './node.js';
+/**
+ * Create-or-get a node by name on the root graph. When `name` is null/empty,
+ * mint a fresh anonymous node with a unique id and unique "%<id>" name. When
+ * `create` is false and a named node is absent, returns null.
+ *
+ * Unlike the C agnode (which keys by id), this port keys nodes by name in
+ * `Graph.nodes`; node creation always installs into the root graph.
+ *
+ * @see lib/cgraph/node.c:agnode
+ */
+export declare function agnode(g: Graph, name: string | null, create: boolean): Node | null;
+/**
+ * Assign a subgraph its AGSEQ from the root-level counter, mirroring
+ * `agnextseq(par, AGRAPH)` in agopen: pre-increment `clos->seq[AGRAPH]` (stored
+ * on the root as `subgSeqCounter`) and record it on the subgraph. Call once,
+ * only when the subgraph is first created.
+ *
+ * @see lib/cgraph/graph.c:agopen (AGSEQ(g) = agnextseq(par, AGRAPH))
+ * @see lib/cgraph/graph.c:agnextseq
+ */
+export declare function assignSubgSeq(parent: Graph, sg: Graph): void;
+/**
+ * Create-or-get a named subgraph under `parent`. On create, sets the new
+ * graph's `parent`/`root`, assigns its AGSEQ, and registers it in
+ * `parent.subgraphs`. Returns null when `create` is false and the subgraph is
+ * absent.
+ *
+ * @see lib/cgraph/subg.c:agsubg
+ */
+export declare function agsubg(parent: Graph, name: string, create: boolean): Graph | null;
+/**
+ * Lookup or insert node `n` in subgraph `g`, recursively installing it into
+ * every enclosing graph up to and including root. Returns null if `n` does
+ * not belong to `g`'s root. Mirrors the parser's enclosing-graph membership
+ * loop (builder.ts processNodeStmt).
+ *
+ * @see lib/cgraph/node.c:agsubnode
+ */
+export declare function agsubnode(g: Graph, n: Node, create: boolean): Node | null;
+/**
+ * Remove node `n` from graph `g` and every enclosing graph up to and
+ * including root (its member graphs). Mirrors agdelnode's image removal
+ * applied across the graph and its ancestors.
+ *
+ * @see lib/cgraph/node.c:agdelnode
+ */
+export declare function agdelnode(g: Graph, n: Node): void;
+/**
+ * Remove subgraph `sg` from `parent.subgraphs`. Mirrors agdelsubg, which
+ * only deletes the entry in the parent's subgraph dict.
+ *
+ * @see lib/cgraph/subg.c:agdelsubg
+ */
+export declare function agdelsubg(parent: Graph, sg: Graph): void;
+/**
+ * Faithful `agxget` for a graph attribute, mirroring C's
+ * `late_string(g, agfindgraphattr(g, name), NULL)`:
+ * - returns `g`'s explicit value if set;
+ * - else, if `name` was declared graph-wide (set on any (sub)graph at parse
+ *   time → present in `root.declaredGraphAttrs`), returns the empty-string
+ *   default `""` (cgraph's agsafeset default);
+ * - else returns `undefined` (the attribute symbol does not exist).
+ *
+ * The `undefined` vs `""` distinction is load-bearing: e.g. `ordered_edges`
+ * treats a non-NULL (incl. empty) value as "graph ordering present, do not
+ * recurse into subgraphs". A subgraph-scoped `ordering=out` therefore yields
+ * `""` at the root, so the root no-ops it exactly as C does.
+ * @see lib/cgraph/attr.c:agxget, lib/common/utils.c:late_string
+ */
+export declare function agGraphAttr(g: Graph, name: string): string | undefined;
+//# sourceMappingURL=cgraph-ops.d.ts.map

package/dist/model/cgraph-ops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cgraph-ops.d.ts","sourceRoot":"","sources":["../../src/model/cgraph-ops.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAwBjC;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,KAAK,EACR,IAAI,EAAE,MAAM,GAAG,IAAI,EACnB,MAAM,EAAE,OAAO,GACd,IAAI,GAAG,IAAI,CAgBb;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAE5D;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CACpB,MAAM,EAAE,KAAK,EACb,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,OAAO,GACd,KAAK,GAAG,IAAI,CAUd;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI,CAWzE;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAIjD;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAExD;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAItE"}

package/dist/model/edge.d.ts

@@ -0,0 +1,80 @@
+/**
+ * TypeScript port of Agedge_t / Agedgepair_t from lib/cgraph/cgraph.h.
+ *
+ * @see lib/cgraph/cgraph.h:Agedge_s
+ * @see lib/cgraph/cgraph.h:Agedgepair_s
+ */
+import type { Node } from './node.js';
+import { type EdgeInfo } from './edgeInfo.js';
+/**
+ * Represents an abstract edge in the graph, corresponding to Agedgepair_t.
+ *
+ * IMPORTANT: In Agedgepair_t, the "out" half stores the HEAD node and the
+ * "in" half stores the TAIL node. This is counterintuitive but matches C:
+ *   out.node == head,  in.node == tail
+ * See lib/cgraph/cgraph.h Agedgepair_t and the AGTAIL/AGHEAD macro definitions.
+ *
+ * From cgraph.md "Edge Direction Semantics":
+ *   - tail: source node (arrow comes FROM); AGTAIL(e) = AGMKIN(e)->node = in.node
+ *   - head: destination node (arrow goes TO); AGHEAD(e) = AGMKOUT(e)->node = out.node
+ *   - out-edge: stored in tail node's out-edge set; out.node == head
+ *   - in-edge: stored in head node's in-edge set; in.node == tail
+ *
+ * The `info` field replaces the agbindrec / ED_* mechanism (AD-1).
+ *
+ * @see lib/cgraph/cgraph.h:Agedgepair_s
+ * @see lib/cgraph/cgraph.h:AGTAIL
+ * @see lib/cgraph/cgraph.h:AGHEAD
+ * @see lib/cgraph/cgraph.h:AGMKIN
+ * @see lib/cgraph/cgraph.h:AGMKOUT
+ */
+export declare class Edge {
+    /** @see lib/cgraph/cgraph.h:AGSEQ */
+    private static _nextSeq;
+    /**
+     * Monotone sequence number — equivalent to AGSEQ(e) in C.
+     * Used by edgeidcmpf for stable sort ordering.
+     *
+     * Mutable because C's new_virtual_edge overwrites a virtual edge's AGSEQ
+     * with AGSEQ(orig) after allocation; copyVirtualEdgeInfo mirrors that.
+     * @see lib/cgraph/cgraph.h:AGSEQ, lib/dotgen/fastgr.c:new_virtual_edge
+     */
+    seq: number;
+    /**
+     * Per-graph creation-order index (1-based).
+     * Set by the parser after root.edges.push(). Used as the SVG edge id,
+     * matching C's AGSEQ-based edge id assignment.
+     */
+    graphSeq: number;
+    /**
+     * Source node (arrow origin).
+     * C: AGTAIL(e) = AGMKIN(e)->node = in.node
+     * @see lib/cgraph/cgraph.h:AGTAIL
+     */
+    readonly tail: Node;
+    /**
+     * Destination node (arrow target).
+     * C: AGHEAD(e) = AGMKOUT(e)->node = out.node
+     * @see lib/cgraph/cgraph.h:AGHEAD
+     */
+    readonly head: Node;
+    /**
+     * Edge key; empty string for anonymous edges.
+     * Corresponds to the `name` argument of agedge().
+     * @see lib/cgraph/cgraph.h:agedge
+     */
+    readonly name: string;
+    /**
+     * String attributes (agget/agset equivalents).
+     * @see lib/cgraph/cgraph.h:Agattr_s
+     */
+    attrs: Map<string, string>;
+    /**
+     * Layout-engine info; replaces ED_* macros via agbindrec (AD-1).
+     * @see lib/cgraph/cgraph.h:agbindrec
+     */
+    info: EdgeInfo;
+    /** @see lib/cgraph/edge.c:agedge */
+    constructor(tail: Node, head: Node, name: string);
+}
+//# sourceMappingURL=edge.d.ts.map

package/dist/model/edge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/model/edge.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,KAAK,QAAQ,EAA0B,MAAM,eAAe,CAAC;AAEtE;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,IAAI;IAOf,qCAAqC;IACrC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAK;IAE5B;;;;;;;OAOG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;;;OAIG;IACH,QAAQ,EAAE,MAAM,CAAK;IAErB;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAEpB;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAEpB;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;;OAGG;IACH,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE3B;;;OAGG;IACH,IAAI,EAAE,QAAQ,CAAC;IAEf,oCAAoC;gBACxB,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;CAQjD"}

package/dist/model/edgeInfo.d.ts

@@ -0,0 +1,299 @@
+/**
+ * TypeScript port of Agedgeinfo_t from lib/common/types.h.
+ *
+ * All ED_* accessor macros in the C source expand to typed reads/writes into
+ * this struct. In TypeScript the macro indirection is unnecessary — consumers
+ * access fields directly on the EdgeInfo object attached to each Edge.
+ *
+ * @see lib/common/types.h:Agedgeinfo_t
+ * @see lib/common/types.h:ED_* macros
+ */
+import type { Port, Spline } from './geom.js';
+import type { Edge } from './edge.js';
+import type { TextlabelT } from '../common/types.js';
+import type { ArrowDrawOp } from '../common/arrows-types.js';
+/**
+ * Edge layout and rendering info record; replaces the ED_* macro family.
+ *
+ * Required fields are always initialized when an edge is created (matching C
+ * zero-init of the port struct in common_init_edge). All other fields are
+ * optional; they are populated by specific phases of the layout pipeline.
+ *
+ * @see lib/common/types.h:Agedgeinfo_t
+ * @see lib/common/utils.c:common_init_edge
+ */
+export interface EdgeInfo {
+    /**
+     * Tail-end port specification. Always initialized on edge creation.
+     * @see lib/common/types.h:Agedgeinfo_t.tail_port
+     * @see lib/common/types.h:ED_tail_port
+     */
+    tail_port: Port;
+    /**
+     * Head-end port specification. Always initialized on edge creation.
+     * @see lib/common/types.h:Agedgeinfo_t.head_port
+     * @see lib/common/types.h:ED_head_port
+     */
+    head_port: Port;
+    /**
+     * Rendered spline geometry. Undefined before the spline routing phase.
+     * Set by clip_and_install() in lib/common/splines.c. Do not read before
+     * the layout engine's spline pass has completed.
+     *
+     * @see lib/common/types.h:Agedgeinfo_t.spl
+     * @see lib/common/types.h:ED_spl
+     * @see lib/common/splines.c:clip_and_install
+     */
+    spl?: Spline;
+    /**
+     * Center edge label.
+     * @see lib/common/types.h:Agedgeinfo_t.label
+     * @see lib/common/types.h:ED_label
+     */
+    label?: TextlabelT;
+    /**
+     * Head-end label (arrowhead side).
+     * @see lib/common/types.h:Agedgeinfo_t.head_label
+     * @see lib/common/types.h:ED_head_label
+     */
+    head_label?: TextlabelT;
+    /**
+     * Tail-end label (arrowtail side).
+     * @see lib/common/types.h:Agedgeinfo_t.tail_label
+     * @see lib/common/types.h:ED_tail_label
+     */
+    tail_label?: TextlabelT;
+    /**
+     * External label (placed outside the edge spline).
+     * @see lib/common/types.h:Agedgeinfo_t.xlabel
+     * @see lib/common/types.h:ED_xlabel
+     */
+    xlabel?: TextlabelT;
+    /** Head-end arrow primitives (arrowhead). @see lib/common/arrows.c:arrow_gen */
+    headArrowOps?: ArrowDrawOp[];
+    /** Tail-end arrow primitives (arrowtail). @see lib/common/arrows.c:arrow_gen */
+    tailArrowOps?: ArrowDrawOp[];
+    /**
+     * Whether this edge participates in rank constraints.
+     * Corresponds to the `constraint` edge attribute (default: true).
+     * When false, the edge does not constrain rank assignment.
+     * @see lib/dotgen/class1.c:nonconstraint_edge
+     */
+    constraint?: boolean;
+    /**
+     * Edge type code: REGULAREDGE / FLATEDGE / SELFEDGE.
+     * Stored as char in C; mapped to number here.
+     * @see lib/common/types.h:Agedgeinfo_t.edge_type
+     * @see lib/common/types.h:ED_edge_type
+     */
+    edge_type?: number;
+    /**
+     * True for compound edges (cross-cluster).
+     * Stored as char in C.
+     * @see lib/common/types.h:Agedgeinfo_t.compound
+     * @see lib/common/types.h:ED_compound
+     */
+    compound?: number;
+    /**
+     * True for flat edges whose tail and head are adjacent in rank.
+     * Stored as char in C.
+     * @see lib/common/types.h:Agedgeinfo_t.adjacent
+     * @see lib/common/types.h:ED_adjacent
+     */
+    adjacent?: number;
+    /**
+     * Whether the edge label is placed above (on top of) the spline.
+     * Stored as char in C.
+     * @see lib/common/types.h:Agedgeinfo_t.label_ontop
+     * @see lib/common/types.h:ED_label_ontop
+     */
+    label_ontop?: number;
+    /**
+     * GUI state flags (bitwise OR of GUI_STATE_* constants).
+     * Stored as unsigned char in C.
+     * @see lib/common/types.h:Agedgeinfo_t.gui_state
+     * @see lib/common/types.h:ED_gui_state
+     * @see lib/common/types.h:GUI_STATE_ACTIVE / GUI_STATE_SELECTED / GUI_STATE_VISITED / GUI_STATE_DELETED
+     */
+    gui_state?: number;
+    /**
+     * Back-pointer to the original (non-virtual) edge; set on virtual edges
+     * created during dot layout for long-range connections.
+     * @see lib/common/types.h:Agedgeinfo_t.to_orig
+     * @see lib/common/types.h:ED_to_orig
+     * @see lib/common/shapes.c
+     */
+    to_orig?: Edge;
+    /**
+     * Back-pointer to the virtual edge that represents this edge in the
+     * rank-spanning chain; set on real edges when a virtual chain exists.
+     * @see lib/common/types.h:Agedgeinfo_t.to_virt
+     * @see lib/common/types.h:ED_to_virt
+     */
+    to_virt?: Edge;
+    /**
+     * Routing attempted and routesplines failed: the edge is LOST exactly as in
+     * C (no spline installed, map_edge warns, emit skips). Port-only bookkeeping
+     * so the routeDotEdges backstop does not re-attempt an edge C routes once.
+     * @see lib/common/routespl.c:routesplines (NULL), lib/common/postproc.c:map_edge
+     */
+    lost?: boolean;
+    /**
+     * Layout-engine algorithm scratch pointer. Engine-specific; not typed here.
+     * @see lib/common/types.h:Agedgeinfo_t.alg
+     * @see lib/common/types.h:ED_alg
+     */
+    alg?: unknown;
+    /**
+     * Edge weight for network simplex. Higher weight means the edge length is
+     * penalized more, biasing ranks toward short edges.
+     * int in C.
+     * @see lib/common/types.h:Agedgeinfo_t.weight
+     * @see lib/common/types.h:ED_weight
+     */
+    weight?: number;
+    /**
+     * Minimum rank separation required between tail and head nodes.
+     * int in C.
+     * @see lib/common/types.h:Agedgeinfo_t.minlen
+     * @see lib/common/types.h:ED_minlen
+     */
+    minlen?: number;
+    /**
+     * Network-simplex cut value; used during feasible-tree construction.
+     * @see lib/common/types.h:Agedgeinfo_t.cutvalue
+     * @see lib/common/types.h:ED_cutvalue
+     */
+    cutvalue?: number;
+    /**
+     * Index into the network-simplex spanning tree edge list.
+     * @see lib/common/types.h:Agedgeinfo_t.tree_index
+     * @see lib/common/types.h:ED_tree_index
+     */
+    tree_index?: number;
+    /**
+     * Crossing penalty multiplier for this edge.
+     * short in C.
+     * @see lib/common/types.h:Agedgeinfo_t.xpenalty
+     * @see lib/common/types.h:ED_xpenalty
+     */
+    xpenalty?: number;
+    /**
+     * Multiplicity count — number of parallel edges merged into this one
+     * during concentration.
+     * short in C.
+     * @see lib/common/types.h:Agedgeinfo_t.count
+     * @see lib/common/types.h:ED_count
+     */
+    count?: number;
+    /**
+     * Concentrated-opposite flag; set when merging parallel edges from
+     * opposing directions.
+     * @see lib/common/types.h:Agedgeinfo_t.conc_opp_flag
+     * @see lib/common/types.h:ED_conc_opp_flag
+     */
+    conc_opp_flag?: boolean;
+    /**
+     * Debug: render intermediate routing boxes.
+     * unsigned char in C.
+     * @see lib/common/types.h:Agedgeinfo_t.showboxes
+     * @see lib/common/types.h:ED_showboxes
+     */
+    showboxes?: number;
+    /**
+     * True for edges created inside the flat-adjacent auxiliary clone graph
+     * (make_flat_adj_edges). Models C's setState window: cloneGraph re-declares
+     * the aux attribute dictionary via agnxtattr (NAME-sorted), so aux ids are
+     * alphabetical ranks while the global symbols E_arrowsz/E_penwidth — which
+     * setState does NOT remap — keep main-graph declaration-order ids. Inside
+     * the aux, arrow_length's agxget(e, E_arrowsz) therefore mis-indexes into
+     * an unrelated attribute (e.g. #1949: id 1 = `color` → "black"/"blue"),
+     * strtod fails, and late_double falls back to 1.0 for both arrowsize and
+     * penwidth. The arrow POLYGON is unaffected (C regenerates it at emit time
+     * from the original edge). Load-bearing C quirk; consumed by the arrow
+     * clip-length computation only.
+     * @see lib/dotgen/dotsplines.c:setState (E_arrowsz/E_penwidth not remapped)
+     * @see lib/common/arrows.c:arrow_length (late_double(e, E_arrowsz, 1.0, 0.0))
+     */
+    stale_arrow_attrs?: boolean;
+    /**
+     * Spring factor (ideal edge length multiplier) for spring-model layout.
+     * double in C.
+     * @see lib/common/types.h:Agedgeinfo_t.factor
+     * @see lib/common/types.h:ED_factor
+     */
+    factor?: number;
+    /**
+     * Ideal edge length for neato/fdp stress-model layout.
+     * double in C.
+     * @see lib/common/types.h:Agedgeinfo_t.dist
+     * @see lib/common/types.h:ED_dist
+     */
+    dist?: number;
+    /**
+     * Path used during spline routing (Ppolyline_t in C).
+     * Typed in Batch 4 when pathplan types are ported.
+     * @see lib/common/types.h:Agedgeinfo_t.path
+     * @see lib/common/types.h:ED_path
+     */
+    path?: unknown;
+    /**
+     * Group id for samehead port merging. Edges sharing this value at the same
+     * head node will be merged onto a single port by dot_sameports().
+     * Corresponds to agxget(e, E_samehead) in the C source.
+     * @see lib/dotgen/sameport.c:dot_sameports
+     */
+    samehead?: string;
+    /**
+     * Group id for sametail port merging. Edges sharing this value at the same
+     * tail node will be merged onto a single port by dot_sameports().
+     * Corresponds to agxget(e, E_sametail) in the C source.
+     * @see lib/dotgen/sameport.c:dot_sameports
+     */
+    sametail?: string;
+    /**
+     * Name of the cluster subgraph to clip the head of this edge against.
+     * When set, the spline endpoint at the head is clipped to the cluster's
+     * bounding box by dot_compoundEdges(). Corresponds to agget(e, "lhead").
+     * @see lib/dotgen/compound.c:makeCompoundEdge
+     */
+    lhead?: string;
+    /**
+     * Name of the cluster subgraph to clip the tail of this edge against.
+     * When set, the spline start at the tail is clipped to the cluster's
+     * bounding box by dot_compoundEdges(). Corresponds to agget(e, "ltail").
+     * @see lib/dotgen/compound.c:makeCompoundEdge
+     */
+    ltail?: string;
+    /**
+     * True if this edge was reversed by acyclic() during cycle-breaking.
+     * Set by reverseEdge() in src/layout/dot/fastgr.ts. Used by dot_splines
+     * to swap bezier control-point order back to tail→head orientation.
+     *
+     * There is no corresponding C field; C detects reversal via rank comparison
+     * in swap_ends_p() (lib/dotgen/dotsplines.c). The TypeScript port adds this
+     * field for explicit tracking.
+     *
+     * @see lib/dotgen/dotsplines.c:swap_ends_p
+     */
+    reversed?: boolean;
+}
+/**
+ * Returns a zero-initialized Port matching C's zero-init of the port struct
+ * in common_init_edge.
+ *
+ * @see lib/common/types.h:struct port
+ * @see lib/common/utils.c:common_init_edge
+ */
+export declare function makePort(): Port;
+/**
+ * Constructs a minimal EdgeInfo with required port fields initialized.
+ *
+ * Both ports are required — tail_port and head_port are always initialized
+ * when an edge is created (never null in the C model).
+ *
+ * @see lib/common/types.h:Agedgeinfo_t
+ * @see lib/common/utils.c:common_init_edge
+ */
+export declare function makeEdgeInfo(tailPort: Port, headPort: Port): EdgeInfo;
+//# sourceMappingURL=edgeInfo.d.ts.map

package/dist/model/edgeInfo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edgeInfo.d.ts","sourceRoot":"","sources":["../../src/model/edgeInfo.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAC9C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAE7D;;;;;;;;;GASG;AACH,MAAM,WAAW,QAAQ;IACvB;;;;OAIG;IACH,SAAS,EAAE,IAAI,CAAC;IAEhB;;;;OAIG;IACH,SAAS,EAAE,IAAI,CAAC;IAEhB;;;;;;;;OAQG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IAMb;;;;OAIG;IACH,KAAK,CAAC,EAAE,UAAU,CAAC;IAEnB;;;;OAIG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IAExB;;;;OAIG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IAExB;;;;OAIG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC;IASpB,gFAAgF;IAChF,YAAY,CAAC,EAAE,WAAW,EAAE,CAAC;IAE7B,gFAAgF;IAChF,YAAY,CAAC,EAAE,WAAW,EAAE,CAAC;IAM7B;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAMnB;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,IAAI,CAAC;IAEf;;;;;OAKG;IACH,OAAO,CAAC,EAAE,IAAI,CAAC;IAEf;;;;;OAKG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;IAMf;;;;OAIG;IACH,GAAG,CAAC,EAAE,OAAO,CAAC;IAMd;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;;;;;;;;;;;OAcG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAM5B;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;;;OAKG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;OAKG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;IAOf;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAMlB;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAMf;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAMD;;;;;;GAMG;AACH,wBAAgB,QAAQ,IAAI,IAAI,CAgB/B;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,GAAG,QAAQ,CA4BrE"}

package/dist/model/geom.d.ts

@@ -0,0 +1,149 @@
+/**
+ * Geometric primitive types ported from lib/common/geom.h and lib/common/types.h.
+ *
+ * @see lib/common/geom.h
+ * @see lib/common/types.h
+ * @see lib/common/const.h
+ */
+/**
+ * Floating-point 2-D point.
+ *
+ * @see lib/common/geom.h: struct pointf_s { double x, y; }
+ */
+export type Point = {
+    x: number;
+    y: number;
+};
+/**
+ * Floating-point axis-aligned bounding box, defined by lower-left and
+ * upper-right corners.
+ *
+ * C uses uppercase `LL`/`UR`; TypeScript uses `ll`/`ur` per camelCase
+ * convention documented in the port mapping table.
+ *
+ * @see lib/common/geom.h: typedef struct { pointf LL, UR; } boxf
+ */
+export type Box = {
+    ll: Point;
+    ur: Point;
+};
+/**
+ * A single Bezier curve segment used in edge spline rendering.
+ *
+ * @see lib/common/types.h: typedef struct bezier
+ */
+export type Bezier = {
+    /** @see lib/common/types.h: pointf *list */
+    list: Point[];
+    /** @see lib/common/types.h: size_t size */
+    size: number;
+    /** @see lib/common/types.h: uint32_t sflag */
+    sflag: number;
+    /** @see lib/common/types.h: uint32_t eflag */
+    eflag: number;
+    /** @see lib/common/types.h: pointf sp */
+    sp: Point;
+    /** @see lib/common/types.h: pointf ep */
+    ep: Point;
+};
+/**
+ * A collection of Bezier curves that form an edge spline, together with
+ * its bounding box.
+ *
+ * @see lib/common/types.h: typedef struct splines
+ */
+export type Spline = {
+    /** @see lib/common/types.h: bezier *list */
+    list: Bezier[];
+    /** @see lib/common/types.h: size_t size */
+    size: number;
+    /** @see lib/common/types.h: boxf bb */
+    bb: Box;
+};
+/**
+ * Internal edge endpoint specification.
+ *
+ * @see lib/common/types.h: typedef struct port
+ */
+export type Port = {
+    /** Aiming point relative to node center. @see lib/common/types.h: pointf p */
+    p: Point;
+    /** Slope in radians. @see lib/common/types.h: double theta */
+    theta: number;
+    /**
+     * When non-null, points to the bounding box of the rectangular port target.
+     * @see lib/common/types.h: boxf *bp
+     */
+    bp: Box | null;
+    /** If true, edge has port info at this end. @see lib/common/types.h: bool defined */
+    defined: boolean;
+    /** If true, constraints such as theta are set. @see lib/common/types.h: bool constrained */
+    constrained: boolean;
+    /** If true, clip end to node/port shape. @see lib/common/types.h: bool clip */
+    clip: boolean;
+    /** If true, assign compass point dynamically. @see lib/common/types.h: bool dyna */
+    dyna: boolean;
+    /** For mincross. @see lib/common/types.h: unsigned char order */
+    order: number;
+    /**
+     * If port is on perimeter of node, contains the bitwise OR of the sides
+     * (TOP, BOTTOM, etc.) it is on.
+     * @see lib/common/types.h: unsigned char side
+     */
+    side: number;
+    /**
+     * Port name if explicitly given, otherwise null.
+     * @see lib/common/types.h: char *name
+     */
+    name: string | null;
+};
+/**
+ * Counter-clockwise rotate point p by ccwrot degrees (0, 90, 180, or 270).
+ *
+ * Matches the four-case switch in lib/common/geom.c:ccwrotatepf exactly:
+ *   0   → identity
+ *   90  → perp(p)  = { x: -p.y, y: p.x }
+ *   180 → { x: p.x, y: -p.y }    (note: keep x, negate y — matches geom.c:180 case)
+ *   270 → exch_xyf(p) = { x: p.y, y: p.x }
+ *
+ * @see lib/common/geom.c:ccwrotatepf
+ */
+export declare function ccwrotatepf(p: Point, ccwrot: number): Point;
+/**
+ * Returns true if box `b0` completely contains box `b1`.
+ *
+ * Matches the C `CONTAINS` macro exactly:
+ * ```c
+ * #define CONTAINS(b0,b1) \
+ *   (((b0).UR.x >= (b1).UR.x) && ((b0).UR.y >= (b1).UR.y) && \
+ *    ((b0).LL.x <= (b1).LL.x) && ((b0).LL.y <= (b1).LL.y))
+ * ```
+ *
+ * @see lib/common/geom.h: CONTAINS macro
+ */
+export declare function boxContains(b0: Box, b1: Box): boolean;
+/**
+ * Returns true if boxes `b0` and `b1` intersect (touching edges count).
+ *
+ * Matches the C `OVERLAP` macro exactly:
+ * ```c
+ * #define OVERLAP(b0,b1) (((b0).UR.x >= (b1).LL.x) && ((b1).UR.x >= (b0).LL.x) \
+ *                       && ((b0).UR.y >= (b1).LL.y) && ((b1).UR.y >= (b0).LL.y))
+ * ```
+ *
+ * @see lib/common/geom.h: OVERLAP macro
+ */
+export declare function boxOverlap(b0: Box, b1: Box): boolean;
+/**
+ * Points per inch — used throughout Graphviz for unit conversion.
+ *
+ * @see lib/common/geom.h: #define POINTS_PER_INCH 72
+ */
+export declare const POINTS_PER_INCH = 72;
+/**
+ * Default line spacing multiplier for multi-line labels.
+ *
+ * @see lib/common/const.h: #define LINESPACING 1.20
+ */
+export declare const LINESPACING = 1.2;
+//# sourceMappingURL=geom.d.ts.map

package/dist/model/geom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"geom.d.ts","sourceRoot":"","sources":["../../src/model/geom.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAMH;;;;GAIG;AACH,MAAM,MAAM,KAAK,GAAG;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAM7C;;;;;;;;GAQG;AACH,MAAM,MAAM,GAAG,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,KAAK,CAAA;CAAE,CAAC;AAM3C;;;;GAIG;AACH,MAAM,MAAM,MAAM,GAAG;IACnB,4CAA4C;IAC5C,IAAI,EAAE,KAAK,EAAE,CAAC;IACd,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,8CAA8C;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,8CAA8C;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,yCAAyC;IACzC,EAAE,EAAE,KAAK,CAAC;IACV,yCAAyC;IACzC,EAAE,EAAE,KAAK,CAAC;CACX,CAAC;AAEF;;;;;GAKG;AACH,MAAM,MAAM,MAAM,GAAG;IACnB,4CAA4C;IAC5C,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,uCAAuC;IACvC,EAAE,EAAE,GAAG,CAAC;CACT,CAAC;AAMF;;;;GAIG;AACH,MAAM,MAAM,IAAI,GAAG;IACjB,8EAA8E;IAC9E,CAAC,EAAE,KAAK,CAAC;IACT,8DAA8D;IAC9D,KAAK,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,EAAE,EAAE,GAAG,GAAG,IAAI,CAAC;IACf,qFAAqF;IACrF,OAAO,EAAE,OAAO,CAAC;IACjB,4FAA4F;IAC5F,WAAW,EAAE,OAAO,CAAC;IACrB,+EAA+E;IAC/E,IAAI,EAAE,OAAO,CAAC;IACd,oFAAoF;IACpF,IAAI,EAAE,OAAO,CAAC;IACd,iEAAiE;IACjE,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;;OAGG;IACH,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CACrB,CAAC;AAUF;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,CAQ3D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAOrD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAOpD;AAMD;;;;GAIG;AACH,eAAO,MAAM,eAAe,KAAK,CAAC;AAElC;;;;GAIG;AACH,eAAO,MAAM,WAAW,MAAO,CAAC"}