@knowvah/dot-engine 0.1.0

package/dist/layout/sfdp/sparse-matrix.d.ts

@@ -0,0 +1,101 @@
+/**
+ * SparseMatrix — the CSR/COORD matrix substrate of sfdp, ported from
+ * lib/sparse/SparseMatrix.c at the 15.0.0 tag.
+ *
+ * Only the REAL and PATTERN types used by the sfdp pipeline are
+ * ported (INTEGER paths are unreachable from sfdp_layout). Row entry
+ * ORDER is load-bearing: the mask-accumulator append order of
+ * add/multiply and the counting-sort order of from_coordinate_arrays
+ * feed float-summation order downstream — do not sort rows.
+ *
+ * Products: see sparse-matrix-multiply.ts.
+ *
+ * @see lib/sparse/SparseMatrix.c (15.0.0)
+ */
+/** @see lib/sparse/SparseMatrix.h:MATRIX_TYPE_* */
+export declare const MATRIX_TYPE_REAL: number;
+export declare const MATRIX_TYPE_PATTERN: number;
+/** @see lib/sparse/SparseMatrix.h: enum FORMAT_* */
+export declare const FORMAT_CSR = 0;
+export declare const FORMAT_COORD = 1;
+/**
+ * @see lib/sparse/SparseMatrix.h:SparseMatrix_struct
+ * In CSR format ia is the row pointer (m+1); in COORD it is the row
+ * index per entry.
+ */
+export interface SpMatrix {
+    m: number;
+    n: number;
+    nz: number;
+    type: number;
+    format: number;
+    ia: number[];
+    ja: number[];
+    /** Entry values; null for PATTERN. */
+    a: number[] | null;
+    isSymmetric: boolean;
+    isPatternSymmetric: boolean;
+}
+/** @see lib/sparse/SparseMatrix.c:SparseMatrix_new */
+export declare function smNew(m: number, n: number, type: number, format: number): SpMatrix;
+/**
+ * Append one COORD entry, growing m/n as needed.
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_coordinate_form_add_entry_
+ */
+export declare function smCoordAddEntry(A: SpMatrix, irn: number, jcn: number, val: number): void;
+/**
+ * COORD → CSR with repeated entries summed.
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_from_coordinate_format
+ */
+export declare function smFromCoordinateFormat(A: SpMatrix): SpMatrix;
+/**
+ * Coordinate arrays → CSR (counting sort by row; entry order within a
+ * row is input order), then repeated entries summed.
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_from_coordinate_arrays_internal
+ */
+export declare function smFromCoordinateArrays(nz: number, m: number, n: number, coords: {
+    irn: number[];
+    jcn: number[];
+    val: number[] | null;
+}, type: number): SpMatrix;
+/**
+ * Sum repeated entries within each row in place (first-occurrence
+ * positions keep the row order).
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_sum_repeat_entries
+ */
+export declare function smSumRepeatEntries(A: SpMatrix): SpMatrix;
+/** @see lib/sparse/SparseMatrix.c:SparseMatrix_transpose */
+export declare function smTranspose(A: SpMatrix): SpMatrix;
+/** @see lib/sparse/SparseMatrix.c:SparseMatrix_copy */
+export declare function smCopy(A: SpMatrix): SpMatrix;
+/**
+ * Symmetry test (REAL compares values to SYMMETRY_EPSILON); caches
+ * the result flags on A as in C.
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_is_symmetric
+ */
+export declare function smIsSymmetric(A: SpMatrix, patternOnly: boolean): boolean;
+/**
+ * A + Aᵀ unless already symmetric (then a copy). Row order = A's row
+ * entries first, then unmatched Aᵀ entries (mask-append).
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_symmetrize
+ */
+export declare function smSymmetrize(A: SpMatrix, patternSymmetricOnly: boolean): SpMatrix;
+/** C = A + B (mask-append row order). @see SparseMatrix.c:SparseMatrix_add */
+export declare function smAdd(A: SpMatrix, B: SpMatrix): SpMatrix;
+/** In-place diagonal removal. @see SparseMatrix.c:SparseMatrix_remove_diagonal */
+export declare function smRemoveDiagonal(A: SpMatrix): SpMatrix;
+/** @see lib/sparse/SparseMatrix.c:SparseMatrix_has_diagonal */
+export declare function smHasDiagonal(A: SpMatrix): boolean;
+/** a[row] /= degree(row). @see SparseMatrix.c:SparseMatrix_divide_row_by_degree */
+export declare function smDivideRowByDegree(A: SpMatrix): SpMatrix;
+/**
+ * Pattern-symmetrized adjacency with unit weights and no diagonal.
+ * @see SparseMatrix.c:SparseMatrix_get_real_adjacency_matrix_symmetrized
+ */
+export declare function smGetRealAdjacencySymmetrized(A: SpMatrix): SpMatrix;
+/**
+ * res = A·V for dense n×dim V (row-major).
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_multiply_dense
+ */
+export declare function smMultiplyDense(A: SpMatrix, v: number[], res: number[], dim: number): void;
+//# sourceMappingURL=sparse-matrix.d.ts.map

package/dist/layout/sfdp/sparse-matrix.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse-matrix.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/sparse-matrix.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AAEH,mDAAmD;AACnD,eAAO,MAAM,gBAAgB,QAAS,CAAC;AACvC,eAAO,MAAM,mBAAmB,QAAS,CAAC;AAE1C,oDAAoD;AACpD,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,eAAO,MAAM,YAAY,IAAI,CAAC;AAK9B;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,sCAAsC;IACtC,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,kBAAkB,EAAE,OAAO,CAAC;CAC7B;AAED,sDAAsD;AACtD,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,QAAQ,CASlF;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAOxF;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAG5D;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAChC,MAAM,EAAE;IAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IAAC,GAAG,EAAE,MAAM,EAAE,CAAC;IAAC,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;CAAE,EAC9D,IAAI,EAAE,MAAM,GACX,QAAQ,CAIV;AA4BD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAuBxD;AAED,4DAA4D;AAC5D,wBAAgB,WAAW,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAwBjD;AAED,uDAAuD;AACvD,wBAAgB,MAAM,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAQ5C;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,GAAG,OAAO,CAYxE;AA4BD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,oBAAoB,EAAE,OAAO,GAAG,QAAQ,CAOjF;AAED,8EAA8E;AAC9E,wBAAgB,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAYxD;AA2BD,kFAAkF;AAClF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAoBtD;AAED,+DAA+D;AAC/D,wBAAgB,aAAa,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO,CAOlD;AAED,mFAAmF;AACnF,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAUzD;AAED;;;GAGG;AACH,wBAAgB,6BAA6B,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAUnE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAW1F"}

package/dist/layout/sfdp/sparse-solve.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Jacobi-preconditioned conjugate gradient over a SparseMatrix — the solver
+ * used by the stress-majorization smoothers.
+ *
+ * @see lib/sfdpgen/sparse_solve.c
+ */
+import type { SpMatrix } from './sparse-matrix.js';
+/**
+ * Solve A x = rhs per dimension with CG; the solution replaces rhs
+ * (matching the C convention: x0 holds initial guesses, rhs the result).
+ * @see lib/sfdpgen/sparse_solve.c:SparseMatrix_solve
+ */
+export declare function smSolve(A: SpMatrix, dim: number, x0: number[], rhs: number[], tol: number, maxit: number): number;
+//# sourceMappingURL=sparse-solve.d.ts.map

package/dist/layout/sfdp/sparse-solve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse-solve.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/sparse-solve.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAuFnD;;;;GAIG;AACH,wBAAgB,OAAO,CACrB,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EACrD,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GACzB,MAAM,CAiBR"}

package/dist/layout/sfdp/spring-driver.d.ts

@@ -0,0 +1,18 @@
+import { type SpMatrix } from './sparse-matrix.js';
+import { type SpringElectricalControl } from './spring-electrical.js';
+/** @see lib/sfdpgen/spring_electrical.c:power_law_graph */
+export declare function powerLawGraph(A: SpMatrix): boolean;
+/**
+ * Principal-component rotation about the centroid.
+ * @see lib/sfdpgen/spring_electrical.c:pcp_rotate
+ */
+export declare function pcpRotate(n: number, dim: number, x: number[]): void;
+/**
+ * Coarsen, embed coarsest-to-finest with prolongation, rotate to the
+ * principal axis, and apply the overlap scaling.
+ * The edge-label-scheme path is not ported (no |edgelabel| nodes in
+ * any supported input).
+ * @see lib/sfdpgen/spring_electrical.c:multilevel_spring_electrical_embedding
+ */
+export declare function multilevelSpringElectricalEmbedding(dim: number, A0: SpMatrix, ctrl: SpringElectricalControl, labelSizes: number[] | null, x: number[]): void;
+//# sourceMappingURL=spring-driver.d.ts.map

package/dist/layout/sfdp/spring-driver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spring-driver.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/spring-driver.ts"],"names":[],"mappings":"AAeA,OAAO,EACL,KAAK,QAAQ,EAMd,MAAM,oBAAoB,CAAC;AAO5B,OAAO,EACL,KAAK,uBAAuB,EAG7B,MAAM,wBAAwB,CAAC;AAOhC,2DAA2D;AAC3D,wBAAgB,aAAa,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO,CAclD;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAiCnE;AAqDD;;;;;;GAMG;AACH,wBAAgB,mCAAmC,CACjD,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,uBAAuB,EACxD,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,GACvC,IAAI,CAmDN"}

package/dist/layout/sfdp/spring-electrical.d.ts

@@ -0,0 +1,61 @@
+import { type SpMatrix } from './sparse-matrix.js';
+/** @see lib/sfdpgen/spring_electrical.h:AUTOP */
+export declare const AUTOP = -1.0001234;
+/** @see lib/sfdpgen/spring_electrical.h: QUAD_TREE_* */
+export declare const QUAD_TREE_NONE = 0;
+export declare const QUAD_TREE_NORMAL = 1;
+export declare const QUAD_TREE_FAST = 2;
+export declare const QUAD_TREE_HYBRID = 3;
+/** @see lib/sfdpgen/spring_electrical.h:spring_electrical_control */
+export interface SpringElectricalControl {
+    p: number;
+    K: number;
+    multilevels: number;
+    maxQtreeLevel: number;
+    maxiter: number;
+    step: number;
+    randomSeed: number;
+    randomStart: boolean;
+    adaptiveCooling: boolean;
+    beautifyLeaves: boolean;
+    smoothing: number;
+    overlap: number;
+    doShrinking: boolean;
+    tscheme: number;
+    initialScaling: number;
+    rotation: number;
+    edgeLabelingScheme: number;
+}
+/** @see lib/sfdpgen/spring_electrical.c:spring_electrical_control_new */
+export declare function springElectricalControlNew(): SpringElectricalControl;
+/** @see lib/sfdpgen/spring_electrical.c:oned_optimizer */
+export interface OnedOptimizer {
+    i: number;
+    work: number[];
+    direction: number;
+}
+/** @see spring_electrical.c:oned_optimizer_new */
+export declare function onedOptimizerNew(i: number): OnedOptimizer;
+/** @see spring_electrical.c:oned_optimizer_train */
+export declare function onedOptimizerTrain(opt: OnedOptimizer, work: number): void;
+/** @see lib/sparse/general.c:distance */
+export declare function distance(x: number[], dim: number, i: number, j: number): number;
+/** @see lib/sparse/general.c:distance_cropped */
+export declare function distanceCropped(x: number[], dim: number, i: number, j: number): number;
+/**
+ * Reposition every degree-1 leaf radially around its parent at the parent's
+ * average leaf distance, evenly fanned over `[pad, 2π−pad]` (pad = 0.1). Each
+ * parent is processed once. Assumes A has no diagonal (guaranteed upstream).
+ * @see lib/sfdpgen/spring_electrical.c:beautify_leaves
+ */
+export declare function beautifyLeaves(dim: number, A: SpMatrix, x: number[]): void;
+/** @see lib/sfdpgen/spring_electrical.c:average_edge_length */
+export declare function averageEdgeLength(A: SpMatrix, dim: number, coord: number[]): number;
+/**
+ * The NORMAL-scheme embedding: per-node attract + repulse (direct or
+ * Barnes–Hut above QUADTREE_SIZE), normalized move, adaptive cooling.
+ * Mutates ctrl.K/p/maxQtreeLevel as the C does.
+ * @see lib/sfdpgen/spring_electrical.c:spring_electrical_embedding
+ */
+export declare function springElectricalEmbedding(dim: number, A0: SpMatrix, ctrl: SpringElectricalControl, x: number[]): void;
+//# sourceMappingURL=spring-electrical.d.ts.map

package/dist/layout/sfdp/spring-electrical.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spring-electrical.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/spring-electrical.ts"],"names":[],"mappings":"AAwBA,OAAO,EACL,KAAK,QAAQ,EAEd,MAAM,oBAAoB,CAAC;AAG5B,iDAAiD;AACjD,eAAO,MAAM,KAAK,aAAa,CAAC;AAEhC,wDAAwD;AACxD,eAAO,MAAM,cAAc,IAAI,CAAC;AAChC,eAAO,MAAM,gBAAgB,IAAI,CAAC;AAClC,eAAO,MAAM,cAAc,IAAI,CAAC;AAChC,eAAO,MAAM,gBAAgB,IAAI,CAAC;AAelC,qEAAqE;AACrE,MAAM,WAAW,uBAAuB;IACtC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,eAAe,EAAE,OAAO,CAAC;IACzB,cAAc,EAAE,OAAO,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,OAAO,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED,yEAAyE;AACzE,wBAAgB,0BAA0B,IAAI,uBAAuB,CAoBpE;AAYD,0DAA0D;AAC1D,MAAM,WAAW,aAAa;IAC5B,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,kDAAkD;AAClD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,CAEzD;AA8BD,oDAAoD;AACpD,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAKzE;AAMD,yCAAyC;AACzC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAO/E;AAED,iDAAiD;AACjD,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEtF;AA0BD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAoB1E;AAED,+DAA+D;AAC/D,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAenF;AA6JD;;;;;GAKG;AACH,wBAAgB,yBAAyB,CACvC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,uBAAuB,EAAE,CAAC,EAAE,MAAM,EAAE,GACpE,IAAI,CAuBN"}

package/dist/layout/twopi/circle.d.ts

@@ -0,0 +1,83 @@
+/**
+ * Seven-phase radial layout algorithm for the twopi engine.
+ * Ports lib/twopigen/circle.c.
+ *
+ * @see lib/twopigen/circle.c
+ * @see lib/twopigen/circle.h
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+/** Minimum per-ring delta. @see lib/common/render.h:MIN_RANKSEP */
+export declare const MIN_RANKSEP = 0.02;
+/**
+ * Return true if n is a leaf: at most one distinct neighbor.
+ * @see lib/twopigen/circle.c:isLeaf
+ */
+export declare function isLeaf(g: Graph, n: Node): boolean;
+/**
+ * Phase 1: initialize all rdata fields before BFS passes.
+ * @see lib/twopigen/circle.c:initLayout
+ */
+export declare function initLayout(g: Graph): void;
+/**
+ * DFS to propagate leaf distance outward from n.
+ * @see lib/twopigen/circle.c:setNStepsToLeaf
+ */
+export declare function setNStepsToLeaf(g: Graph, n: Node, prev: Node | null): void;
+/**
+ * Phase 2: find center node (max nStepsToLeaf).
+ * @see lib/twopigen/circle.c:findCenterNode
+ */
+export declare function findCenterNode(g: Graph): Node | null;
+/**
+ * BFS from n assigning SCENTER and SPARENT; skips weight=0 edges.
+ * @see lib/twopigen/circle.c:setNStepsToCenter
+ */
+export declare function setNStepsToCenter(g: Graph, n: Node): void;
+/**
+ * Phase 3: BFS from center; returns max ring index or MAX_SAFE_INTEGER.
+ * @see lib/twopigen/circle.c:setParentNodes
+ */
+export declare function setParentNodes(sg: Graph, center: Node): number;
+/**
+ * Phase 4: count BFS-leaves in each subtree bottom-up.
+ * @see lib/twopigen/circle.c:setSubtreeSize
+ */
+export declare function setSubtreeSize(g: Graph): void;
+/**
+ * Recursively partition a node's angular span among its children.
+ * @see lib/twopigen/circle.c:setChildSubtreeSpans
+ */
+export declare function setChildSubtreeSpans(g: Graph, n: Node): void;
+/**
+ * Phase 5: root gets 2π span; children get proportional shares.
+ * @see lib/twopigen/circle.c:setSubtreeSpans
+ */
+export declare function setSubtreeSpans(sg: Graph, center: Node): void;
+/**
+ * Assign theta (angular midpoint) to each child of n in a fan.
+ * @see lib/twopigen/circle.c:setChildPositions
+ */
+export declare function setChildPositions(sg: Graph, n: Node): void;
+/**
+ * Phase 6: assign angular positions; root gets theta = 0.
+ * @see lib/twopigen/circle.c:setPositions
+ */
+export declare function setPositions(sg: Graph, center: Node): void;
+/**
+ * Build cumulative radius array from ranksep attribute.
+ * @see lib/twopigen/circle.c:getRankseps
+ */
+export declare function getRankseps(g: Graph, maxrank: number): number[];
+/**
+ * Phase 7: polar → Cartesian; writes to n.info.pos.
+ * @see lib/twopigen/circle.c:setAbsolutePos
+ */
+export declare function setAbsolutePos(g: Graph, maxrank: number): void;
+/**
+ * Run the full seven-phase radial layout on a connected subgraph.
+ * Returns the center node used; null only if the graph is empty.
+ * @see lib/twopigen/circle.c:circleLayout
+ */
+export declare function circleLayout(sg: Graph, center: Node | null): Node | null;
+//# sourceMappingURL=circle.d.ts.map

package/dist/layout/twopi/circle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"circle.d.ts","sourceRoot":"","sources":["../../../src/layout/twopi/circle.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAQhD,mEAAmE;AACnE,eAAO,MAAM,WAAW,OAAO,CAAC;AA6BhC;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CASjD;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAczC;AAWD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,CAM1E;AAaD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,IAAI,CAWpD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAYzD;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,MAAM,CAa9D;AAWD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAO7C;AAcD;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAQ5D;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,CAG7D;AAeD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAO1D;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,CAG1D;AAyBD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAU/D;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAS9D;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAiBxE"}

package/dist/layout/twopi/index.d.ts

@@ -0,0 +1,24 @@
+/**
+ * twopi radial layout engine — public entry point.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_layout
+ */
+import type { Graph } from '../../model/graph.js';
+import type { LayoutEngine } from '../../gvc/context.js';
+export { twopiInitGraph, twopiCleanup, findRootNode, adjustNodes, finaliseCoords, } from './init.js';
+export { circleLayout, isLeaf, initLayout } from './circle.js';
+export { THETA_UNSET } from '../../model/nodeInfo.js';
+/**
+ * Full twopi layout pipeline for a graph.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_layout
+ */
+export declare function twopiLayout(g: Graph): void;
+/**
+ * LayoutEngine descriptor for registration with GvcContext.
+ *
+ * @see lib/gvc/gvcext.h:gvlayout_engine_s
+ * @see lib/twopigen/twopiinit.c (plugin wiring)
+ */
+export declare const TWOPI_LAYOUT_ENGINE: LayoutEngine;
+//# sourceMappingURL=index.d.ts.map

package/dist/layout/twopi/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/twopi/index.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAUzD,OAAO,EACL,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,cAAc,GACf,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAEtD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CA+B1C;AAED;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,EAAE,YAIjC,CAAC"}

package/dist/layout/twopi/init.d.ts

@@ -0,0 +1,85 @@
+/**
+ * twopi engine initialisation: per-node/edge init, graph init, cleanup.
+ * Ports lib/twopigen/twopiinit.c: twopi_init_node_edge, twopi_init_graph,
+ * findRootNode, twopi_cleanup.
+ *
+ * @see lib/twopigen/twopiinit.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+/**
+ * Initialize a node for twopi layout: ensure pos[0..1] exist, set defaults.
+ * Mirrors neato_init_node for the twopi engine.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_init_node_edge (neato_init_node call)
+ */
+export declare function twopiInitNode(n: Node): void;
+/**
+ * Initialize an edge for twopi layout: set ED_factor from weight attribute.
+ * Default weight 1.0; minimum 0.0.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_init_edge
+ */
+export declare function twopiInitEdge(e: Edge): void;
+/**
+ * Initialize all nodes and edges in g for twopi layout.
+ *
+ * Mirrors the C twopi_init_node_edge: allocates a contiguous rdata block
+ * (one TwopiAlgData per node), populates GD_neato_nlist, assigns ND_alg,
+ * then initialises every out-edge.
+ *
+ * The contiguous-allocation semantics are preserved: all TwopiAlgData objects
+ * are created here in one pass (matching gv_calloc(n_nodes, sizeof(rdata))),
+ * so twopiCleanup can mirror the C free(ND_alg(first_node)) by nulling only
+ * the first node's alg field.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_init_node_edge
+ */
+export declare function twopiInitNodeEdge(g: Graph): void;
+/**
+ * Full graph initialisation: set edge type to line, force 2D, init nodes/edges.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_init_graph
+ */
+export declare function twopiInitGraph(g: Graph): void;
+/**
+ * Scan sg for the first node whose `root` attribute is truthy.
+ * Returns null if no such node exists.
+ *
+ * @see lib/twopigen/twopiinit.c:findRootNode
+ */
+export declare function findRootNode(sg: Graph): Node | null;
+/**
+ * Convert pos (inches) to coord (points) for every node in g.
+ * Matches the neatoSetAspect / dotneato_postprocess coordinate finalisation.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_layout (post-layout coord write)
+ * @see lib/neatogen/neatoinit.c:neatoSetAspect
+ */
+export declare function finaliseCoords(g: Graph): void;
+/**
+ * Overlap adjustment: scale-family modes via scAdjust, PRISM (the GTS
+ * build's resolution of overlap=false / unrecognized values) via
+ * fdpAdjust; remaining modes (voronoi, vpsc, ortho*) are unported no-ops.
+ *
+ * @see lib/neatogen/adjust.c:adjustNodes
+ * @see lib/neatogen/constraint.c:scAdjust
+ */
+export declare function adjustNodes(g: Graph): void;
+/**
+ * Release twopi-specific per-node state after layout.
+ *
+ * Mirrors the C twopi_layout cleanup: free(ND_alg(first_node)) / ND_alg = NULL
+ * on the FIRST node only (the contiguous block was allocated as a single unit).
+ * Other nodes' ND_alg pointers were interior offsets into that block so they
+ * do not need to be freed separately.
+ *
+ * ORDERING: must be called BEFORE splineEdges because edge routing may
+ * store its own data in n.info.alg.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_layout (free(ND_alg) placement note)
+ * @see lib/twopigen/twopiinit.c:twopi_cleanup
+ */
+export declare function twopiCleanup(g: Graph): void;
+//# sourceMappingURL=init.d.ts.map

package/dist/layout/twopi/init.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../../../src/layout/twopi/init.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AA6BhD;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI3C;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI3C;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAchD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAO7C;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,GAAG,IAAI,CAMnD;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAS7C;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAE1C;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAM3C"}

package/dist/layout/twopi/pipeline.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Internal pipeline helpers for the twopi layout engine.
+ * Isolated from index.ts so lizard can parse each function boundary cleanly.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_layout
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { PackInfo } from '../pack/index.js';
+/** Margin constant matching C CL_OFFSET. @see lib/pack/pack.h:CL_OFFSET */
+export declare const CL_OFFSET = 8;
+/** circleLayout return type; Node | null. */
+export type Center = Node | null;
+/** Add only edges whose both endpoints belong to sg. */
+export declare function induceEdges(g: Graph, sg: Graph): void;
+/** Prefer globalRoot if it is in sg; otherwise scan for root attribute. */
+export declare function resolveCenter(sg: Graph, globalRoot: Center): Center;
+/** Lay out one component; return the chosen center node. */
+export declare function layoutComponent(g: Graph, sg: Graph, globalRoot: Center): Center;
+/**
+ * Build a PackInfo for multi-component packing.
+ *
+ * @see lib/twopigen/twopiinit.c:twopi_layout (getPackInfo call with l_node)
+ */
+export declare function buildPackInfo(g: Graph): PackInfo;
+/** Single-component pipeline: layout → cleanup → splines → coords. */
+export declare function layoutSingle(g: Graph, comps: Graph[], globalRoot: Center, setRoot: boolean): void;
+/**
+ * Multi-component pipeline: per-component layout + coords, then cleanup,
+ * pack, re-sync coords, splines.
+ *
+ * finaliseCoords per component runs BEFORE packSubgraphs so that
+ * computeSubgraphBB reads real point-coords for bounding-box calculation.
+ * After packing shifts pos (inches), finaliseCoords re-syncs coord.
+ */
+export declare function layoutMulti(g: Graph, comps: Graph[], globalRoot: Center, pinfo: PackInfo): void;
+//# sourceMappingURL=pipeline.d.ts.map

package/dist/layout/twopi/pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../../src/layout/twopi/pipeline.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAWjD,2EAA2E;AAC3E,eAAO,MAAM,SAAS,IAAI,CAAC;AAE3B,6CAA6C;AAC7C,MAAM,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;AAEjC,wDAAwD;AACxD,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAIrD;AAED,2EAA2E;AAC3E,wBAAgB,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAGnE;AAED,4DAA4D;AAC5D,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAM/E;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAShD;AAED,sEAAsE;AACtE,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAUjG;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,IAAI,CAU/F"}

package/dist/layout/twopi/twopi-test-helpers.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Shared test fixtures for twopi layout tests.
+ * Kept in a separate file so lizard does not conflate helper function spans
+ * with the describe() callbacks that follow them in the test file.
+ */
+import { Graph } from '../../model/graph.js';
+import { Node } from '../../model/node.js';
+export declare function h_node(g: Graph, name: string): Node;
+export declare function h_edge(g: Graph, t: Node, h: Node): void;
+export declare function makeStar(leaves: number): Graph;
+export declare function makeTwoTriangles(): Graph;
+//# sourceMappingURL=twopi-test-helpers.d.ts.map

package/dist/layout/twopi/twopi-test-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"twopi-test-helpers.d.ts","sourceRoot":"","sources":["../../../src/layout/twopi/twopi-test-helpers.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAM3C,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAMnD;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAEvD;AAED,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAM9C;AAED,wBAAgB,gBAAgB,IAAI,KAAK,CAQxC"}

package/dist/model/algData.d.ts

@@ -0,0 +1,175 @@
+/**
+ * Per-engine algorithm data — discriminated union (AD-7).
+ *
+ * In C, ND_alg is a void* that each layout engine casts to its own private
+ * struct. TypeScript uses a discriminated union so the kind discriminant is
+ * statically knowable and no unsafe casts are needed. Each engine's batch
+ * adds its concrete fields; the `kind` discriminant is the only required
+ * field now. Split out of nodeInfo.ts to keep that file under the size cap.
+ *
+ * @see lib/common/types.h:Agnodeinfo_t:alg (ND_alg)
+ */
+import type { Graph } from './graph.js';
+import type { Node } from './node.js';
+/**
+ * Layout-engine algorithm data stored in ND_alg for the dot engine.
+ *
+ * @see lib/dotgen/ — dot-engine algorithm data
+ */
+export interface DotAlgData {
+    readonly kind: 'dot';
+}
+/**
+ * Layout-engine algorithm data stored in ND_alg for the neato engine.
+ *
+ * @see lib/neatogen/ — neato-engine algorithm data
+ */
+export interface NeatoAlgData {
+    readonly kind: 'neato';
+}
+/**
+ * fdp data for REAL (input-graph) nodes.
+ *
+ * C stores DNODE in ND_next and PARENT in ND_clust (dot fields reused);
+ * here both live in the alg record together with the numeric ND_pinned
+ * state (P_SET/P_FIX/P_PIN), which the boolean NodeInfo.pinned cannot
+ * represent.
+ *
+ * @see lib/fdpgen/fdp.h:DNODE / PARENT
+ */
+export interface FdpAlgData {
+    readonly kind: 'fdp';
+    /** Derived node for this real node. @see lib/fdpgen/fdp.h:DNODE */
+    dnode: Node | null;
+    /** Smallest containing cluster. @see lib/fdpgen/fdp.h:PARENT */
+    parent: Graph | null;
+    /** ND_pinned P_* state. @see lib/common/const.h:P_SET */
+    pinned: number;
+}
+/**
+ * fdp data for DERIVED-graph nodes (dndata in C).
+ *
+ * @see lib/fdpgen/fdp.h:dndata
+ */
+export interface FdpDndata {
+    readonly kind: 'fdp-dndata';
+    /** Degree of node. @see lib/fdpgen/fdp.h:DEG */
+    deg: number;
+    /** Weighted degree of node. @see lib/fdpgen/fdp.h:WDEG */
+    wdeg: number;
+    /** Real node if not a cluster. @see lib/fdpgen/fdp.h:ANODE */
+    dn: Node | null;
+    /** Cluster in real graph, for cluster nodes. @see lib/common/types.h:ND_clust */
+    clust: Graph | null;
+    /** Incremental displacement. @see lib/fdpgen/fdp.h:DISP */
+    disp: [number, number];
+    /** ND_pinned P_* state. @see lib/common/const.h:P_SET */
+    pinned: number;
+}
+/**
+ * Per-node init data for the circo engine (ndata in C).
+ * Stored in ND_alg on original-graph nodes during Pass 0.
+ * @see lib/circogen/circular.h:ndata
+ */
+export interface CircoNData {
+    readonly kind: 'circo-ndata';
+    dnode: unknown;
+}
+/**
+ * Rich per-node layout data for the circo engine (cdata in C).
+ * Stored in ND_alg on derived-graph nodes across Passes 1–4.
+ * @see lib/circogen/circular.h:cdata
+ */
+export interface CircoCData {
+    readonly kind: 'circo-cdata';
+    flags: number;
+    parent: unknown;
+    block: unknown;
+    bc: {
+        val: number;
+        lowVal: number;
+    };
+    clone: unknown;
+    tparent: unknown;
+    leafone: unknown;
+    leaftwo: unknown;
+    fdist: number;
+    sdist: number;
+    pos: number;
+    psi: number;
+    degree: number;
+    derivedNode: unknown;
+}
+/**
+ * Sentinel value for an unset theta (angular position).
+ * Valid theta values are in [0, 2π]; 10.0 is outside this range.
+ *
+ * @see lib/twopigen/circle.c:#define UNSET 10.00
+ */
+export declare const THETA_UNSET = 10;
+/**
+ * Per-node radial layout data for the twopi engine.
+ *
+ * Mirrors the `rdata` struct in lib/twopigen/circle.h. All fields are zeroed
+ * at allocation time (gv_calloc equivalent). theta is set to THETA_UNSET
+ * (10.0) by initLayout; nStepsToCenter is set to n² as the INF sentinel.
+ *
+ * @see lib/twopigen/circle.h:rdata
+ * @see lib/twopigen/circle.c:initLayout
+ */
+export interface TwopiAlgData {
+    readonly kind: 'twopi';
+    /** BFS distance to nearest leaf. @see lib/twopigen/circle.h:rdata:nStepsToLeaf (SLEAF) */
+    nStepsToLeaf: number;
+    /** Leaf count in BFS subtree. @see lib/twopigen/circle.h:rdata:subtreeSize (STSIZE) */
+    subtreeSize: number;
+    /** Number of BFS children. @see lib/twopigen/circle.h:rdata:nChildren (NCHILD) */
+    nChildren: number;
+    /**
+     * BFS distance from root (ring index). n² = INF sentinel.
+     * @see lib/twopigen/circle.h:rdata:nStepsToCenter (SCENTER)
+     */
+    nStepsToCenter: number;
+    /** BFS parent pointer; null for root. @see lib/twopigen/circle.h:rdata:parent (SPARENT) */
+    parent: Node | null;
+    /** Angular span in radians. @see lib/twopigen/circle.h:rdata:span (SPAN) */
+    span: number;
+    /**
+     * Angular midpoint in radians. THETA_UNSET (10.0) until assigned.
+     * @see lib/twopigen/circle.h:rdata:theta (THETA)
+     */
+    theta: number;
+}
+/**
+ * Layout-engine algorithm data stored in ND_alg for the osage engine.
+ *
+ * ND_alg(n) is repurposed as a cluster-ownership marker during layout():
+ * when a node is claimed by a cluster, alg is set to an OsageAlgData
+ * with ownerCluster pointing to that cluster. Unclaimed nodes have
+ * alg === undefined.
+ *
+ * @see lib/osage/osageinit.c:PARENT macro
+ */
+export interface OsageAlgData {
+    readonly kind: 'osage';
+    /** The cluster graph that owns this node. @see lib/osage/osageinit.c:ND_alg usage */
+    readonly ownerCluster: Graph;
+}
+/**
+ * Layout-engine algorithm data stored in ND_alg for the patchwork engine.
+ *
+ * @see lib/patchwork/ — patchwork-engine algorithm data
+ */
+export interface PatchworkAlgData {
+    readonly kind: 'patchwork';
+}
+/**
+ * Discriminated union of all per-engine algorithm data structs stored in
+ * Agnodeinfo_t.alg (ND_alg). Each layout engine stores a different struct
+ * in the C void*; here the `kind` discriminant makes the active engine
+ * statically knowable without unsafe casting.
+ *
+ * @see lib/common/types.h:Agnodeinfo_t:alg (ND_alg)
+ */
+export type NodeAlgData = DotAlgData | NeatoAlgData | FdpAlgData | FdpDndata | CircoNData | CircoCData | TwopiAlgData | OsageAlgData | PatchworkAlgData;
+//# sourceMappingURL=algData.d.ts.map