@knowvah/dot-engine 0.1.0

package/dist/layout/circo/blocks.d.ts

@@ -0,0 +1,135 @@
+/**
+ * Core block and derived-graph data structures for the circo layout engine.
+ *
+ * Ports the type definitions from lib/circogen/block.h, lib/circogen/circular.h,
+ * and the DerivedGraph/DerivedNode/DerivedEdge helpers used across all passes.
+ *
+ * Also holds CircoCData (cdata) here to avoid a circular import with init.ts:
+ * cdata needs a back-reference to DerivedNode, so both must live in the same
+ * module.
+ *
+ * @see lib/circogen/block.h
+ * @see lib/circogen/circular.h
+ */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+export declare const FLAGS_VISITED = 1;
+export declare const FLAGS_ONSTACK = 2;
+export declare const FLAGS_ISPARENT = 4;
+export declare const FLAGS_ONPATH = 8;
+export declare const FLAGS_NEIGHBOR = 16;
+/**
+ * Rich algorithm data stored on derived-graph nodes across Passes 1–4.
+ * Fields are reused across passes (mirrors the C union in cdata).
+ *
+ * @see lib/circogen/circular.h:cdata
+ */
+export interface CircoCData {
+    readonly kind: 'circo-cdata';
+    flags: number;
+    /** DFS parent (Pass 1). @see PARENT(n) */
+    parent: DerivedNode | null;
+    /** Block containing this node. @see BLOCK(n) */
+    block: unknown;
+    /** Biconnectivity fields (Pass 1). @see VAL(n), LOWVAL(n) */
+    bc: {
+        val: number;
+        lowVal: number;
+    };
+    /** Clone pointer (Pass 3a). @see CLONE(n) */
+    clone: Node | null;
+    /** Spanning-tree parent (Pass 3b). @see TPARENT(n) */
+    tparent: CircoCData | null;
+    leafone: CircoCData | null;
+    leaftwo: CircoCData | null;
+    fdist: number;
+    sdist: number;
+    /** Circle position index (Pass 3c/4). @see POSITION(n) */
+    pos: number;
+    /** Child-block mid-angle (Pass 4). @see PSI(n) */
+    psi: number;
+    /** Degree counter (reuses ND_order slot). @see DEGREE(n) */
+    degree: number;
+    /** Back-reference to the DerivedNode that owns this cdata. */
+    derivedNode: DerivedNode;
+}
+/** Lightweight subgraph used in the derived graph for circo. */
+export interface SubGraph {
+    name: string;
+    nodes: DerivedNode[];
+    edges: DerivedEdge[];
+    parent: DerivedGraph;
+}
+/** Strict undirected derived graph built in Pass 0. */
+export interface DerivedGraph {
+    nodes: Map<string, DerivedNode>;
+    subgraphs: SubGraph[];
+    components: SubGraph[];
+}
+/** Node in the derived graph with cdata attached. */
+export interface DerivedNode {
+    name: string;
+    orig: Node;
+    pos: [number, number];
+    cdata: CircoCData;
+    lw: number;
+    rw: number;
+    ht: number;
+}
+/** Edge in the derived graph. */
+export interface DerivedEdge {
+    tail: DerivedNode;
+    head: DerivedNode;
+    /** +1 tail→head, -1 head→tail, 0 = unset. @see EDGEORDER(e) */
+    order: number;
+    origEdge: Edge | null;
+}
+/**
+ * One biconnected component (or isolated node).
+ * @see lib/circogen/block.h:block_t
+ */
+export interface Block {
+    subGraph: SubGraph;
+    radius: number;
+    rad0: number;
+    circleList: Node[];
+    children: Block[];
+    /** Parent-connection angle for single-node blocks; -1 = unset. */
+    parentPos: number;
+    flags: number;
+    /** Cutpoint node connecting this block to its parent block. */
+    child: Node | null;
+}
+/** @see lib/circogen/block.c:mkBlock */
+export declare function mkBlock(sg: SubGraph): Block;
+/** @see lib/circogen/block.c:blockSize */
+export declare function blockSize(bp: Block): number;
+/** @see lib/circogen/block.c:appendBlock */
+export declare function appendBlock(bl: Block[], bp: Block): void;
+/** @see lib/circogen/block.c:insertBlock */
+export declare function insertBlock(bl: Block[], bp: Block): void;
+/** @see lib/circogen/block.h:SET_COALESCED */
+export declare function setCoalesced(bp: Block): void;
+/** @see lib/circogen/block.h:COALESCED */
+export declare function isCoalesced(bp: Block): boolean;
+/**
+ * The node in the PARENT block this block hangs from:
+ * BLK_PARENT(b) = CHILD(b) ? PARENT(CHILD(b)) : 0.
+ * @see lib/circogen/block.h:BLK_PARENT
+ */
+export declare function blkParent(bp: Block): Node | null;
+/** @see lib/circogen/circular.h:circ_state */
+export interface CircState {
+    bl: Block[];
+    orderCount: number;
+    blockCount: number;
+    graphCopyCount: number;
+    spanningTreeCount: number;
+    minDist: number;
+    rootname: string;
+}
+/** @see lib/circogen/circular.c:initGraphAttrs */
+export declare function makeCircState(blockCount: number): CircState;
+/** Create a zero-initialised CircoCData for a given DerivedNode. */
+export declare function makeCData(dn: DerivedNode): CircoCData;
+//# sourceMappingURL=blocks.d.ts.map

package/dist/layout/circo/blocks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocks.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/blocks.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAOhD,eAAO,MAAM,aAAa,IAAO,CAAC;AAClC,eAAO,MAAM,aAAa,IAAO,CAAC;AAClC,eAAO,MAAM,cAAc,IAAO,CAAC;AACnC,eAAO,MAAM,YAAY,IAAO,CAAC;AACjC,eAAO,MAAM,cAAc,KAAO,CAAC;AAOnC;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,MAAM,EAAE,WAAW,GAAG,IAAI,CAAC;IAC3B,gDAAgD;IAChD,KAAK,EAAE,OAAO,CAAC;IACf,6DAA6D;IAC7D,EAAE,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACpC,6CAA6C;IAC7C,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC;IACnB,sDAAsD;IACtD,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,0DAA0D;IAC1D,GAAG,EAAE,MAAM,CAAC;IACZ,kDAAkD;IAClD,GAAG,EAAE,MAAM,CAAC;IACZ,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,8DAA8D;IAC9D,WAAW,EAAE,WAAW,CAAC;CAC1B;AAMD,gEAAgE;AAChE,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,MAAM,EAAE,YAAY,CAAC;CACtB;AAED,uDAAuD;AACvD,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAChC,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,UAAU,EAAE,QAAQ,EAAE,CAAC;CACxB;AAED,qDAAqD;AACrD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,IAAI,CAAC;IACX,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtB,KAAK,EAAE,UAAU,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,iCAAiC;AACjC,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,WAAW,CAAC;IAClB,IAAI,EAAE,WAAW,CAAC;IAClB,+DAA+D;IAC/D,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,IAAI,GAAG,IAAI,CAAC;CACvB;AASD;;;GAGG;AACH,MAAM,WAAW,KAAK;IACpB,QAAQ,EAAE,QAAQ,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,IAAI,EAAE,CAAC;IACnB,QAAQ,EAAE,KAAK,EAAE,CAAC;IAClB,kEAAkE;IAClE,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC;CACpB;AAED,wCAAwC;AACxC,wBAAgB,OAAO,CAAC,EAAE,EAAE,QAAQ,GAAG,KAAK,CAW3C;AAED,0CAA0C;AAC1C,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,GAAG,MAAM,CAE3C;AAED,4CAA4C;AAC5C,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAExD;AAED,4CAA4C;AAC5C,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAExD;AAED,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAE5C;AAED,0CAA0C;AAC1C,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,GAAG,OAAO,CAE9C;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,GAAG,IAAI,CAKhD;AAOD,8CAA8C;AAC9C,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,KAAK,EAAE,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAID,kDAAkD;AAClD,wBAAgB,aAAa,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAU3D;AAED,oEAAoE;AACpE,wBAAgB,SAAS,CAAC,EAAE,EAAE,WAAW,GAAG,UAAU,CAmBrD"}

package/dist/layout/circo/blocktree.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Biconnected-component decomposition and block-cutpoint tree construction.
+ *
+ * Ports lib/circogen/blocktree.c.
+ *
+ * @see lib/circogen/blocktree.c
+ */
+import type { DerivedNode, DerivedEdge, DerivedGraph, SubGraph } from './blocks.js';
+import { type Block, type CircState } from './blocks.js';
+/** DFS context object — avoids passing many params through recursive calls. */
+export interface DfsCtx {
+    g: SubGraph;
+    state: CircState;
+    allEdges: DerivedEdge[];
+    stk: DerivedEdge[];
+    /** Derived-node creation order — agfstedge sort key. */
+    ord: Map<DerivedNode, number>;
+    /** Derived-edge creation order — agfstedge tie key. */
+    seq: Map<DerivedEdge, number>;
+}
+export declare function makeBlockSubgraph(dg: DerivedGraph, state: CircState): SubGraph;
+export declare function makeBlock(dg: DerivedGraph, state: CircState): Block;
+export declare function addNodeToBlock(bp: Block, n: DerivedNode): void;
+export declare function popEdgesUntil(stk: DerivedEdge[], e: DerivedEdge): DerivedEdge[];
+export declare function buildBlockFromEdges(dg: DerivedGraph, state: CircState, popped: DerivedEdge[], u: DerivedNode): Block | null;
+export declare function placeBlock(state: CircState, block: Block, u: DerivedNode, isRoot: boolean): void;
+export declare function processArticulation(ctx: DfsCtx, u: DerivedNode, v: DerivedNode, e: DerivedEdge, isRoot: boolean): void;
+export declare function dfsVisitEdge(ctx: DfsCtx, u: DerivedNode, e: DerivedEdge, isRoot: boolean): void;
+export declare function dfsVisit(ctx: DfsCtx, u: DerivedNode, isRoot: boolean): void;
+export declare function findBlocks(g: SubGraph, state: CircState, allEdges: DerivedEdge[]): void;
+export declare function minValNode(bp: Block): {
+    child: DerivedNode;
+    parentNode: DerivedNode | null;
+};
+export declare function wireBlock(bp: Block): void;
+/**
+ * Build block-cutpoint tree from biconnected components.
+ * @see lib/circogen/blocktree.c:createBlocktree
+ */
+export declare function createBlocktree(g: SubGraph, state: CircState, allEdges: DerivedEdge[]): Block;
+/**
+ * Create a single block containing all nodes (oneblock=true).
+ * @see lib/circogen/circular.c:createOneBlock
+ */
+export declare function createOneBlock(g: SubGraph, state: CircState): Block;
+/**
+ * Recursively free a block tree (post-order).
+ * @see lib/circogen/blocktree.c:freeBlocktree
+ */
+export declare function freeBlocktree(bp: Block): void;
+//# sourceMappingURL=blocktree.d.ts.map

package/dist/layout/circo/blocktree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blocktree.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/blocktree.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEpF,OAAO,EACL,KAAK,KAAK,EACV,KAAK,SAAS,EAKf,MAAM,aAAa,CAAC;AAKrB,+EAA+E;AAC/E,MAAM,WAAW,MAAM;IACrB,CAAC,EAAE,QAAQ,CAAC;IACZ,KAAK,EAAE,SAAS,CAAC;IACjB,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,GAAG,EAAE,WAAW,EAAE,CAAC;IACnB,wDAAwD;IACxD,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC9B,uDAAuD;IACvD,GAAG,EAAE,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;CAC/B;AAMD,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,GAAG,QAAQ,CAK9E;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,GAAG,KAAK,CAEnE;AAED,wBAAgB,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,GAAG,IAAI,CAG9D;AAMD,wBAAgB,aAAa,CAAC,GAAG,EAAE,WAAW,EAAE,EAAE,CAAC,EAAE,WAAW,GAAG,WAAW,EAAE,CAS/E;AAED,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,YAAY,EAChB,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,WAAW,EAAE,EACrB,CAAC,EAAE,WAAW,GACb,KAAK,GAAG,IAAI,CAad;AAED,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,KAAK,EACZ,CAAC,EAAE,WAAW,EACd,MAAM,EAAE,OAAO,GACd,IAAI,CAMN;AAOD,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,MAAM,EACX,CAAC,EAAE,WAAW,EACd,CAAC,EAAE,WAAW,EACd,CAAC,EAAE,WAAW,EACd,MAAM,EAAE,OAAO,GACd,IAAI,CAKN;AAED,wBAAgB,YAAY,CAC1B,GAAG,EAAE,MAAM,EACX,CAAC,EAAE,WAAW,EACd,CAAC,EAAE,WAAW,EACd,MAAM,EAAE,OAAO,GACd,IAAI,CAYN;AAED,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAe3E;AAED,wBAAgB,UAAU,CACxB,CAAC,EAAE,QAAQ,EACX,KAAK,EAAE,SAAS,EAChB,QAAQ,EAAE,WAAW,EAAE,GACtB,IAAI,CAUN;AAOD,wBAAgB,UAAU,CAAC,EAAE,EAAE,KAAK,GAAG;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,UAAU,EAAE,WAAW,GAAG,IAAI,CAAA;CAAE,CAa5F;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAQzC;AAMD;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,CAAC,EAAE,QAAQ,EACX,KAAK,EAAE,SAAS,EAChB,QAAQ,EAAE,WAAW,EAAE,GACtB,KAAK,CAMP;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,GAAG,KAAK,CAOnE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAI7C"}

package/dist/layout/circo/circular.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Per-connected-component circular layout orchestration.
+ *
+ * Ports lib/circogen/circular.c (circularLayout) and the derived-graph
+ * construction from lib/circogen/circularinit.c (circomps, circoLayout).
+ *
+ * All functions are exported so lizard counts each one independently.
+ *
+ * @see lib/circogen/circular.c
+ * @see lib/circogen/circularinit.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import { type SubGraph, type DerivedGraph, type DerivedNode, type DerivedEdge } from './blocks.js';
+/** Create a DerivedNode from an original graph node. */
+export declare function makeDerivedNode(orig: Node): DerivedNode;
+/** Build strict undirected derived graph from g (drop self-loops).
+ * C creates derived nodes walking agfstnode (node-seq order) — the
+ * creation order IS the derived node seq. @see circularinit.c:circomps */
+export declare function buildDerivedGraph(g: Graph): DerivedGraph;
+/**
+ * Build derived edges (strict: no self-loops, no duplicates).
+ *
+ * C's circomps creates them per TAIL node in seq order via agfstout —
+ * `agedge(dg, dt, dh, NULL, 1)` on the strict derived graph dedups
+ * unordered pairs, keeping the FIRST encounter's orientation and seq.
+ * The derived-edge seq drives the block DFS's agfstedge iteration order
+ * (agedgeseqcmpf), which decides block numbering and tree child order.
+ * @see lib/circogen/circularinit.c:circomps
+ */
+export declare function buildDerivedEdges(g: Graph, dg: DerivedGraph): DerivedEdge[];
+/** Decompose derived graph into connected components with their edges. */
+export declare function derivedComponents(g: Graph, dg: DerivedGraph, allEdges: DerivedEdge[]): SubGraph[];
+/** Position a single-node component at origin. */
+export declare function layoutSingleNode(sg: SubGraph): void;
+/** Read oneblock attribute from the original graph. */
+export declare function isOneblock(realg: Graph): boolean;
+/** Read mindist attribute from the original graph (default 1.0). */
+export declare function readMinDist(realg: Graph): number;
+/**
+ * Lay out one connected component of the derived graph.
+ * @see lib/circogen/circular.c:circularLayout
+ */
+export declare function circularLayout(sg: SubGraph, realg: Graph, blockCount: number, allEdges: DerivedEdge[]): number;
+export declare function copyPositions(_sg: SubGraph): void;
+/**
+ * Multi-component overlap adjustment stub. C runs adjustNodes(sg) on each
+ * DERIVED component subgraph before packing (circularinit.c:212); porting
+ * that requires width/pos plumbing on derived nodes and no divergent
+ * corpus case reaches it yet. The single-component path (adjustNodesFull
+ * on the real graph, circularinit.c:203) IS ported — see circoLayout.
+ */
+export declare function adjustNodes(_sg: SubGraph): void;
+export declare function circoLayout(g: Graph): void;
+/** Pack and copy positions for multi-component graphs. */
+export declare function layoutMultiComponent(g: Graph, _dg: DerivedGraph, comps: SubGraph[], allEdges: DerivedEdge[], blockCount: number): void;
+/** Build a minimal Graph proxy so packSubgraphs can read node coords. */
+export declare function buildProxyGraph(sg: SubGraph, root: Graph): Graph;
+//# sourceMappingURL=circular.d.ts.map

package/dist/layout/circo/circular.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"circular.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/circular.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,OAAO,EACO,KAAK,QAAQ,EAAE,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAEjF,MAAM,aAAa,CAAC;AAarB,wDAAwD;AACxD,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,WAAW,CAUvD;AAED;;0EAE0E;AAC1E,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,YAAY,CAQxD;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,GAAG,WAAW,EAAE,CAgB3E;AAED,0EAA0E;AAC1E,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,QAAQ,EAAE,CAcjG;AAOD,kDAAkD;AAClD,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI,CAGnD;AAED,uDAAuD;AACvD,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAEhD;AAED,oEAAoE;AACpE,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAGhD;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,MAAM,CAW9G;AAOD,wBAAgB,aAAa,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAIjD;AAOD;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAE/C;AAOD,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAgB1C;AAED,0DAA0D;AAC1D,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE,UAAU,EAAE,MAAM,GAC1F,IAAI,CAWN;AAED,yEAAyE;AACzE,wBAAgB,eAAe,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,KAAK,CAUhE"}

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

@@ -0,0 +1,35 @@
+/**
+ * Circo circular layout engine — public entry point.
+ *
+ * Wires circoInitGraph, circoLayout, and cleanup into the LayoutEngine
+ * interface and exports CIRCO_LAYOUT_ENGINE for registration with GvcContext.
+ *
+ * Ordering (matches C circo_layout):
+ *   1. commonInitNodeEdge — set lw/rw/ht defaults for all nodes
+ *   2. circoInitGraph  — allocate ndata
+ *   3. circoLayout     — biconn + circle layout
+ *   4. freeNData       — null alg on first node (shared ndata block GC'd)
+ *   5. (spline routing — handled by caller / renderer)
+ *   6. dotneato_postprocess — handled by caller / renderer
+ *
+ * @see lib/circogen/circularinit.c:circo_layout
+ */
+import type { Graph } from '../../model/graph.js';
+import type { LayoutEngine } from '../../gvc/context.js';
+export { circoInitGraph, freeNData } from './init.js';
+export { circoLayout } from './circular.js';
+export { circPos } from './position.js';
+export { createBlocktree, freeBlocktree } from './blocktree.js';
+export { layoutBlock } from './blockpath.js';
+/** @see lib/circogen/circularinit.c:circo_layout */
+export declare function circoLayoutFull(g: Graph): void;
+/** @see lib/circogen/circularinit.c:circo_cleanup */
+export declare function circoCleanup(g: Graph): void;
+/**
+ * Registered layout engine for the 'circo' algorithm.
+ *
+ * @see lib/gvc/gvcext.h:gvlayout_engine_s
+ * @see lib/circogen/circularinit.c (plugin wiring)
+ */
+export declare const CIRCO_LAYOUT_ENGINE: LayoutEngine;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/index.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAWzD,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAM7C,oDAAoD;AACpD,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CA4B9C;AAED,qDAAqD;AACrD,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAI3C;AAED;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,EAAE,YAIjC,CAAC"}

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

@@ -0,0 +1,50 @@
+/**
+ * Per-node ndata type and graph initialisation for the circo engine.
+ *
+ * Ports the ndata struct from lib/circogen/circular.h and the
+ * circo_init_graph / circular_init_node_edge functions from
+ * lib/circogen/circularinit.c.
+ *
+ * Note: CircoCData (cdata) lives in blocks.ts alongside DerivedNode to
+ * avoid a circular import — cdata holds a back-reference to DerivedNode.
+ *
+ * @see lib/circogen/circular.h:ndata
+ * @see lib/circogen/circularinit.c:circo_init_graph
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+/**
+ * Algorithm data stored in ND_alg on original-graph nodes during init.
+ * Maps each original node to its counterpart in the derived graph.
+ *
+ * MEMORY: In C all ndata objects are allocated as one contiguous array;
+ * only the first node's alg reference is nulled in cleanup
+ * (matches C single-free pattern).
+ *
+ * @see lib/circogen/circular.h:ndata
+ */
+export interface CircoNData {
+    readonly kind: 'circo-ndata';
+    /** Pointer to this node's counterpart in the derived graph. */
+    dnode: Node | null;
+}
+/**
+ * Initialise all nodes in g for the circo layout pass.
+ *
+ * Allocates a CircoNData per node, sets 2-D position arrays, and builds
+ * the neato_nlist — matching circular_init_node_edge in the C source.
+ *
+ * ORDERING: alg must be freed (via freeNData) before spline routing.
+ *
+ * @see lib/circogen/circularinit.c:circo_init_graph
+ * @see lib/circogen/circularinit.c:circular_init_node_edge
+ */
+export declare function circoInitGraph(g: Graph): void;
+/**
+ * Release ndata from the first node (frees the shared contiguous block in C).
+ * Must be called before spline routing.
+ *
+ * @see lib/circogen/circularinit.c:circo_layout (free ND_alg line)
+ */
+export declare function freeNData(g: Graph): void;
+//# sourceMappingURL=init.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/init.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAGlD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAOhD;;;;;;;;;GASG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,+DAA+D;IAC/D,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC;CACpB;AAOD;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAc7C;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAGxC"}

package/dist/layout/circo/position-helpers.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Low-level rotation and delta-application helpers for block-tree positioning.
+ *
+ * Ports applyDelta and getRotation from lib/circogen/circpos.c.
+ * All functions are exported so lizard counts each one independently.
+ *
+ * @see lib/circogen/circpos.c
+ */
+import type { Node } from '../../model/node.js';
+import type { Block } from './blocks.js';
+/** 2-D rotation of (x,y) by (cosR, sinR). */
+export declare function rotatePoint(x: number, y: number, cosR: number, sinR: number): [number, number];
+/** Read psi from a node's alg field (set during Pass 4). */
+export declare function nodePsi(n: Node): number;
+/** getRotation: single-node block with preset parent_pos. */
+export declare function rotFromParentPos(sn: Block, theta: number): number;
+/** Find the node in sn closest to origin after translation by (x,y). */
+export declare function closestNode(sn: Block, x: number, y: number, skip: Node): Node;
+/** getRotation: COALESCED block — off-center trigonometric correction. */
+export declare function rotCoalesced(sn: Block, x: number, y: number, nbr: Node, theta: number): number;
+/** getRotation: general multi-node non-coalesced block. */
+export declare function rotGeneral(sn: Block, x: number, y: number, nbr: Node, theta: number): number;
+/**
+ * Apply rotation then translation to all nodes in sn and its children.
+ * @see lib/circogen/circpos.c:applyDelta
+ */
+export declare function applyDelta(sn: Block, x: number, y: number, rotate: number): void;
+/**
+ * Determine rotation angle for block sn given center offset (x, y).
+ * @see lib/circogen/circpos.c:getRotation
+ */
+export declare function getRotation(sn: Block, x: number, y: number, theta: number): number;
+//# sourceMappingURL=position-helpers.d.ts.map

package/dist/layout/circo/position-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"position-helpers.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/position-helpers.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAGzC,6CAA6C;AAC7C,wBAAgB,WAAW,CACzB,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAC/C,CAAC,MAAM,EAAE,MAAM,CAAC,CAElB;AAED,4DAA4D;AAC5D,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAEvC;AAED,6DAA6D;AAC7D,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAIjE;AAED,wEAAwE;AACxE,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAS7E;AAED,0EAA0E;AAC1E,wBAAgB,YAAY,CAC1B,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GACxD,MAAM,CAaR;AAED,2DAA2D;AAC3D,wBAAgB,UAAU,CACxB,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GACxD,MAAM,CAOR;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAUhF;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAOlF"}

package/dist/layout/circo/position.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Block-tree positioning orchestration for the circo layout engine.
+ *
+ * Ports getInfo, setInfo, positionChildren, position, doBlock, circPos
+ * from lib/circogen/circpos.c. All functions are exported so lizard
+ * counts each one independently.
+ *
+ * @see lib/circogen/circpos.c
+ */
+import type { Node } from '../../model/node.js';
+import type { Block, SubGraph, CircState } from './blocks.js';
+export type PosState = {
+    radius: number;
+    subtreeR: number;
+    nodeAngle: number;
+    firstAngle: number;
+    lastAngle: number;
+    /** All child blocks of the block being positioned (C: sn->children list). */
+    cp: Block[];
+    neighbor: Node | null;
+};
+export type PosInfo = {
+    n: Node;
+    theta: number;
+    minRadius: number;
+    maxRadius: number;
+    diameter: number;
+    scale: number;
+    childCount: number;
+};
+/** Context bundle for placeChild — keeps param count ≤5. */
+export type PlaceCtx = {
+    childRadius: number;
+    incAngle: number;
+    mindistAngle: number;
+    length: number;
+};
+/** Child blocks attached at node n with a non-empty circle list. */
+export declare function childrenAtNode(stp: PosState, n: Node): Block[];
+/** @see lib/circogen/circpos.c:getInfo */
+export declare function getInfo(pi: PosInfo, stp: PosState, minDist: number): number;
+/** @see lib/circogen/circpos.c:setInfo */
+export declare function setInfo(p0: PosInfo, p1: PosInfo, delta: number): void;
+/** Rotate and translate one child block; return advanced angle. */
+export declare function placeChild(child: Block, ca: number, ctx: PlaceCtx): number;
+/** Advance child angle for length===1 blocks; updates firstAngle/lastAngle. */
+export declare function advanceAngleL1(ca: number, inc: number, total: number, cnt: number, stp: PosState): number;
+/** Advance child angle for multi-node blocks. */
+export declare function advanceAngleLN(ca: number, inc: number, mda: number, total: number, theta: number): number;
+/** Write psi midpoint angle to node alg when conditions are met. */
+export declare function maybeWritePsi(n: Node, stp: PosState, ca: number, isMid: boolean): void;
+/** @see lib/circogen/circpos.c:positionChildren */
+export declare function positionChildren(pi: PosInfo, stp: PosState, length: number, minDist: number): void;
+/** Build PosInfo array for all articulation nodes in the circle path. */
+export declare function buildParents(nodepath: Node[], stp: PosState, minDist: number): PosInfo[];
+/** Apply pairwise setInfo scale factors. */
+export declare function applyScaleFactors(parents: PosInfo[]): void;
+/** Apply coalesce or expand radius after positioning children. */
+export declare function finaliseRadius(sn: Block, maxR: number, minDist: number, stp: PosState, childCount: number): void;
+/** @see lib/circogen/circpos.c:position */
+export declare function position(childCount: number, length: number, nodepath: Node[], sn: Block, minDist: number): number;
+/** @see lib/circogen/circpos.c:doBlock */
+export declare function doBlock(g: SubGraph, sn: Block, minDist: number, state: CircState): void;
+/** @see lib/circogen/circpos.c:circPos */
+export declare function circPos(g: SubGraph, sn: Block, state: CircState): void;
+//# sourceMappingURL=position.d.ts.map

package/dist/layout/circo/position.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"position.d.ts","sourceRoot":"","sources":["../../../src/layout/circo/position.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAK9D,MAAM,MAAM,QAAQ,GAAG;IACrB,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IACpD,UAAU,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IACtC,6EAA6E;IAC7E,EAAE,EAAE,KAAK,EAAE,CAAC;IAAC,QAAQ,EAAE,IAAI,GAAG,IAAI,CAAC;CACpC,CAAC;AAEF,MAAM,MAAM,OAAO,GAAG;IACpB,CAAC,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAC7D,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;CACrD,CAAC;AAEF,4DAA4D;AAC5D,MAAM,MAAM,QAAQ,GAAG;IAAE,WAAW,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEvG,oEAAoE;AACpE,wBAAgB,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,CAE9D;AAED,0CAA0C;AAC1C,wBAAgB,OAAO,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAS3E;AAED,0CAA0C;AAC1C,wBAAgB,OAAO,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAOrE;AAED,mEAAmE;AACnE,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,GAAG,MAAM,CAO1E;AAED,+EAA+E;AAC/E,wBAAgB,cAAc,CAC5B,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,GACjE,MAAM,CAKR;AAED,iDAAiD;AACjD,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGzG;AAED,oEAAoE;AACpE,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAKtF;AAED,mDAAmD;AACnD,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CA0BlG;AAED,yEAAyE;AACzE,wBAAgB,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,EAAE,CAWxF;AAED,4CAA4C;AAC5C,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,IAAI,CAa1D;AAED,kEAAkE;AAClE,wBAAgB,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI,CAQhH;AAED,2CAA2C;AAC3C,wBAAgB,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAYjH;AAED,0CAA0C;AAC1C,wBAAgB,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,GAAG,IAAI,CAUvF;AAED,0CAA0C;AAC1C,wBAAgB,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,GAAG,IAAI,CAEtE"}

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

@@ -0,0 +1,8 @@
+import type { Graph } from '../../model/graph.js';
+/**
+ * Break cycles in the fast graph by reversing DFS back edges.
+ * Reversed edges carry `EdgeInfo.reversed = true`.
+ * @see lib/dotgen/acyclic.c:acyclic
+ */
+export declare function acyclic(g: Graph): void;
+//# sourceMappingURL=acyclic.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"acyclic.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/acyclic.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AA4ClD;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAOtC"}

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

@@ -0,0 +1,17 @@
+/**
+ * Aspect ratio control for dot layout.
+ *
+ * The 'aspect' feature was never completed in Graphviz. This file exists
+ * to satisfy the pipeline call in dotinit.c.
+ *
+ * @see lib/dotgen/aspect.c
+ */
+import type { Graph } from '../../model/graph.js';
+/**
+ * Aspect ratio control — reads the 'aspect' attribute and would adjust
+ * layout, but the feature was never completed. This is a no-op.
+ *
+ * @see lib/dotgen/aspect.c:setAspect
+ */
+export declare function setAspect(_g: Graph): void;
+//# sourceMappingURL=aspect.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"aspect.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/aspect.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAElD;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAEzC"}

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

@@ -0,0 +1,52 @@
+/**
+ * TypeScript port of lib/dotgen/class1.c and lib/dotgen/class2.c.
+ *
+ * class1: initial edge classification — virtual edges for span-1 edges,
+ * intercluster edges via interclust1.
+ *
+ * class2: full edge classification — virtual node chains for long edges,
+ * flat/cluster/back edges, fast-graph setup for crossing minimization.
+ *
+ * @see lib/dotgen/class1.c
+ * @see lib/dotgen/class2.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+/**
+ * Returns true when edges e and f share the same port configuration.
+ * Note the asymmetry: only e's tail_port.defined is checked for tail coords.
+ * @see lib/dotgen/position.c:ports_eq
+ */
+export declare function portsEq(e: Edge, f: Edge): boolean;
+/**
+ * Returns true when the edge has constraint=false.
+ * @see lib/dotgen/class1.c:nonconstraint_edge
+ */
+export declare function nonconstraintEdge(e: Edge): boolean;
+/**
+ * Initial edge classification pass.
+ * @see lib/dotgen/class1.c:class1
+ */
+export declare function class1(g: Graph): void;
+/**
+ * Build a virtual node chain from `from` to `to` for edge `orig`.
+ * @see lib/dotgen/class2.c:make_chain
+ */
+export declare function makeChain(g: Graph, from: Node, to: Node, orig: Edge): void;
+/**
+ * Merge edge `e` into the virtual chain `f`, accumulating weights.
+ * @see lib/dotgen/class2.c:merge_chain
+ */
+export declare function mergeChain(g: Graph, e: Edge, f: Edge, updateCount: boolean): void;
+/**
+ * True when edges e and f connect the same endpoints, label, and ports.
+ * @see lib/dotgen/class2.c:mergeable
+ */
+export declare function mergeable(e: Edge | undefined, f: Edge | undefined): boolean;
+/**
+ * Full edge classification pass for the dot layout engine.
+ * @see lib/dotgen/class2.c:class2
+ */
+export declare function class2(g: Graph): void;
+//# sourceMappingURL=classify.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"classify.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/classify.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAkBhD;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAQjD;AAMD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAElD;AA2ED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAKrC;AAoDD;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAY1E;AAmBD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,GAAG,IAAI,CASjF;AAMD;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,CAAC,EAAE,IAAI,GAAG,SAAS,GAAG,OAAO,CAK3E;AA6LD;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAQrC"}

package/dist/layout/dot/cluster-path.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Slot manipulation, path mapping, and inter-cluster chain building
+ * for the dot cluster expansion phase.
+ *
+ * @see lib/dotgen/cluster.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+/** @see lib/dotgen/cluster.c:CLUSTER_EDGE */
+export declare const CLUSTER_EDGE = 5;
+/** @see lib/dotgen/cluster.c:map_interclust_node */
+export declare function mapInterclustNode(n: Node): Node;
+/** @see lib/dotgen/cluster.c:make_slots (contract branch) */
+export declare function makeSlotsContract(root: Graph, r: number, pos: number, d: number): void;
+/** @see lib/dotgen/cluster.c:make_slots (expand branch) */
+export declare function makeSlotsExpand(root: Graph, r: number, pos: number, d: number): void;
+/** @see lib/dotgen/cluster.c:make_slots */
+export declare function makeSlots(root: Graph, r: number, pos: number, d: number): void;
+/** @see lib/dotgen/cluster.c:clone_vn */
+export declare function cloneVn(g: Graph, vn: Node): Node;
+/** @see lib/dotgen/cluster.c:safe_other_edge */
+export declare function safeOtherEdge(e: Edge): void;
+/** @see lib/dotgen/cluster.c:ports_eq (simplified) */
+export declare function portsEqSimple(orig: Edge, e: Edge): boolean;
+/** @see lib/dotgen/cluster.c:map_path (multi-edge adjacent span) */
+export declare function mapPathAdjacentMulti(from: Node, to: Node, orig: Edge, ve: Edge, type: number): void;
+/** @see lib/dotgen/cluster.c:map_path (single adjacent span) */
+export declare function mapPathAdjacentSingle(from: Node, to: Node, orig: Edge, ve: Edge, type: number): void;
+/** @see lib/dotgen/cluster.c:map_path (single long span) */
+export declare function mapPathLongSingle(from: Node, to: Node, orig: Edge, ve: Edge, type: number): void;
+/** @see lib/dotgen/cluster.c:map_path (cnt > 1 branch) */
+export declare function mapPathMultiEdge(from: Node, to: Node, orig: Edge, ve: Edge, type: number): void;
+/** @see lib/dotgen/cluster.c:map_path */
+export declare function mapPath(from: Node, to: Node, orig: Edge, ve: Edge, type: number): void;
+/** @see lib/dotgen/cluster.c:make_interclust_chain */
+export declare function makeInterclustChain(from: Node, to: Node, orig: Edge): void;
+//# sourceMappingURL=cluster-path.d.ts.map

package/dist/layout/dot/cluster-path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster-path.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/cluster-path.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,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAShD,6CAA6C;AAC7C,eAAO,MAAM,YAAY,IAAI,CAAC;AAM9B,oDAAoD;AACpD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI/C;AAMD,6DAA6D;AAC7D,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAQtF;AAED,2DAA2D;AAC3D,wBAAgB,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAQpF;AAED,2CAA2C;AAC3C,wBAAgB,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAI9E;AAMD,yCAAyC;AACzC,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,CAUhD;AAMD,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAK3C;AAMD,sDAAsD;AACtD,wBAAgB,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAS1D;AAED,oEAAoE;AACpE,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAWnG;AAED,gEAAgE;AAChE,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAcpG;AAED,4DAA4D;AAC5D,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAiBhG;AAED,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAa/F;AAED,yCAAyC;AACzC,wBAAgB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAOtF;AAMD,sDAAsD;AACtD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAK1E"}