@knowvah/dot-engine 0.1.0

package/dist/layout/pack/poly-pack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"poly-pack.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/poly-pack.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAQ3C,iDAAiD;AACjD,MAAM,WAAW,KAAK;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,KAAK,EAAE,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,mEAAmE;AACnE,MAAM,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;AAEnC;;;;;;;;;GASG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAElD;AAED,qEAAqE;AACrE,wBAAgB,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,GAAG,OAAO,CAEpD;AAED,sEAAsE;AACtE,wBAAgB,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAErD;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAgB1E;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEtD;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEjD;AAED,6BAA6B;AAC7B,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,GAAG,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,GAAG,EAAE,MAAM,CAAC;CACb;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,YAAY,GAAG,KAAK,CAsB7C;AAED,iDAAiD;AACjD,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,QAAQ,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,GAAG,EAAE,CAAC;CACZ;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,GAAG,OAAO,CAM1F;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,GAAG,IAAI,CAKpF;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,GAAG,KAAK,GAAG,IAAI,CAenF;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAMlF;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,CAWvF;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAE1D;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,KAAK,EAAE,GAAG,IAAI,CAqBjF"}

package/dist/layout/pack/poly-place.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Polyomino-based packing of laid-out graphs (components), a port of
+ * the l_node/l_clust/l_graph modes of putGraphs.
+ *
+ * Each graph is approximated by the set of grid cells ("polyomino")
+ * covered by its nodes and edges (or its bounding box in l_graph
+ * mode); polyominoes are then placed largest-first on concentric
+ * rings around the origin.
+ *
+ * @see lib/pack/pack.c (Freivalds et al., GD 2002 polyomino packing)
+ */
+import type { Box, Point } from '../../model/geom.js';
+import type { Graph } from '../../model/graph.js';
+import type { PackInfo } from './types.js';
+/**
+ * Grid step size: positive root of the quadratic over total cell area.
+ * @see lib/pack/pack.c:computeStep
+ */
+export declare function computeStep(bbs: Box[], margin: number): number;
+/**
+ * Polyomino packing of pre-laid-out graphs. Returns the translation
+ * point for each graph (indexed like gs). When pinfo.fixed is set, the
+ * fixed (pinned) components stay put and the rest pack around them.
+ * @see lib/pack/pack.c:polyGraphs
+ */
+export declare function polyGraphs(gs: Graph[], root: Graph, pinfo: PackInfo, bbs: Box[]): Point[] | null;
+//# sourceMappingURL=poly-place.d.ts.map

package/dist/layout/pack/poly-place.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"poly-place.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/poly-place.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAGlD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AA+C3C;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAa9D;AA6QD;;;;;GAKG;AACH,wBAAgB,UAAU,CACxB,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,GACpD,KAAK,EAAE,GAAG,IAAI,CAkEhB"}

package/dist/layout/pack/spiral-search.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Concentric square spiral search for polyomino placement.
+ *
+ * Extracted from placeGraph so the spiral loop does not inflate the
+ * cyclomatic complexity of its caller.
+ *
+ * @see lib/pack/pack.c:placeGraph
+ */
+import type { Point } from '../../model/geom.js';
+import type { GInfo, PlaceCtx } from './poly-pack.js';
+/**
+ * Search for a valid placement on a concentric square spiral.
+ * Delegates to the wide or tall variant based on the bounding-box aspect ratio.
+ *
+ * @see lib/pack/pack.c:placeGraph
+ */
+export declare function spiralSearch(info: GInfo, ctx: PlaceCtx, wide: boolean): Point;
+//# sourceMappingURL=spiral-search.d.ts.map

package/dist/layout/pack/spiral-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spiral-search.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/spiral-search.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAqFtD;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,GAAG,KAAK,CAE7E"}

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

@@ -0,0 +1,7 @@
+import type { Box, Point } from '../../model/geom.js';
+import { type PackInfo } from './types.js';
+export declare function box(llx: number, lly: number, urx: number, ury: number): Box;
+export declare function defaultPackInfo(overrides?: Partial<PackInfo>): PackInfo;
+export declare function applyPlaces(bbs: Box[], places: Point[]): Box[];
+export declare function assertNoOverlap(placed: Box[]): void;
+//# sourceMappingURL=test-helpers.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"test-helpers.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/test-helpers.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,KAAK,QAAQ,EAAY,MAAM,YAAY,CAAC;AAErD,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,GAAG,CAE3E;AAED,wBAAgB,eAAe,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAMvE;AAED,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,EAAE,CAK9D;AAOD,wBAAgB,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAUnD"}

package/dist/layout/pack/types.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Shared types for the pack module.
+ *
+ * @see lib/pack/pack.h
+ */
+/**
+ * Granularity and method for packing.
+ *
+ * @see lib/pack/pack.h:pack_mode
+ */
+export declare const enum PackMode {
+    Undef = 0,
+    Cluster = 1,
+    Node = 2,
+    Graph = 3,
+    Array = 4,
+    Aspect = 5
+}
+/** @see lib/pack/pack.h:PK_COL_MAJOR */
+export declare const PK_COL_MAJOR: number;
+/** @see lib/pack/pack.h:PK_USER_VALS */
+export declare const PK_USER_VALS: number;
+/** @see lib/pack/pack.h:PK_LEFT_ALIGN */
+export declare const PK_LEFT_ALIGN: number;
+/** @see lib/pack/pack.h:PK_RIGHT_ALIGN */
+export declare const PK_RIGHT_ALIGN: number;
+/** @see lib/pack/pack.h:PK_TOP_ALIGN */
+export declare const PK_TOP_ALIGN: number;
+/** @see lib/pack/pack.h:PK_BOT_ALIGN */
+export declare const PK_BOT_ALIGN: number;
+/** @see lib/pack/pack.h:PK_INPUT_ORDER */
+export declare const PK_INPUT_ORDER: number;
+/**
+ * Packing parameters.
+ *
+ * @see lib/pack/pack.h:pack_info
+ */
+export interface PackInfo {
+    /** Desired aspect ratio. @see lib/pack/pack.h:pack_info.aspect */
+    aspect: number;
+    /** Row/column size. @see lib/pack/pack.h:pack_info.sz */
+    sz: number;
+    /** Margin around objects in points. @see lib/pack/pack.h:pack_info.margin */
+    margin: number;
+    /** Use splines when constructing graph shape. @see lib/pack/pack.h:pack_info.doSplines */
+    doSplines: boolean;
+    /** Granularity and method. @see lib/pack/pack.h:pack_info.mode */
+    mode: PackMode;
+    /** fixed[i] == true means graph i should not be moved. @see lib/pack/pack.h:pack_info.fixed */
+    fixed: boolean[] | null;
+    /** Sort values for array mode. @see lib/pack/pack.h:pack_info.vals */
+    vals: number[] | null;
+    /** Alignment/order flags. @see lib/pack/pack.h:pack_info.flags */
+    flags: number;
+}
+/**
+ * Conversion factor: points to inches.
+ *
+ * @see lib/common/geom.h:PS2INCH
+ */
+export declare const PS2INCH: number;
+/**
+ * Convert points to inches.
+ *
+ * @see lib/common/geom.h:PS2INCH
+ */
+export declare function ps2inch(pts: number): number;
+/**
+ * Convert inches to points.
+ *
+ * @see lib/common/geom.h:PS2INCH (inverse)
+ */
+export declare function inch2ps(inches: number): number;
+//# sourceMappingURL=types.d.ts.map

package/dist/layout/pack/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/layout/pack/types.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH;;;;GAIG;AACH,0BAAkB,QAAQ;IACxB,KAAK,IAAI;IACT,OAAO,IAAI;IACX,IAAI,IAAI;IACR,KAAK,IAAI;IACT,KAAK,IAAI;IACT,MAAM,IAAI;CACX;AAED,wCAAwC;AACxC,eAAO,MAAM,YAAY,QAAS,CAAC;AACnC,wCAAwC;AACxC,eAAO,MAAM,YAAY,QAAS,CAAC;AACnC,yCAAyC;AACzC,eAAO,MAAM,aAAa,QAAS,CAAC;AACpC,0CAA0C;AAC1C,eAAO,MAAM,cAAc,QAAS,CAAC;AACrC,wCAAwC;AACxC,eAAO,MAAM,YAAY,QAAS,CAAC;AACnC,wCAAwC;AACxC,eAAO,MAAM,YAAY,QAAS,CAAC;AACnC,0CAA0C;AAC1C,eAAO,MAAM,cAAc,QAAS,CAAC;AAErC;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,kEAAkE;IAClE,MAAM,EAAE,MAAM,CAAC;IACf,yDAAyD;IACzD,EAAE,EAAE,MAAM,CAAC;IACX,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAC;IACf,0FAA0F;IAC1F,SAAS,EAAE,OAAO,CAAC;IACnB,kEAAkE;IAClE,IAAI,EAAE,QAAQ,CAAC;IACf,+FAA+F;IAC/F,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACxB,sEAAsE;IACtE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACtB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;GAIG;AACH,eAAO,MAAM,OAAO,QAAS,CAAC;AAE9B;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE3C;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE9C"}

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

@@ -0,0 +1,136 @@
+/**
+ * Patchwork squarified treemap layout engine.
+ *
+ * Ports lib/patchwork/patchwork.c, lib/patchwork/patchworkinit.c, and
+ * lib/patchwork/tree_map.c into a single browser-compatible TypeScript module.
+ *
+ * NOTE: All helper and body functions are exported so that Lizard resets
+ * its cyclomatic-complexity counter at each `export function` boundary.
+ *
+ * @see lib/patchwork/patchwork.c
+ * @see lib/patchwork/patchworkinit.c
+ * @see lib/patchwork/tree_map.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { LayoutEngine } from '../../gvc/context.js';
+import type { Rectangle } from './tree-map.js';
+/** @see lib/patchwork/patchwork.c:treenode_t */
+export interface TreeNode {
+    area: number;
+    childArea: number;
+    r: Rectangle;
+    leftChild: TreeNode | null;
+    rightSib: TreeNode | null;
+    kind: 'graph' | 'node';
+    ref: Graph | Node;
+    nChildren: number;
+}
+/** Mutable linked-list accumulator used during mkTree child collection. */
+export interface ChildAccum {
+    first: TreeNode | null;
+    prev: TreeNode | null;
+    area: number;
+    nChildren: number;
+}
+/** @see lib/patchwork/patchwork.c:getArea */
+export declare function getArea(attrs: Map<string, string>): number;
+/** @see lib/patchwork/patchwork.c:fullArea (mp parameter) */
+export declare function getInset(attrs: Map<string, string>): number;
+/** @see lib/patchwork/patchwork.c:fullArea */
+export declare function fullArea(childArea: number, inset: number): number;
+/** Build a blank graph-kind TreeNode for g. @see lib/patchwork/patchwork.c:mkTree */
+export declare function makeGraphTreeNode(g: Graph): TreeNode;
+/** Build a leaf node-kind TreeNode for n. @see lib/patchwork/patchwork.c:mkTree */
+export declare function makeNodeTreeNode(n: Node): TreeNode;
+/** Append one child TreeNode into a ChildAccum linked list. */
+export declare function accumAppend(accum: ChildAccum, cp: TreeNode): void;
+/** Append all cluster children of g into accum. @see lib/patchwork/patchwork.c:mkTree */
+export declare function appendClusterChildren(g: Graph, sparent: Map<Node, Graph>, accum: ChildAccum): void;
+/** Append unclaimed direct nodes of g into accum. @see lib/patchwork/patchwork.c:mkTree */
+export declare function appendNodeChildren(g: Graph, sparent: Map<Node, Graph>, accum: ChildAccum): void;
+/** Finalise a TreeNode's area fields from an accumulated child list. */
+export declare function finaliseTreeNode(p: TreeNode, g: Graph, accum: ChildAccum): void;
+/**
+ * Recursively build the TreeNode tree from a Graph hierarchy.
+ * @see lib/patchwork/patchwork.c:mkTree
+ */
+export declare function mkTree(g: Graph, sparent: Map<Node, Graph>): TreeNode;
+/**
+ * Compute the inset margin m such that (h-m)(w-m) == childArea.
+ * Solves m² - (h+w)m + (hw - childArea) = 0; returns smaller root.
+ * For h=10, w=8, childArea=64 → result ≈ 0.9029 (within 1e-6).
+ * @see lib/patchwork/patchwork.c:layoutTree
+ */
+export declare function layoutTreeMargin(h: number, w: number, childArea: number): number;
+/** Collect sibling TreeNodes into a sorted (descending area) array. */
+export declare function collectSortedChildren(tree: TreeNode): TreeNode[];
+/** Compute the shrunken fill rectangle for treeMap. */
+export declare function computeFillRect(tree: TreeNode): Rectangle;
+/** Assign treeMap rectangles back onto sorted child nodes. */
+export declare function assignRecs(nodes: TreeNode[], recs: Rectangle[]): void;
+/** Recurse layoutTree into any graph-kind children (original sibling order). */
+export declare function recurseGraphChildren(tree: TreeNode): void;
+/** Squarify children into fill rect, assign recs, and recurse. */
+export declare function placeLayoutRecs(tree: TreeNode, nodes: TreeNode[]): void;
+/**
+ * Assign rectangles to the children of one tree node.
+ * @see lib/patchwork/patchwork.c:layoutTree
+ */
+export declare function layoutTree(tree: TreeNode): void;
+/** Write bounding box back to a graph node. @see lib/patchwork/patchwork.c:walkTree */
+export declare function applyGraphRect(tree: TreeNode): void;
+/** Write coord/size back to a leaf node. @see lib/patchwork/patchwork.c:walkTree */
+export declare function applyLeafRect(tree: TreeNode): void;
+/**
+ * Write computed rectangle data back to Graphviz node/graph structures.
+ * @see lib/patchwork/patchwork.c:walkTree
+ */
+export declare function walkTree(tree: TreeNode): void;
+/**
+ * A subgraph is a cluster if it is the root, its name begins (case-insensitively)
+ * with "cluster", OR it carries a truthy `cluster` attribute. The name-only test
+ * missed `cluster=true` subgraphs (e.g. 2717's `domestic_cats`), dropping them
+ * from the treemap cluster list. @see lib/common/utils.c:695 is_a_cluster
+ */
+export declare function isCluster(g: Graph): boolean;
+/** @see lib/patchwork/patchworkinit.c:mkClusters */
+export declare function collectClusters(g: Graph, clusters: Graph[]): void;
+/**
+ * Detect cluster subgraphs in g and populate g.info.clust.
+ * @see lib/patchwork/patchworkinit.c:mkClusters
+ */
+export declare function mkClusters(g: Graph): void;
+/**
+ * Core patchwork layout: build tree → sort → squarify → walk.
+ * @see lib/patchwork/patchwork.c:patchworkLayout
+ */
+export declare function patchworkLayout(g: Graph): void;
+/**
+ * Post-tiling per-node finish, mirroring C's walkTree -> finishNode:
+ * (a) a node whose fontsize attr is DECLARED but resolves empty gets
+ * fontsize = ND_ht*0.7 (%.03f) — the treemap-scaled label size; (b)
+ * common_init_node runs in full: label + xlabel creation and poly_init
+ * sizing. Crucially, poly_init CLOBBERS ND_width/ND_height with the
+ * label-driven size while the tile survives in ND_lw/rw/ht (which
+ * common_init_node never touches — gv_nodesize ran on the tile before).
+ * This clobber is load-bearing: addXLabels' addNodeObj builds xlabel
+ * obstacles from ND_width/ND_height (postproc.c:351), so native places
+ * xlabels against label-sized boxes, not tiles. Drawing and attach_attrs
+ * use lw/rw/ht, so the tile geometry still renders. The port's
+ * commonInitNode folds gv_nodesize in (storeNodeSize), so lw/rw/ht are
+ * saved and restored around it to keep the tile.
+ * @see lib/patchwork/patchwork.c:finishNode
+ * @see lib/common/postproc.c:351 addNodeObj (INCH2PS(ND_width/ND_height))
+ */
+export declare function finishNodes(g: Graph): void;
+/** @see lib/patchwork/patchworkinit.c:patchwork_layout */
+export declare function patchworkEngineLayout(g: Graph): void;
+/** @see lib/patchwork/patchworkinit.c:patchwork_cleanup */
+export declare function patchworkEngineCleanup(g: Graph): void;
+/**
+ * Patchwork squarified treemap layout engine.
+ * @see lib/patchwork/patchworkinit.c:patchwork_layout
+ */
+export declare const PATCHWORK_LAYOUT_ENGINE: LayoutEngine;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/patchwork/index.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAEzD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAiB/C,gDAAgD;AAChD,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,CAAC,EAAE,SAAS,CAAC;IACb,SAAS,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC3B,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC1B,IAAI,EAAE,OAAO,GAAG,MAAM,CAAC;IACvB,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,2EAA2E;AAC3E,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IACvB,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAMD,6CAA6C;AAC7C,wBAAgB,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAK1D;AAED,6DAA6D;AAC7D,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAK3D;AAED,8CAA8C;AAC9C,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGjE;AAMD,qFAAqF;AACrF,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAOpD;AAED,mFAAmF;AACnF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,GAAG,QAAQ,CAOlD;AAMD,+DAA+D;AAC/D,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,GAAG,IAAI,CAMjE;AAED,yFAAyF;AACzF,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,UAAU,GACrD,IAAI,CAIN;AAED,2FAA2F;AAC3F,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,UAAU,GACrD,IAAI,CAUN;AAED,wEAAwE;AACxE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAS/E;AAMD;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,QAAQ,CAOpE;AAMD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAIhF;AAMD,uEAAuE;AACvE,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAchE;AAED,uDAAuD;AACvD,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAKzD;AAED,8DAA8D;AAC9D,wBAAgB,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,IAAI,CAIrE;AAED,gFAAgF;AAChF,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAMzD;AAED,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAMvE;AAMD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAG/C;AAMD,uFAAuF;AACvF,wBAAgB,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAUnD;AAED,oFAAoF;AACpF,wBAAgB,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAQlD;AAMD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAE7C;AAMD;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAI3C;AAED,oDAAoD;AACpD,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,IAAI,CAKjE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAKzC;AAMD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAO9C;AAMD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAwB1C;AAED,0DAA0D;AAC1D,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CA2BpD;AAED,2DAA2D;AAC3D,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAIrD;AAED;;;GAGG;AACH,eAAO,MAAM,uBAAuB,EAAE,YAIrC,CAAC"}

package/dist/layout/patchwork/tree-map.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Squarified treemap algorithm (tree_map.c port).
+ *
+ * Implements the squarified treemap layout primitive: given a sorted
+ * (descending) array of areas and a fill rectangle, assigns one
+ * center-based Rectangle to each item while minimising aspect ratio.
+ *
+ * @see lib/patchwork/tree_map.c
+ * @see lib/patchwork/tree_map.h
+ */
+/**
+ * Center-based rectangle used by the squarified treemap algorithm.
+ * x[0] = center-x, x[1] = center-y.
+ * size[0] = width, size[1] = height.
+ *
+ * @see lib/patchwork/tree_map.h:rectangle
+ */
+export interface Rectangle {
+    x: [number, number];
+    size: [number, number];
+}
+/**
+ * Perform a squarified treemap layout on a single level.
+ *
+ * area[] must be sorted descending. Returns null if the total area exceeds
+ * the fill rectangle's capacity (plus 0.001 float tolerance). Otherwise
+ * returns an array of n center-based rectangles.
+ *
+ * @see lib/patchwork/tree_map.c:tree_map
+ */
+export declare function treeMap(n: number, area: readonly number[], fillrec: Rectangle): Rectangle[] | null;
+//# sourceMappingURL=tree-map.d.ts.map

package/dist/layout/patchwork/tree-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-map.d.ts","sourceRoot":"","sources":["../../../src/layout/patchwork/tree-map.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AAMH;;;;;;GAMG;AACH,MAAM,WAAW,SAAS;IACxB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpB,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxB;AAmID;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CACrB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,EAAE,SAAS,GACjB,SAAS,EAAE,GAAG,IAAI,CAWpB"}

package/dist/layout/patchwork/tree-node.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Internal tree node and construction helpers for the patchwork layout.
+ *
+ * Mirrors treenode_t and mkTree from lib/patchwork/patchwork.c.
+ *
+ * @see lib/patchwork/patchwork.c:treenode_t
+ * @see lib/patchwork/patchwork.c:mkTree
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Rectangle } from './tree-map.js';
+/** @see lib/patchwork/patchwork.c:treenode_t */
+export interface TreeNode {
+    area: number;
+    childArea: number;
+    r: Rectangle;
+    leftChild: TreeNode | null;
+    rightSib: TreeNode | null;
+    kind: 'graph' | 'node';
+    ref: Graph | Node;
+    nChildren: number;
+}
+/** @see lib/patchwork/patchwork.c:getArea */
+export declare function getArea(attrs: Map<string, string>): number;
+/** @see lib/patchwork/patchwork.c:fullArea (mp parameter) */
+export declare function getInset(attrs: Map<string, string>): number;
+/** wid = 2*inset + sqrt(childArea), area = wid². @see lib/patchwork/patchwork.c:fullArea */
+export declare function fullArea(childArea: number, inset: number): number;
+/** Mutable accumulator used during tree construction. */
+export interface ChildAccum {
+    first: TreeNode | null;
+    prev: TreeNode | null;
+    area: number;
+    nChildren: number;
+}
+/** Append all cluster children of g to accum. @see lib/patchwork/patchwork.c:mkTree */
+export declare function appendClusters(g: Graph, sparent: Map<Node, Graph>, accum: ChildAccum): void;
+/** Append unclaimed direct nodes of g to accum. @see lib/patchwork/patchwork.c:mkTree */
+export declare function appendNodes(g: Graph, sparent: Map<Node, Graph>, accum: ChildAccum): void;
+/**
+ * Recursively build the internal TreeNode tree from a Graph hierarchy.
+ * Nodes already owned by a cluster (sparent set) are skipped.
+ * @see lib/patchwork/patchwork.c:mkTree
+ */
+export declare function mkTree(g: Graph, sparent: Map<Node, Graph>): TreeNode;
+//# sourceMappingURL=tree-node.d.ts.map

package/dist/layout/patchwork/tree-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-node.d.ts","sourceRoot":"","sources":["../../../src/layout/patchwork/tree-node.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C,gDAAgD;AAChD,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,CAAC,EAAE,SAAS,CAAC;IACb,SAAS,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC3B,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC1B,IAAI,EAAE,OAAO,GAAG,MAAM,CAAC;IACvB,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAQD,6CAA6C;AAC7C,wBAAgB,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAK1D;AAED,6DAA6D;AAC7D,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAK3D;AAED,4FAA4F;AAC5F,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGjE;AAED,yDAAyD;AACzD,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IACvB,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,uFAAuF;AACvF,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAS3F;AAED,yFAAyF;AACzF,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAiBxF;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,QAAQ,CAmBpE"}

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

@@ -0,0 +1,39 @@
+/**
+ * sfdp layout engine entry point — the sfdp_layout pipeline:
+ * init → prism0 control resolution → per-component multilevel
+ * spring-electrical embedding → straight-line splines → component
+ * packing → postprocess.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/sfdpgen/sfdpinit.c:sfdp_layout (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+import type { LayoutEngine } from '../../gvc/context.js';
+import { type SpringElectricalControl } from './spring-electrical.js';
+import { multilevelSpringElectricalEmbedding } from './spring-driver.js';
+import { sfdpInitGraph, sfdpCleanup, tuneControl, makeMatrix, getSizes, getPos } from './init.js';
+export { sfdpInitGraph, sfdpCleanup, tuneControl, makeMatrix, getSizes, getPos };
+export { multilevelSpringElectricalEmbedding };
+/**
+ * Lay out one connected graph: adjacency matrix, label half-sizes,
+ * starting positions, the multilevel embedding, ND_pos write-back.
+ * @see lib/sfdpgen/sfdpinit.c:sfdpLayout (the static per-component fn)
+ */
+export declare function sfdpLayoutComponent(g: Graph, ctrl: SpringElectricalControl, pad: {
+    x: number;
+    y: number;
+}): void;
+/**
+ * The complete sfdp pipeline.
+ *
+ * The C libc rand() stream is process-global and each reference SVG
+ * was produced by a fresh process; reset the modeled stream to its
+ * process-start state (srand(1)) per layout so repeated renders in one
+ * JS process reproduce the C binary.
+ * @see lib/sfdpgen/sfdpinit.c:sfdp_layout
+ */
+export declare function sfdpLayout(g: Graph): void;
+/** @see lib/gvc/gvplugin.h:gvlayout_engine_s */
+export declare const SFDP_LAYOUT_ENGINE: LayoutEngine;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/index.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAsBzD,OAAO,EACL,KAAK,uBAAuB,EAE7B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,mCAAmC,EAAE,MAAM,oBAAoB,CAAC;AACzE,OAAO,EACL,aAAa,EACb,WAAW,EACX,WAAW,EACX,UAAU,EACV,QAAQ,EACR,MAAM,EACP,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AACjF,OAAO,EAAE,mCAAmC,EAAE,CAAC;AAK/C;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,uBAAuB,EAAE,GAAG,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GACrE,IAAI,CAYN;AA+GD;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CA4BzC;AAED,gDAAgD;AAChD,eAAO,MAAM,kBAAkB,EAAE,YAIhC,CAAC"}

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

@@ -0,0 +1,61 @@
+/**
+ * sfdp graph/node initialization and the adjust.c matrix/size helpers
+ * the sfdp pipeline feeds to the embedding.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/sfdpgen/sfdpinit.c (15.0.0)
+ * @see lib/neatogen/adjust.c:makeMatrix / getSizes (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+import { type SpMatrix } from './sparse-matrix.js';
+import { type SpringElectricalControl } from './spring-electrical.js';
+/** @see lib/sfdpgen/PriorityQueue.h via spring_electrical.h:SMOOTHING_NONE */
+export declare const SMOOTHING_NONE = 0;
+/**
+ * Graph-level init: line edges, 2-D, per-node neato init.
+ * GD_ndim handling is fixed at 2 — the "dim"/"dimen" 3D+ modes are not
+ * ported (no supported input sets them).
+ * @see lib/sfdpgen/sfdpinit.c:sfdp_init_graph
+ * @see lib/sfdpgen/sfdpinit.c:sfdp_init_node_edge
+ */
+export declare function sfdpInitGraph(g: Graph): void;
+/**
+ * Reset control fields from graph attributes.
+ * Unported control surfaces (smoothing != none, beautify) throw when an
+ * input selects them rather than silently approximating.
+ * @see lib/sfdpgen/sfdpinit.c:tuneControl
+ */
+export declare function tuneControl(g: Graph, ctrl: SpringElectricalControl): void;
+/**
+ * Build the weighted adjacency matrix from per-node out-edges,
+ * assigning sequential ND_id (n.info.id) in node order first.
+ * Out-edge iteration is head-seq ordered (cgraph agfstout semantics —
+ * see Node.outEdges).
+ * @see lib/neatogen/adjust.c:makeMatrix (15.0.0)
+ */
+export declare function makeMatrix(g: Graph): SpMatrix;
+/**
+ * Half node sizes plus padding, in inches, indexed by ND_id.
+ * The |edgelabel| branch (edge_labeling_scheme > 0) is not ported —
+ * no supported input sets label_scheme.
+ * @see lib/neatogen/adjust.c:getSizes (15.0.0)
+ */
+export declare function getSizes(g: Graph, pad: {
+    x: number;
+    y: number;
+}): number[];
+/**
+ * Starting coordinates by ND_id: all zeros unless some node carries a
+ * "pos" attribute (C checks the attr DECLARATION via agfindnodeattr;
+ * we scan per node — equivalent for parser-built graphs, where an attr
+ * exists only where set).
+ * @see lib/sfdpgen/sfdpinit.c:getPos
+ */
+export declare function getPos(g: Graph, dim: number): number[];
+/**
+ * Release per-node layout state.
+ * @see lib/sfdpgen/sfdpinit.c:sfdp_cleanup
+ */
+export declare function sfdpCleanup(g: Graph): void;
+//# sourceMappingURL=init.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/init.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AASlD,OAAO,EACL,KAAK,QAAQ,EAGd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,KAAK,uBAAuB,EAK7B,MAAM,wBAAwB,CAAC;AAEhC,8EAA8E;AAC9E,eAAO,MAAM,cAAc,IAAI,CAAC;AAIhC;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAoB5C;AAqDD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,uBAAuB,GAAG,IAAI,CAmBzE;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAmB7C;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,EAAE,CAQ1E;AAED;;;;;;GAMG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAetD;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK1C"}

package/dist/layout/sfdp/multilevel.d.ts

@@ -0,0 +1,23 @@
+import { type SpMatrix } from './sparse-matrix.js';
+/** @see lib/sfdpgen/Multilevel.h:Multilevel_struct */
+export interface Multilevel {
+    level: number;
+    n: number;
+    A: SpMatrix;
+    /** Prolongation from this level to the FINER level. */
+    P: SpMatrix | null;
+    /** Restriction to the COARSER level. */
+    R: SpMatrix | null;
+    next: Multilevel | null;
+    prev: Multilevel | null;
+}
+/**
+ * Build the multilevel hierarchy for weighting matrix A.
+ * @see lib/sfdpgen/Multilevel.c:Multilevel_new
+ */
+export declare function multilevelNew(A0: SpMatrix, maxlevel: number): Multilevel;
+/** @see lib/sfdpgen/Multilevel.c:Multilevel_get_coarsest */
+export declare function multilevelGetCoarsest(grid: Multilevel): Multilevel;
+/** Multilevel_is_finest. @see lib/sfdpgen/Multilevel.h */
+export declare function multilevelIsFinest(grid: Multilevel): boolean;
+//# sourceMappingURL=multilevel.d.ts.map

package/dist/layout/sfdp/multilevel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"multilevel.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/multilevel.ts"],"names":[],"mappings":"AAcA,OAAO,EACL,KAAK,QAAQ,EAQd,MAAM,oBAAoB,CAAC;AAc5B,sDAAsD;AACtD,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,QAAQ,CAAC;IACZ,uDAAuD;IACvD,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnB,wCAAwC;IACxC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnB,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IACxB,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;CACzB;AA6LD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,GAAG,UAAU,CAQxE;AAED,4DAA4D;AAC5D,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAIlE;AAED,0DAA0D;AAC1D,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAE5D"}

package/dist/layout/sfdp/quadtree.d.ts

@@ -0,0 +1,45 @@
+/** @see lib/sparse/QuadTree.h:node_data_struct */
+interface NodeData {
+    nodeWeight: number;
+    coord: number[];
+    id: number;
+    next: NodeData | null;
+}
+/** @see lib/sparse/QuadTree.h:QuadTree_struct */
+export interface QuadTree {
+    n: number;
+    totalWeight: number;
+    dim: number;
+    center: number[];
+    /** center ± width bounds the cell ("radius"). */
+    width: number;
+    average: number[] | null;
+    qts: (QuadTree | null)[] | null;
+    l: NodeData | null;
+    maxLevel: number;
+}
+/** Result arrays of one supernode query. */
+export interface Supernodes {
+    nsuper: number;
+    center: number[];
+    supernodeWgts: number[];
+    distances: number[];
+    counts: number;
+}
+/** @see lib/sparse/QuadTree.c:QuadTree_new */
+export declare function quadTreeNew(dim: number, center: number[], width: number, maxLevel: number): QuadTree;
+/** @see lib/sparse/QuadTree.c:QuadTree_add */
+export declare function quadTreeAdd(q: QuadTree, coord: number[], off: number, weight: number, id: number): void;
+/**
+ * Build a quadtree over n dim-dimensional points.
+ * @see lib/sparse/QuadTree.c:QuadTree_new_from_point_list
+ */
+export declare function quadTreeNewFromPointList(dim: number, n: number, maxLevel: number, coord: number[]): QuadTree;
+/**
+ * Collect the supernodes acting on the point at pt[ptOff..] (node
+ * `nodeid` excluded from leaf lists).
+ * @see lib/sparse/QuadTree.c:QuadTree_get_supernodes
+ */
+export declare function quadTreeGetSupernodes(qt: QuadTree, bh: number, pt: number[], ptOff: number, nodeid: number): Supernodes;
+export {};
+//# sourceMappingURL=quadtree.d.ts.map

package/dist/layout/sfdp/quadtree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quadtree.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/quadtree.ts"],"names":[],"mappings":"AAkBA,kDAAkD;AAClD,UAAU,QAAQ;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;CACvB;AAED,iDAAiD;AACjD,MAAM,WAAW,QAAQ;IACvB,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,CAAC;IACpB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,iDAAiD;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACzB,GAAG,EAAE,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;IAChC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,4CAA4C;AAC5C,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;CAChB;AAYD,8CAA8C;AAC9C,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ,CAYpG;AAsGD,8CAA8C;AAC9C,wBAAgB,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAEvG;AAED;;;GAGG;AACH,wBAAgB,wBAAwB,CACtC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GACxD,QAAQ,CAwBV;AAwCD;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GACpE,UAAU,CAUZ"}

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

@@ -0,0 +1,34 @@
+/**
+ * SparseMatrix products and the supervariable decomposition used by
+ * multilevel coarsening. Row entry order is the C mask-accumulator
+ * append order (NOT sorted) — load-bearing downstream.
+ *
+ * @see lib/sparse/SparseMatrix.c (15.0.0)
+ */
+import { type SpMatrix } from './sparse-matrix.js';
+/**
+ * C = A·B (REAL). Two-phase: count distinct columns per output, then
+ * mask-accumulate values in encounter order.
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_multiply
+ */
+export declare function smMultiply(A: SpMatrix, B: SpMatrix): SpMatrix;
+/**
+ * D = A·B·C (REAL), accumulated in one triple loop (encounter order —
+ * NOT the same float order as two pairwise multiplies).
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_multiply3
+ */
+export declare function smMultiply3(A: SpMatrix, B: SpMatrix, C: SpMatrix): SpMatrix;
+/**
+ * Group columns that share exactly the same row pattern (graph
+ * modules) into supervariables.
+ * The C walks an offset (nsuper++) pointer; here `ns` is indexed at
+ * +1 during the partition-refinement phase.
+ * @returns ncluster groups; cluster/clusterp in CSR-like layout
+ * @see lib/sparse/SparseMatrix.c:SparseMatrix_decompose_to_supervariables
+ */
+export declare function smDecomposeToSupervariables(A: SpMatrix): {
+    ncluster: number;
+    cluster: number[];
+    clusterp: number[];
+};
+//# sourceMappingURL=sparse-matrix-multiply.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sparse-matrix-multiply.d.ts","sourceRoot":"","sources":["../../../src/layout/sfdp/sparse-matrix-multiply.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,EACL,KAAK,QAAQ,EAGd,MAAM,oBAAoB,CAAC;AAE5B;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAa7D;AAuBD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAiB3E;AAED;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CACzC,CAAC,EAAE,QAAQ,GACV;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,CAa7D"}