@knowvah/dot-engine 0.1.0

package/dist/layout/dot/mincross.d.ts

@@ -0,0 +1,75 @@
+/**
+ * TypeScript port of lib/dotgen/mincross.c — entry point, init, merge,
+ * cleanup, vlist helpers, virtualWeight, and mincrossOptions.
+ * Shared utilities live in mincross-utils.ts; crossing computations in
+ * mincross-cross.ts; ordering in mincross-order.ts; rank building in
+ * mincross-build.ts.
+ *
+ * @see lib/dotgen/mincross.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import { MincrossContext, dotRoot, rankGet, agContainsNode, agContainsEdge } from './mincross-utils.js';
+export type { MincrossContext };
+export { dotRoot, agContainsNode, agContainsEdge, rankGet };
+export { CONVERGENCE, matrixGet, matrixSet, newMatrix, matrixCopyBits, insideCluster, isNormalNodeOf, isVnodeOfEdgeOf, neighborNode, furthestNode, rankSet, } from './mincross-utils.js';
+export declare function endpointClass(n: Node): number;
+/** @see lib/dotgen/mincross.c:virtual_weight */
+export declare function virtualWeight(e: Edge): void;
+/** @see lib/dotgen/mincross.c:mincross_options */
+export declare function mincrossOptions(ctx: MincrossContext, g: Graph): void;
+/** @see lib/dotgen/mincross.c:save_vlist */
+export declare function saveVlist(g: Graph): void;
+/** @see lib/dotgen/mincross.c:rec_save_vlists */
+export declare function recSaveVlists(g: Graph): void;
+/** @see lib/dotgen/mincross.c:rec_reset_vlists */
+export declare function recResetVlists(ctx: Pick<MincrossContext, 'root'>, g: Graph): void;
+/** @see lib/dotgen/mincross.c:reset_vlists */
+export declare function resetVlistRanks(ctx: Pick<MincrossContext, 'root'>, g: Graph): void;
+/** @see lib/dotgen/mincross.c:reset_vlist */
+export declare function applyVlistReset(ctx: Pick<MincrossContext, 'root'>, g: Graph, r: number): void;
+/** @see lib/dotgen/mincross.c:init_mincross */
+export declare function initMincross(ctx: MincrossContext, g: Graph): void;
+/** @see lib/dotgen/mincross.c:init_mccomp */
+export declare function initMccomp(g: Graph, c: number): void;
+/** @see lib/dotgen/mincross.c:merge_components */
+export declare function mergeComponents(ctx: MincrossContext, g: Graph): void;
+/** @see lib/dotgen/mincross.c:merge2 */
+export declare function merge2(ctx: MincrossContext, g: Graph): void;
+/** @see lib/dotgen/mincross.c:cleanup2 */
+export declare function cleanup2(ctx: MincrossContext, g: Graph): void;
+/** @see lib/dotgen/mincross.c:cleanup2 (rank loop) */
+export declare function cleanup2Ranks(g: Graph): void;
+/** @see lib/dotgen/mincross.c:cleanup2 (flatorder removal) */
+export declare function removeFlatorderEdges(v: Node): void;
+/** @see lib/dotgen/mincross.c:mincross_clust */
+export declare function mincrossClust(ctx: MincrossContext, g: Graph): number;
+/** @see lib/dotgen/mincross.c:dot_mincross */
+/**
+ * Drop clusters with no member nodes before crossing/expansion.
+ *
+ * C `dot_mincross` removes empty clusters up front (only parse-time-empty
+ * "malformed input" clusters reach that point). The port must run it *after*
+ * `initMincross` because a node referenced in several clusters is pruned to its
+ * first cluster by `mark_clusters` agdelete (defect A) during init — emptying
+ * the later clusters. The port then *must* drop them: `merge_ranks` aliases each
+ * cluster's `rank[r].v` into the shared root rank array (vStart), so expanding an
+ * empty cluster clobbers the slot a sibling cluster just filled (e.g. 1221/2721:
+ * one node in two clusters → node lost, `rank.v[0]` null → position crash). C is
+ * immune because it installs from the root node list, not cluster membership.
+ * An empty cluster has no bbox and is not drawn, so dropping it matches C output.
+ *
+ * @see lib/dotgen/mincross.c:dot_mincross (empty-cluster removal loop)
+ */
+export declare function removeEmptyClusters(g: Graph): void;
+export declare function dotMincross(g: Graph): number;
+/** @see lib/dotgen/mincross.c:dot_mincross (component loop) */
+export declare function runComponents(ctx: MincrossContext, g: Graph, comp: Node[]): number;
+/** @see lib/dotgen/mincross.c:dot_mincross (cluster loop) */
+export declare function runClusters(ctx: MincrossContext, g: Graph): number;
+/** @see lib/dotgen/mincross.c:dot_mincross (remincross) */
+export declare function runRemincross(ctx: MincrossContext, g: Graph, nc: number): number;
+/** @see lib/dotgen/mincross.c:dot_mincross (context init) */
+export declare function makeMincrossCtx(g: Graph): MincrossContext;
+//# sourceMappingURL=mincross.d.ts.map

package/dist/layout/dot/mincross.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mincross.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/mincross.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;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;AAIhD,OAAO,EACL,eAAe,EAAE,OAAO,EAAgB,OAAO,EAC/C,cAAc,EAAE,cAAc,EAC/B,MAAM,qBAAqB,CAAC;AAQ7B,YAAY,EAAE,eAAe,EAAE,CAAC;AAChC,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC;AAC5D,OAAO,EACL,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EAC5D,aAAa,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,EAC5D,YAAY,EAAE,OAAO,GACtB,MAAM,qBAAqB,CAAC;AAgB7B,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAI7C;AAED,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAG3C;AAMD,kDAAkD;AAClD,wBAAgB,eAAe,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAWpE;AAMD,4CAA4C;AAC5C,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAcxC;AAED,iDAAiD;AACjD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAM5C;AAED,kDAAkD;AAClD,wBAAgB,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAKjF;AAED,8CAA8C;AAC9C,wBAAgB,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAIlF;AAED,6CAA6C;AAC7C,wBAAgB,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAiB7F;AAMD,+CAA+C;AAC/C,wBAAgB,YAAY,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAejE;AAED,6CAA6C;AAC7C,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAepD;AAMD,kDAAkD;AAClD,wBAAgB,eAAe,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAcpE;AAED,wCAAwC;AACxC,wBAAgB,MAAM,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAe3D;AAMD,0CAA0C;AAC1C,wBAAgB,QAAQ,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAO7D;AAED,sDAAsD;AACtD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAY5C;AAED,8DAA8D;AAC9D,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CASlD;AAMD,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAkBpE;AAMD,8CAA8C;AAC9C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAOlD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAgB5C;AAED,+DAA+D;AAC/D,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,CASlF;AAED,6DAA6D;AAC7D,wBAAgB,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAWlE;AAED,2DAA2D;AAC3D,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAWhF;AAED,6DAA6D;AAC7D,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,eAAe,CAKzD"}

package/dist/layout/dot/ns-core.d.ts

@@ -0,0 +1,37 @@
+/** @see lib/common/ns.c — types, constants, tree-list helpers */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Graph } from '../../model/graph.js';
+import type { EdgeList } from '../../model/nodeInfo.js';
+/** @see lib/common/ns.c:network_simplex_ctx_t */
+export interface NsCtx {
+    g: Graph;
+    treeEdges: Edge[];
+    sI: number;
+    nEdges: number;
+    nNodes: number;
+    searchSize: number;
+}
+/** @see lib/common/ns.c:SEARCHSIZE */
+export declare const SEARCHSIZE = 30;
+/** Normal node type. @see lib/common/types.h */
+export declare const NORMAL = 0;
+/** LENGTH(e) = rank(head) - rank(tail). @see lib/common/ns.c */
+export declare function nsLength(e: Edge): number;
+/** SLACK(e) = LENGTH(e) - minlen(e). @see lib/common/ns.c */
+export declare function nsSlack(e: Edge): number;
+/** TREE_EDGE(e): tree_index >= 0. @see lib/common/ns.c */
+export declare function isTreeEdge(e: Edge): boolean;
+/** SEQ(a,b,c): a<=b && b<=c. @see lib/common/ns.c */
+export declare function seq(a: number, b: number, c: number): boolean;
+/** Append e to an EdgeList. @see lib/dotgen/fastgr.c:elistAppend */
+export declare function treeAppend(el: EdgeList, e: Edge): void;
+/** Swap-last-remove of e from an EdgeList. @see lib/dotgen/fastgr.c:zapinlist */
+export declare function treeRemoveEdge(el: EdgeList, e: Edge): void;
+/** @see lib/common/ns.c:add_tree_edge */
+export declare function addTreeEdge(ctx: NsCtx, e: Edge): number;
+/** @see lib/common/ns.c:invalidate_path */
+export declare function invalidatePath(lca: Node, toNode: Node): void;
+/** @see lib/common/ns.c:exchange_tree_edges */
+export declare function exchangeTreeEdges(ctx: NsCtx, e: Edge, f: Edge): void;
+//# sourceMappingURL=ns-core.d.ts.map

package/dist/layout/dot/ns-core.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ns-core.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/ns-core.ts"],"names":[],"mappings":"AACA,iEAAiE;AACjE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAMxD,iDAAiD;AACjD,MAAM,WAAW,KAAK;IACpB,CAAC,EAAE,KAAK,CAAC;IACT,SAAS,EAAE,IAAI,EAAE,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAMD,sCAAsC;AACtC,eAAO,MAAM,UAAU,KAAK,CAAC;AAE7B,gDAAgD;AAChD,eAAO,MAAM,MAAM,IAAI,CAAC;AAMxB,gEAAgE;AAChE,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAExC;AAED,6DAA6D;AAC7D,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+C;AAEvF,0DAA0D;AAC1D,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAA2C;AAEvF,qDAAqD;AACrD,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAA6B;AAM1F,oEAAoE;AACpE,wBAAgB,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAA4B;AAEnF,iFAAiF;AACjF,wBAAgB,cAAc,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAK1D;AAMD,yCAAyC;AACzC,wBAAgB,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAavD;AAUD,2CAA2C;AAC3C,wBAAgB,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,CAU5D;AAMD,+CAA+C;AAC/C,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAWpE"}

package/dist/layout/dot/ns-range.d.ts

@@ -0,0 +1,17 @@
+/** @see lib/common/ns.c — cut values, DFS range initialization */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { NsCtx } from './ns-core.js';
+/** @see lib/common/ns.c:x_val */
+export declare function xVal(e: Edge, v: Node, dir: number): number;
+/** @see lib/common/ns.c:x_cutval */
+export declare function xCutval(f: Edge): void;
+/** @see lib/common/ns.c:dfs_cutval */
+export declare function dfsCutval(v: Node, par?: Edge): void;
+/** @see lib/common/ns.c:init_cutvalues */
+export declare function initCutvalues(ctx: NsCtx): void;
+/** @see lib/common/ns.c:dfs_range_init */
+export declare function dfsRangeInit(v: Node): number;
+/** @see lib/common/ns.c:dfs_range */
+export declare function dfsRange(v: Node, par: Edge | undefined, low: number): number;
+//# sourceMappingURL=ns-range.d.ts.map

package/dist/layout/dot/ns-range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ns-range.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/ns-range.ts"],"names":[],"mappings":"AACA,kEAAkE;AAClE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AA+D1C,iCAAiC;AACjC,wBAAgB,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAO1D;AAED,oCAAoC;AACpC,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CASrC;AAiBD,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAanD;AAMD,0CAA0C;AAC1C,wBAAgB,aAAa,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAG9C;AAuBD,0CAA0C;AAC1C,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAkB5C;AA+CD,qCAAqC;AACrC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAO5E"}

package/dist/layout/dot/ns-subtree.d.ts

@@ -0,0 +1,78 @@
+/** @see lib/common/ns.c — subtree union-find, feasible tree construction */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { NsCtx } from './ns-core.js';
+/** @see lib/common/ns.c:subtree_t */
+export interface Subtree {
+    rep: Node;
+    size: number;
+    heapIndex: number;
+    par?: Subtree;
+}
+export interface STheap {
+    elt: Subtree[];
+    size: number;
+}
+interface TstState {
+    v: Node;
+    inI: number;
+    outI: number;
+    rv: number;
+}
+interface IteState {
+    v: Node;
+    ts: Subtree;
+    from?: Node;
+    outI: number;
+    inI: number;
+}
+interface TstCtx {
+    ctx: NsCtx;
+    st: Subtree;
+    nodeMap: Map<Node, Subtree>;
+    todo: TstState[];
+}
+export declare function onHeap(st: Subtree): boolean;
+/** @see lib/common/ns.c:STsetFind */
+export declare function stSetFind(n: Node, nodeMap: Map<Node, Subtree>): Subtree;
+/** @see lib/common/ns.c:STsetUnion */
+export declare function stSetUnion(s0: Subtree, s1: Subtree): Subtree;
+export declare function tstTryNode(tc: TstCtx, v: Node, e: Edge): number;
+export declare function tstScanIn(tc: TstCtx): number;
+export declare function tstScanOut(tc: TstCtx): number;
+export declare function tstIterate(tc: TstCtx): number | undefined;
+/** @see lib/common/ns.c:tight_subtree_search */
+export declare function tightSubtreeSearch(ctx: NsCtx, v: Node, st: Subtree, nodeMap: Map<Node, Subtree>): number;
+/** @see lib/common/ns.c:find_tight_subtree */
+export declare function findTightSubtree(ctx: NsCtx, v: Node, nodeMap: Map<Node, Subtree>): Subtree | null;
+export declare function iteOutScan(todo: IteState[], nodeMap: Map<Node, Subtree>, best: Edge | undefined): [boolean, Edge | undefined];
+export declare function iteInScan(todo: IteState[], nodeMap: Map<Node, Subtree>, best: Edge | undefined): [boolean, Edge | undefined];
+/** @see lib/common/ns.c:inter_tree_edge_search */
+export declare function interTreeEdgeSearch(v: Node, nodeMap: Map<Node, Subtree>): Edge | undefined;
+export declare function stheapSwap(heap: STheap, i: number, j: number): void;
+export declare function stheapSmallest(heap: STheap, idx: number): number;
+/** @see lib/common/ns.c:STheapify */
+export declare function stheapify(heap: STheap, i: number): void;
+/** @see lib/common/ns.c:STbuildheap */
+export declare function stBuildHeap(elt: Subtree[], size: number): STheap;
+/** @see lib/common/ns.c:STextractmin */
+export declare function stExtractMin(heap: STheap): Subtree;
+/**
+ * Add `delta` to ND_rank of every node in the tight tree reachable from `v`
+ * (the parent back-edge to `from` excluded). C's `tree_adjust` is a recursive
+ * DFS; the tight tree is acyclic, so each node is visited exactly once and the
+ * mutation (`rank += delta`) is order-independent. Ported with an explicit
+ * stack instead of recursion: deep trees (e.g. corpus 2646, a 7-deep quadtree
+ * with thousands of nodes) overflow the JS call stack where C's larger native
+ * stack does not. Outcome is identical to the recursive form.
+ * @see lib/common/ns.c:tree_adjust
+ */
+export declare function treeAdjust(v: Node, from: Node | undefined, delta: number): void;
+/** @see lib/common/ns.c:merge_trees */
+export declare function mergeTrees(ctx: NsCtx, e: Edge, nodeMap: Map<Node, Subtree>): Subtree | null;
+export declare function buildSubtrees(ctx: NsCtx, nodeMap: Map<Node, Subtree>, tree: Subtree[]): number;
+export declare function mergeSubtrees(ctx: NsCtx, heap: STheap, nodeMap: Map<Node, Subtree>): boolean;
+/** @see lib/common/ns.c:feasible_tree */
+export declare function feasibleTree(ctx: NsCtx): number;
+export {};
+//# sourceMappingURL=ns-subtree.d.ts.map

package/dist/layout/dot/ns-subtree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ns-subtree.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/ns-subtree.ts"],"names":[],"mappings":"AACA,4EAA4E;AAC5E,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAO1C,qCAAqC;AACrC,MAAM,WAAW,OAAO;IACtB,GAAG,EAAE,IAAI,CAAC;IACV,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,GAAG,CAAC,EAAE,OAAO,CAAC;CACf;AAED,MAAM,WAAW,MAAM;IAAG,GAAG,EAAE,OAAO,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;CAAE;AAEzD,UAAU,QAAQ;IAAG,CAAC,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;CAAE;AAEtE,UAAU,QAAQ;IAAG,CAAC,EAAE,IAAI,CAAC;IAAC,EAAE,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;CAAE;AAEpF,UAAU,MAAM;IACd,GAAG,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAAC,IAAI,EAAE,QAAQ,EAAE,CAAC;CACxE;AAMD,wBAAgB,MAAM,CAAC,EAAE,EAAE,OAAO,GAAG,OAAO,CAA8B;AAE1E,qCAAqC;AACrC,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,OAAO,CAOvE;AAQD,sCAAsC;AACtC,wBAAgB,UAAU,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,GAAG,OAAO,CAW5D;AAMD,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAK/D;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAU5C;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAU7C;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAWzD;AAED,gDAAgD;AAChD,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAC5D,MAAM,CAWR;AAED,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAC/C,OAAO,GAAG,IAAI,CAOhB;AAMD,wBAAgB,UAAU,CACxB,IAAI,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,GACpE,CAAC,OAAO,EAAE,IAAI,GAAG,SAAS,CAAC,CAgB7B;AAED,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,GACpE,CAAC,OAAO,EAAE,IAAI,GAAG,SAAS,CAAC,CAgB7B;AAED,kDAAkD;AAClD,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GACnC,IAAI,GAAG,SAAS,CAgBlB;AAMD,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAInE;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAQhE;AAED,qCAAqC;AACrC,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAQvD;AAED,uCAAuC;AACvC,wBAAgB,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAKhE;AAED,wCAAwC;AACxC,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CASlD;AAMD;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAgB/E;AAED,uCAAuC;AACvC,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,OAAO,GAAG,IAAI,CAY3F;AAMD,wBAAgB,aAAa,CAC3B,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GACvD,MAAM,CASR;AAED,wBAAgB,aAAa,CAC3B,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GACpD,OAAO,CAUT;AAED,yCAAyC;AACzC,wBAAgB,YAAY,CAAC,GAAG,EAAE,KAAK,GAAG,MAAM,CAS/C"}

package/dist/layout/dot/ns.d.ts

@@ -0,0 +1,86 @@
+/** @see lib/common/ns.c — rank, balance, main simplex loop */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Graph } from '../../model/graph.js';
+import type { NsCtx } from './ns-core.js';
+export declare function nodeRank(n: Node): number;
+export declare function nodeLow(n: Node): number;
+export declare function nodeLim(n: Node): number;
+export declare function nodeType(n: Node): number;
+export declare function nodeInSize(n: Node): number;
+export declare function nodeOutSize(n: Node): number;
+export declare function nodeTreeSize(n: Node): number;
+export declare function edgeCv(e: Edge): number;
+export declare function edgeWeight(e: Edge): number;
+export declare function edgeMinlen(e: Edge): number;
+export declare function initRankIn(v: Node): void;
+export declare function initRankOut(v: Node, q: Node[]): void;
+/** @see lib/common/ns.c:init_rank */
+export declare function initRank(ctx: NsCtx): void;
+/** @see lib/common/ns.c:leave_edge (wrap-around scan helper) */
+export declare function leaveEdgeScan(ctx: NsCtx, to: number, cnt: number, rv: Edge | undefined): [Edge | undefined, number];
+/** @see lib/common/ns.c:leave_edge */
+export declare function leaveEdge(ctx: NsCtx): Edge | undefined;
+/** @see lib/common/ns.c:dfs_enter_outedge (out-edge scan) */
+export declare function dfsEnterOutScan(n: Node, low: number, lim: number, todo: Node[], best: EnterBest): void;
+export declare function dfsEnterOutTreeIn(n: Node, todo: Node[], bestSlack: number): void;
+/** @see lib/common/ns.c:dfs_enter_outedge */
+export declare function dfsEnterOutedge(v: Node, low: number, lim: number): Edge | undefined;
+/**
+ * Running best (entering edge + its slack), threaded through the search so
+ * slack is computed once per candidate edge (C maintains `Slack` as a local
+ * int rather than recomputing SLACK(Enter) on every comparison).
+ */
+interface EnterBest {
+    e: Edge | undefined;
+    slack: number;
+}
+/** @see lib/common/ns.c:dfs_enter_inedge (in-edge scan) */
+export declare function dfsEnterInScan(n: Node, low: number, lim: number, todo: Node[], best: EnterBest): void;
+export declare function dfsEnterInTreeOut(n: Node, todo: Node[], bestSlack: number): void;
+/** @see lib/common/ns.c:dfs_enter_inedge */
+export declare function dfsEnterInedge(v: Node, low: number, lim: number): Edge | undefined;
+/** @see lib/common/ns.c:enter_edge */
+export declare function enterEdge(e: Edge): Edge | undefined;
+/** @see lib/common/ns.c:treeupdate */
+export declare function treeupdate(v: Node, w: Node, cutvalue: number, dir: boolean): Node;
+/**
+ * Iterative rerank (AD-3). C's `rerank` recurses to depth O(V) and overflows
+ * V8's ~1MB stack on deep tight trees (tests/2108); a browser stack is small
+ * and fixed, so it must be an explicit todo-stack. Each node's rank is
+ * decremented exactly once by `delta` and the writes are independent, so the
+ * LIFO visit order yields a bit-identical result to the recursive pre-order.
+ * @see lib/common/ns.c:rerank
+ */
+export declare function rerank(v: Node, delta: number): void;
+export declare function updateRerank(e: Edge, delta: number): void;
+/** @see lib/common/ns.c:update */
+export declare function nsUpdate(ctx: NsCtx, e: Edge, f: Edge): number;
+/** @see lib/common/ns.c:scan_and_normalize */
+export declare function scanAndNormalize(ctx: NsCtx): number;
+export declare function freeTreeNode(n: Node): void;
+export declare function resetLists(ctx: NsCtx): void;
+/** @see lib/common/ns.c:freeTreeList */
+export declare function freeTreeList(ctx: NsCtx): void;
+/** @see lib/common/ns.c:LR_balance */
+export declare function lrBalance(ctx: NsCtx): void;
+/** @see lib/common/ns.c:TB_balance (adj mode detection) */
+export declare function tbGetAdj(g: Graph): number;
+export declare function tbForceAdj(ctx: NsCtx, adj: number, maxrank: number): void;
+export declare function tbSortCompare(a: Node, b: Node, adj: number): number;
+export declare function tbSortNodes(ctx: NsCtx, nrank: number[], adj: number): Node[];
+export declare function tbComputeBounds(n: Node, maxrank: number): [number, number, number, number];
+export declare function tbMoveNode(n: Node, low: number, high: number, nrank: number[], adj: number): void;
+/** @see lib/common/ns.c:TB_balance */
+export declare function tbBalance(ctx: NsCtx): void;
+export declare function initGraphEdge(n: Node, e: Edge): boolean;
+/** @see lib/common/ns.c:init_graph */
+export declare function initGraph(ctx: NsCtx, g: Graph): boolean;
+export declare function rank2Loop(ctx: NsCtx, maxiter: number): number;
+export declare function rank2Balance(ctx: NsCtx, balance: number): void;
+/** @see lib/common/ns.c:rank2 */
+export declare function rank2(g: Graph, balance: number, maxiter: number, searchSize: number): number;
+/** @see lib/common/ns.c:rank */
+export declare function rank(g: Graph, balance: number, maxiter: number): number;
+export {};
+//# sourceMappingURL=ns.d.ts.map

package/dist/layout/dot/ns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ns.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/ns.ts"],"names":[],"mappings":"AACA,8DAA8D;AAC9D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAU1C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA6B;AACtE,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA4B;AACpE,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA4B;AACpE,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAkC;AAC3E,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAiC;AAC5E,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAkC;AAC9E,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAE5C;AACD,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAiC;AACxE,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+B;AAC1E,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+B;AAM1E,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CASxC;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,CASpD;AAED,qCAAqC;AACrC,wBAAgB,QAAQ,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAMzC;AAMD,gEAAgE;AAChE,wBAAgB,aAAa,CAC3B,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,GAAG,SAAS,GACxD,CAAC,IAAI,GAAG,SAAS,EAAE,MAAM,CAAC,CAe5B;AAED,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,GAAG,SAAS,CActD;AAMD,6DAA6D;AAC7D,wBAAgB,eAAe,CAC7B,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,GAC/D,IAAI,CA0BN;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAQhF;AAED,6CAA6C;AAC7C,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CASnF;AAED;;;;GAIG;AACH,UAAU,SAAS;IAAG,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;CAAE;AAE3D,2DAA2D;AAC3D,wBAAgB,cAAc,CAC5B,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,GAC/D,IAAI,CAuBN;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAQhF;AAED,4CAA4C;AAC5C,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CASlF;AAED,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,SAAS,CAKnD;AAMD,sCAAsC;AACtC,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,GAAG,IAAI,CAUjF;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAkBnD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAMzD;AAED,kCAAkC;AAClC,wBAAgB,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAa7D;AAMD,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,KAAK,GAAG,MAAM,CAYnD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI1C;AAED,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAA0C;AAEtF,wCAAwC;AACxC,wBAAgB,YAAY,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAG7C;AAMD,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAa1C;AAMD,2DAA2D;AAC3D,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAKzC;AAED,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAOzE;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAEnE;AAED,wBAAgB,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,EAAE,CAY5E;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAkB1F;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CASjG;AAED,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAa1C;AAMD,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAIvD;AAED,sCAAsC;AACtC,wBAAgB,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,OAAO,CAgBvD;AAMD,wBAAgB,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAW7D;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAI9D;AAED,iCAAiC;AACjC,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAW5F;AAED,gCAAgC;AAChC,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAIvE"}

package/dist/layout/dot/ortho-adapter.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Dot-local adapter between the dot `Graph` model and the `orthoEdges`
+ * pipeline (`src/ortho`). Mirrors neato's private `OrthoHelper`
+ * (`neato/splines.ts:247`) rather than extracting a shared helper, so the
+ * working neato path is untouched (ADR-1) — this matches C, where dotgen and
+ * neatogen each have their own call site into `ortho.c:orthoEdges`.
+ *
+ * @see lib/dotgen/dotsplines.c:dot_splines_ (EDGETYPE_ORTHO branch)
+ * @see src/layout/neato/splines.ts:OrthoHelper
+ */
+import type { Graph } from '../../model/graph.js';
+import type { OrthoGraph, OrthoEdge, OrthoPoint } from '../../ortho/index.js';
+/** Build an OrthoGraph from the dot Graph (tail≠head edges only). */
+export declare function buildOrthoGraph(g: Graph): OrthoGraph;
+/** Install an orthoEdges result (orthogonal point list) onto the dot Edge. */
+export declare function installOrthoResult(oe: OrthoEdge, pts: OrthoPoint[]): void;
+/** Run the ortho pipeline over the dot graph, installing results (no labels). */
+export declare function dispatchOrthoEdges(g: Graph, useLbls: boolean): void;
+//# sourceMappingURL=ortho-adapter.d.ts.map

package/dist/layout/dot/ortho-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ortho-adapter.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/ortho-adapter.ts"],"names":[],"mappings":"AACA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AASlD,OAAO,KAAK,EACV,UAAU,EAAE,SAAS,EAAE,UAAU,EAClC,MAAM,sBAAsB,CAAC;AAkF9B,qEAAqE;AACrE,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,UAAU,CAIpD;AAUD,8EAA8E;AAC9E,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,IAAI,CAIzE;AAED,iFAAiF;AACjF,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAInE"}

package/dist/layout/dot/pack-components.d.ts

@@ -0,0 +1,100 @@
+/**
+ * Multi-component `pack` branch for the dot engine — the body of C's `doDot`
+ * (dotinit.c:doDot ≈437-500) for the case where `pack`/`packmode` is set and the
+ * graph has more than one connected component. Each component is laid out
+ * independently (everything in the dot pipeline except the final coordinate
+ * rotation/translation), then polyomino-packed via the shared pack module; the
+ * root graph is rotated/translated once by `gvPostprocess` afterwards.
+ *
+ * The port's pack ops run in points on `n.info.coord` (see pack/index.ts
+ * shiftOneGraph), so C's `attachPos`/`resetCoord` (which copy point coords to
+ * inches in `ND_pos` for the pack library and back) are NOT needed.
+ *
+ * Split out of index.ts per ADR-1 (keeps both files under the size/complexity
+ * caps and mirrors C's function boundaries: CLAUDE.md — the C source is the spec).
+ *
+ * @see lib/dotgen/dotinit.c:doDot
+ * @see lib/dotgen/dotinit.c:initSubg
+ * @see lib/dotgen/dotinit.c:copyClusterInfo
+ */
+import type { Graph } from '../../model/graph.js';
+import type { PackInfo } from '../pack/index.js';
+/**
+ * True when the graph has no meaningful `ratio` attribute, i.e. C's
+ * `ratio_kind == R_NONE`. The pack branch only fires for R_NONE; any other
+ * ratio (auto/compress/expand/fill or a positive numeric R_VALUE) falls back to
+ * whole-graph layout in `doDot`.
+ *
+ * Read from the `ratio` attr directly (mirroring C's setRatio) rather than from
+ * `g.info.drawing`, which the port only populates for `ratio=compress` (ADR-1):
+ * fill/expand/value/auto would otherwise leave `drawing` undefined and wrongly
+ * activate packing.
+ *
+ * @see lib/common/input.c:576 setRatio
+ */
+export declare function ratioIsNone(g: Graph): boolean;
+/**
+ * Decompose `root` into "connected" components where nodes are connected by an
+ * edge OR by sharing a cluster (C's cluster-aware `cccomps`: cluster members
+ * stay in one component even with no edge between them). Each component carries
+ * a projected clone of every cluster/same-rank subgraph it owns; `origOf` maps
+ * each cluster clone back to its original root cluster (C's `mapClust`).
+ * @see lib/pack/ccomps.c:cccomps
+ */
+export declare function cccompsWithClusters(root: Graph): {
+    comps: Graph[];
+    origOf: Map<Graph, Graph>;
+};
+/**
+ * Override a component subgraph's drawing-info fields with the root's parsed
+ * values. `buildSubgraph` (shared pack module) gives each component an empty
+ * `attrs` Map, so `dotGraphInit(sg)` derives defaults rather than the root's
+ * explicit `rankdir`/`nodesep`/`ranksep` — initSubg copies them from the root so
+ * the component ranks/positions exactly as it would inside the whole graph.
+ *
+ * Ordering (per T1): run `dotGraphInit(sg)` first, then initSubg to override.
+ * `GD_drawing` quantum/dpi are only material for `ratio=compress`, which never
+ * reaches the pack branch (ratioIsNone excludes it), so `drawing` is not copied.
+ *
+ * @see lib/dotgen/dotinit.c:initSubg
+ */
+export declare function initSubg(sg: Graph, root: Graph): void;
+/**
+ * Lay out one connected component fully (rank → mincross → position →
+ * splines), but WITHOUT the final `gvPostprocess` rotation/translation: in C
+ * the per-component `dotLayout` does not call `dotneato_postprocess`; that runs
+ * once on the root after packing (`dot_layout`). Running it per component would
+ * rotate each component by rankdir and then the root pass would double-rotate.
+ *
+ * `dotPhaseInit(sg)` runs first (sets sg.info defaults from the empty attr map);
+ * `initSubg(sg, root)` then overrides the inheritance-sensitive fields before
+ * ranking reads them. Node sizing in `dotPhaseInit` reads `sg.root.info.flip`
+ * (the real root), so it is correct regardless of this ordering.
+ *
+ * @see lib/dotgen/dotinit.c:dotLayout (static)
+ */
+export declare function dotLayoutComponent(sg: Graph, root: Graph): void;
+/**
+ * Copy the cluster tree and per-cluster drawing-info from each laid-out
+ * component back to the root, so the root's `gvPostprocess` rotates the cluster
+ * bounding boxes and the renderer (which reads `GD_clust(root)`) draws them at
+ * their packed positions.
+ *
+ * @see lib/dotgen/dotinit.c:copyClusterInfo
+ */
+export declare function copyClusterInfo(comps: Graph[], root: Graph, origOf: Map<Graph, Graph>): void;
+/**
+ * Lay out each component independently, polyomino-pack them, carry cluster info
+ * back to the root, and run the single root-level `gvPostprocess`.
+ *
+ * The root must carry its own drawing-info (rankdir/nodesep/ranksep/label) for
+ * `initSubg` to read and for `gvPostprocess` to rotate by: in C the root's
+ * `graph_init` ran before `doDot`; the port has no separate pre-layout
+ * graph_init, so `dotGraphInit(root)` is run here once. The root bbox is set by
+ * `packSubgraphs` (→ computeSubgraphBB); the root is never re-ranked.
+ *
+ * @see lib/dotgen/dotinit.c:doDot
+ * @see lib/dotgen/dotinit.c:dot_layout (dotneato_postprocess on root)
+ */
+export declare function layoutAndPack(root: Graph, comps: Graph[], pinfo: PackInfo, origOf: Map<Graph, Graph>): void;
+//# sourceMappingURL=pack-components.d.ts.map

package/dist/layout/dot/pack-components.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pack-components.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/pack-components.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAGlD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAsBjD;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAK7C;AAwED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,KAAK,GAAG;IAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAAC,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;CAAE,CA4B9F;AAOD;;;;;;;;;;;;GAYG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAMrD;AAOD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CA6B/D;AAwCD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAgB5F;AAoFD;;;;;;;;;;;;GAYG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GACtE,IAAI,CAoBN"}

package/dist/layout/dot/position-aux.d.ts

@@ -0,0 +1,110 @@
+/**
+ * Auxiliary edge construction and removal for the dot position phase.
+ * @see lib/dotgen/position.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+/** @see lib/common/const.h:CL_OFFSET */
+export declare const CL_OFFSET = 8;
+/**
+ * Cluster margin = `late_int(g, G_margin, CL_OFFSET, 0)`. The `margin` attribute
+ * is resolved up the subgraph chain (matching `agxget` inheritance), so a
+ * cluster with no own `margin` inherits an ancestor's; absent everywhere it
+ * falls back to `CL_OFFSET`, and negatives clamp to 0. Used for both the
+ * x-coordinate (`make_lrvn`/`make_lrconstraints`/separate clusters) and the
+ * rank/y-coordinate (`set_ycoords`) cluster spacing.
+ * @see lib/dotgen/position.c:397,436,460,642
+ */
+export declare function clusterMarginOf(g: Graph): number;
+/** @see lib/common/const.h:BOTTOM_IX */
+export declare const BOTTOM_IX = 0;
+/** @see lib/common/const.h:RIGHT_IX */
+export declare const RIGHT_IX = 1;
+/** @see lib/common/const.h:TOP_IX */
+export declare const TOP_IX = 2;
+/** @see lib/common/const.h:LEFT_IX */
+export declare const LEFT_IX = 3;
+/** @internal */
+export declare function nodeRw(n: Node): number;
+/** @internal */
+export declare function nodeLw(n: Node): number;
+/** @internal */
+export declare function nodeOrder(n: Node): number;
+/** @internal */
+export declare function nodeRank(n: Node): number;
+/** @internal */
+export declare function nodeUfSize(n: Node): number;
+/** @internal */
+export declare function edgeMinlen(e: Edge): number;
+/** @internal */
+export declare function edgeWeight(e: Edge): number;
+/** @internal */
+export declare function edgeDist(e: Edge): number;
+/** @internal */
+export declare function graphNodesep(g: Graph): number;
+/** @internal */
+export declare function graphMinrank(g: Graph): number;
+/** @internal */
+export declare function graphMaxrank(g: Graph): number;
+/** @internal */
+export declare function graphNclust(g: Graph): number;
+/** @internal */
+export declare function graphHt1(g: Graph): number;
+/** @internal */
+export declare function graphHt2(g: Graph): number;
+/** @internal */
+export declare function graphRanksep(g: Graph): number;
+/** @see lib/dotgen/position.c:make_aux_edge */
+export declare function makeAuxEdge(u: Node, v: Node, len: number, wt: number): Edge;
+/** @see lib/dotgen/position.c:allocate_aux_edges */
+export declare function allocateAuxEdges(g: Graph): void;
+/** LR node separation for a rank (accounts for edge labels).
+ * C uses smaller separation (5) on odd ranks when the graph has edge labels
+ * (real nodes sit on even ranks 0,2,4…). `abomination` inserts a flat-label
+ * rank at -1 in C, but this 0-based port shifts every rank up by 1 instead
+ * (AD-2), inverting the parity; `abomShift` undoes that so the parity matches C.
+ *
+ * The EDGE_LABEL gate reads `g.root`, not `g`: C is `GD_has_labels(g->root)`.
+ * Under `pack` the layout graph is a component whose own has_labels is 0 (C
+ * scopes only `edgelabel_ranks`, rank.c:170, to the layout graph) while the true
+ * root carries the flag — so reading `g` here silently used the full nodesep on
+ * odd ranks instead of C's `sep[1] = 5`, widening every packed component that
+ * contains an edge label.
+ * @see lib/dotgen/position.c:make_LR_constraints (GD_has_labels(g->root)) */
+export declare function lrSep(g: Graph, rankIdx: number): number;
+/** @see lib/dotgen/position.c:make_LR_constraints (single flat-edge constraint) */
+export declare function processFlatEdge(g: Graph, u: Node, e: Edge): void;
+/** @see lib/dotgen/position.c:make_LR_constraints (flat-edge endpoint loop) */
+export declare function makeFlatEdgeConstraints(g: Graph, u: Node): void;
+/** @see lib/dotgen/position.c:make_LR_constraints (flat-label constraint body) */
+export declare function applyFlatLabel(g: Graph, e: Edge, e0raw: Edge, e1raw: Edge): void;
+/** @see lib/dotgen/position.c:make_LR_constraints (flat-label constraints via ND_alg) */
+export declare function makeFlatLabelConstraints(g: Graph, u: Node): void;
+/** @see lib/dotgen/position.c:go */
+export declare function go(u: Node, v: Node): boolean;
+/** @see lib/dotgen/position.c:canreach */
+export declare function canReach(u: Node, v: Node): boolean;
+/** @see lib/dotgen/position.c:make_LR_constraints (self-edge width accumulation) */
+export declare function selfWidth(u: Node): number;
+/** @see lib/dotgen/position.c:make_LR_constraints (per-rank inner loop, one node pair) */
+export declare function lrRankPair(g: Graph, r: number, u: Node, v: Node, last: number): number;
+/** @see lib/dotgen/position.c:make_LR_constraints (per-rank inner loop) */
+export declare function makeLrRankConstraints(g: Graph, r: number): void;
+/** @see lib/dotgen/position.c:make_LR_constraints */
+export declare function makeLrConstraints(g: Graph): void;
+/** @see lib/dotgen/position.c:make_edge_pairs (per-edge) */
+export declare function addEdgePair(g: Graph, e: Edge): void;
+/** @see lib/dotgen/position.c:make_edge_pairs */
+export declare function makeEdgePairs(g: Graph): void;
+/** Create a SLACKNODE virtual node and prepend to nlist. */
+export declare function makeSlackNode(g: Graph): Node;
+/** @see lib/dotgen/position.c:create_aux_edges */
+export declare function createAuxEdges(g: Graph, posClusters: (g: Graph) => void, compressGraph: (g: Graph) => void): void;
+/** @see lib/dotgen/position.c:remove_aux_edges (SLACKNODE removal loop) */
+export declare function removeSlackNodes(g: Graph): void;
+/** @see lib/dotgen/position.c:remove_aux_edges (per-node cleanup) */
+export declare function removeAuxEdgesNode(n: Node): void;
+/** @see lib/dotgen/position.c:remove_aux_edges */
+export declare function removeAuxEdges(g: Graph): void;
+//# sourceMappingURL=position-aux.d.ts.map

package/dist/layout/dot/position-aux.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"position-aux.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/position-aux.ts"],"names":[],"mappings":"AAEA;;;GAGG;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;AAShD,wCAAwC;AACxC,eAAO,MAAM,SAAS,IAAI,CAAC;AAE3B;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAOhD;AAED,wCAAwC;AACxC,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,uCAAuC;AACvC,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,qCAAqC;AACrC,eAAO,MAAM,MAAM,IAAI,CAAC;AACxB,sCAAsC;AACtC,eAAO,MAAM,OAAO,IAAI,CAAC;AAMzB,gBAAgB;AAChB,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA2B;AAElE,gBAAgB;AAChB,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA2B;AAElE,gBAAgB;AAChB,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA8B;AAExE,gBAAgB;AAChB,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA6B;AAEtE,gBAAgB;AAChB,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAgC;AAE3E,gBAAgB;AAChB,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+B;AAE1E,gBAAgB;AAChB,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+B;AAE1E,gBAAgB;AAChB,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA6B;AAEtE,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAE9E,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAE9E,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAE9E,gBAAgB;AAChB,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAkC;AAE/E,gBAAgB;AAChB,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAA4B;AAEtE,gBAAgB;AAChB,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAA4B;AAEtE,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAM9E,+CAA+C;AAC/C,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAO3E;AAMD,oDAAoD;AACpD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAS/C;AAMD;;;;;;;;;;;;6EAY6E;AAC7E,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAIvD;AAED,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAsBhE;AAED,+EAA+E;AAC/E,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAM/D;AAED,kFAAkF;AAClF,wBAAgB,cAAc,CAC5B,CAAC,EAAE,KAAK,EACR,CAAC,EAAE,IAAI,EACP,KAAK,EAAE,IAAI,EACX,KAAK,EAAE,IAAI,GACV,IAAI,CASN;AAED,yFAAyF;AACzF,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAMhE;AAED,oCAAoC;AACpC,wBAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAQ5C;AAED,0CAA0C;AAC1C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAElD;AAED,oFAAoF;AACpF,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CASzC;AAED,0FAA0F;AAC1F,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAetF;AAED,2EAA2E;AAC3E,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAe/D;AAED,qDAAqD;AACrD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAIhD;AAMD,4DAA4D;AAC5D,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAenD;AAED,iDAAiD;AACjD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAQ5C;AAED,4DAA4D;AAC5D,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAS5C;AAMD,kDAAkD;AAClD,wBAAgB,cAAc,CAC5B,CAAC,EAAE,KAAK,EACR,WAAW,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,EAC/B,aAAa,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,GAChC,IAAI,CAMN;AAED,2EAA2E;AAC3E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAc/C;AAED,qEAAqE;AACrE,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAYhD;AAED,kDAAkD;AAClD,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK7C"}