@knowvah/dot-engine 0.1.0

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

@@ -0,0 +1,157 @@
+/**
+ * TypeScript port of lib/dotgen/dotsplines.c — dot_splines entry point,
+ * edgecmp, main routing loop.
+ *
+ * The full spline routing infrastructure (routesplines, pathplan, boxes)
+ * is not yet ported; this module provides the entry-point scaffolding and
+ * the edge-normalization pass that are testable independently.
+ *
+ * @see lib/dotgen/dotsplines.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Bezier, Spline, Port } from '../../model/geom.js';
+export declare const REGULAREDGE = 1;
+export declare const FLATEDGE = 2;
+export declare const SELFNPEDGE = 3;
+export declare const SELFWPEDGE = 4;
+export declare const EDGETYPEMASK = 7;
+export declare const FWDEDGE = 16;
+export declare const BWDEDGE = 32;
+export declare const MAINGRAPH = 64;
+export declare const AUXGRAPH = 128;
+export declare const GRAPHTYPEMASK = 192;
+export declare const EDGETYPE_NONE = 0;
+export declare const EDGETYPE_LINE = 1;
+export declare const EDGETYPE_CURVED = 2;
+export declare const EDGETYPE_PLINE = 3;
+export declare const EDGETYPE_ORTHO = 4;
+export declare const EDGETYPE_SPLINE = 5;
+export declare const EDGETYPE_COMPOUND = 6;
+/** Read edge type from graph flags. @see lib/common/const.h:EDGE_TYPE */
+export declare function edgeType(g: Graph): number;
+/**
+ * Map a `splines` attribute value to an edge type. `0`/`false`/`line`/`no` →
+ * LINE; a leading digit 1-9 / `true`/`yes`/`spline` → SPLINE; named values per
+ * the map; anything else → defaultValue. @see lib/common/utils.c:edgeType
+ */
+export declare function edgeTypeFromString(s: string, defaultValue: number): number;
+export declare function nodeRankOf(n: Node): number;
+export declare function nodeOrderOf(n: Node): number;
+export declare function nodeCoordX(n: Node): number;
+export declare function edgeTreeIndex(e: Edge): number;
+/** @see lib/dotgen/dotsplines.c:getmainedge */
+export declare function getMainEdge(e: Edge): Edge;
+/** Resolve to the underlying normal edge. */
+export declare function resolveOrigEdge(e: Edge): Edge;
+/** Compare head vs tail rank; return true if head rank < tail rank. */
+export declare function headRankLower(e: Edge): boolean;
+/** Compare head vs tail rank; return true if head rank > tail rank. */
+export declare function headRankHigher(e: Edge): boolean;
+/** @see lib/dotgen/dotsplines.c:swap_ends_p */
+export declare function swapEndsP(e: Edge): boolean;
+/** @see lib/dotgen/dotsplines.c:spline_merge */
+export declare function splineMerge(n: Node): boolean;
+/** Determine f1 (edge category) given hint or edge geometry. */
+export declare function resolveF1(e: Edge, hint1: number): number;
+/** Determine f2 for REGULAREDGE based on rank order. */
+export declare function resolveF2Regular(e: Edge): number;
+/** Determine f2 for FLATEDGE based on order. */
+export declare function resolveF2Flat(e: Edge): number;
+/** @see lib/dotgen/dotsplines.c:setflags — determine direction flag f2 */
+export declare function resolveF2(e: Edge, f1: number, hint2: number): number;
+/** @see lib/dotgen/dotsplines.c:setflags */
+export declare function setflags(e: Edge, hint1: number, hint2: number, f3: number): void;
+/** Compare two numbers: return -1, 0, or 1. */
+export declare function numCmp(a: number, b: number): number;
+/** Compare |rank difference| of two main edges. */
+export declare function cmpRankDiff(le0: Edge, le1: Edge): number;
+/** Compare |x-coord difference| of two main edges. */
+export declare function cmpXDiff(le0: Edge, le1: Edge): number;
+/**
+ * portcmp: undefined sorts before defined; defined ports order by (x, y).
+ * @see lib/dotgen/dotsplines.c:portcmp
+ */
+export declare function portcmp(p0: Port, p1: Port): number;
+/**
+ * Gate-edge ports in forward orientation: C picks ea = e when e carries a
+ * defined port, else its main edge, then views a BWDEDGE through makefwdedge
+ * (which swaps tail/head ports). Only the ports matter for comparison.
+ * @see lib/dotgen/dotsplines.c:edgecmp, dot_splines_ (ea/eb selection)
+ */
+export declare function gatePorts(e: Edge, le: Edge): [Port, Port];
+/** @see lib/dotgen/dotsplines.c:edgecmp */
+export declare function edgecmp(e0: Edge, e1: Edge): number;
+/**
+ * Reverse bezier control points and swap sflag/eflag, sp/ep.
+ *
+ * b.list may be over-allocated beyond b.size (newSpline pre-allocates pn
+ * slots; clip can shrink the real point count, leaving zeroed spare slots
+ * calloc'd at the tail). Only the bounded window list[0, size) holds real
+ * points, so the reverse must be an index-swap loop over that window —
+ * NOT a whole-array reverse, which would rotate the zeroed spares to the
+ * front. @see lib/dotgen/dotsplines.c:144-148 (swap_bezier)
+ */
+export declare function swapBezier(b: Bezier): void;
+/** Reverse the list of beziers in a spline and swap each bezier. */
+export declare function swapSpline(s: Spline): void;
+/**
+ * Swap an edge's spline AND its precomputed arrow-op slots. C regenerates
+ * arrows at emit time from each bezier's sp/ep + s/eflag, so swap_bezier's
+ * flag swap is complete there; the port precomputes arrow ops per edge END
+ * (tail/head slots) at clip time, so a spline swap must swap the slots too or
+ * the flag↔ops pairing breaks — on a multi-bezier reversed edge the per-bezier
+ * arrow interleave then finds no matching ops and the arrow falls to the
+ * group end ([path, path, arrow] vs C's [path, arrow, path]; b15
+ * LandVertical/Fall/HoverStrafeToStop groups).
+ * @see lib/dotgen/dotsplines.c:swap_bezier (sflag/eflag swap)
+ */
+export declare function swapEdgeSpline(e: Edge): void;
+/**
+ * Normalize splines so they always go from tail to head.
+ * @see lib/dotgen/dotsplines.c:edge_normalize
+ */
+export declare function edgeNormalize(g: Graph): void;
+/** True if edge e should be skipped during regular-edge collection. */
+export declare function isSkippedOutEdge(e: Edge): boolean;
+/** Collect regular out-edges of n into edges. */
+export declare function collectOutEdges(n: Node, edges: Edge[]): void;
+/** Collect flat out-edges of n into edges. */
+export declare function collectFlatEdges(n: Node, edges: Edge[]): void;
+/** True if n participates in edge routing. */
+export declare function nodeNeedsRouting(n: Node): boolean;
+/** Collect all edges for a node that need routing. */
+export declare function collectNodeEdges(n: Node, edges: Edge[]): void;
+/**
+ * Collect routing edges by iterating the rank array (`minrank..maxrank`,
+ * `v[0..n-1]`), null-guarding empty `.v` slots exactly as C does. This visits
+ * VIRTUAL `splineMerge` nodes in addition to NORMAL nodes, so the merged
+ * secondary chains that a `concentrate` DOWN-sweep rewires onto a virtual merge
+ * node's out-list are gathered and routed (they are absent from `g.nodes`).
+ * `nodeNeedsRouting` still gates each node to NORMAL || splineMerge.
+ * @see lib/dotgen/dotsplines.c:dot_splines_ (281-320)
+ */
+export declare function collectRankEdges(g: Graph, edges: Edge[]): void;
+/**
+ * Main spline routing entry point (internal, with normalize flag).
+ *
+ * Performs straight-line edge routing via routeDotEdges, then normalizes
+ * spline orientation when normalize=true. The full pathplan-based obstacle
+ * routing (routesplines, boxes, clip_and_install) is deferred.
+ *
+ * @see lib/dotgen/dotsplines.c:dot_splines_
+ */
+/**
+ * In position, each node's rw was stored in mval and rw may have been
+ * increased to reflect loops/labels; restore the original rw here.
+ * @see lib/dotgen/dotsplines.c:resetRW
+ */
+export declare function resetRW(g: Graph): void;
+export declare function dotSplines_(g: Graph, normalize: boolean): number;
+/**
+ * Entry point called by the dot layout pipeline.
+ * @see lib/dotgen/dotsplines.c:dot_splines
+ */
+export declare function dotSplines(g: Graph): number;
+//# sourceMappingURL=splines.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"splines.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/splines.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;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;AAChD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAkBhE,eAAO,MAAM,WAAW,IAAO,CAAC;AAChC,eAAO,MAAM,QAAQ,IAAU,CAAC;AAChC,eAAO,MAAM,UAAU,IAAQ,CAAC;AAChC,eAAO,MAAM,UAAU,IAAQ,CAAC;AAChC,eAAO,MAAM,YAAY,IAAM,CAAC;AAEhC,eAAO,MAAM,OAAO,KAAY,CAAC;AACjC,eAAO,MAAM,OAAO,KAAY,CAAC;AAEjC,eAAO,MAAM,SAAS,KAAU,CAAC;AACjC,eAAO,MAAM,QAAQ,MAAY,CAAC;AAClC,eAAO,MAAM,aAAa,MAAO,CAAC;AASlC,eAAO,MAAM,aAAa,IAAQ,CAAC;AACnC,eAAO,MAAM,aAAa,IAAQ,CAAC;AACnC,eAAO,MAAM,eAAe,IAAM,CAAC;AACnC,eAAO,MAAM,cAAc,IAAO,CAAC;AACnC,eAAO,MAAM,cAAc,IAAO,CAAC;AACnC,eAAO,MAAM,eAAe,IAAM,CAAC;AACnC,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC,yEAAyE;AACzE,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAEzC;AASD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAM1E;AAMD,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA6B;AACxE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA8B;AAC1E,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAiC;AAC5E,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAmC;AAOjF,+CAA+C;AAC/C,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAKzC;AAOD,6CAA6C;AAC7C,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI7C;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAE9C;AAED,uEAAuE;AACvE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAE/C;AAED,+CAA+C;AAC/C,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAK1C;AAOD,gDAAgD;AAChD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAG5C;AAOD,gEAAgE;AAChE,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAQxD;AAED,wDAAwD;AACxD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAEhD;AAED,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAE7C;AAED,0EAA0E;AAC1E,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAKpE;AAED,4CAA4C;AAC5C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAIhF;AAOD,+CAA+C;AAC/C,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAInD;AAED,mDAAmD;AACnD,wBAAgB,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,MAAM,CAIxD;AAED,sDAAsD;AACtD,wBAAgB,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,MAAM,CAIrD;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,MAAM,CAQlD;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAIzD;AAED,2CAA2C;AAC3C,wBAAgB,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,MAAM,CAsBlD;AAOD;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAS1C;AAED,oEAAoE;AACpE,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAG1C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAM5C;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAO5C;AAOD,uEAAuE;AACvE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAGjD;AAED,iDAAiD;AACjD,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAQ5D;AAED,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAO7D;AAED,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAEjD;AAED,sDAAsD;AACtD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAK7D;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAiB9D;AAOD;;;;;;;;GAQG;AACH;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAStC;AAsDD,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,GAAG,MAAM,CA6BhE;AAeD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE3C"}

package/dist/layout/dot/straight-edges.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Curved / straight edge generator for the dot engine.
+ *
+ * Faithful port of `makeStraightEdges` and its helpers `bend`,
+ * `get_cycle_centroid`, `get_centroid` and the cycle-finding routines from
+ * `lib/common/routespl.c`. Used by `splines=curved` (`EDGETYPE_CURVED`): each
+ * parallel-edge group is routed by `makeStraightEdges` instead of the normal
+ * per-group spline router (mirroring `dotsplines.c:381-387`).
+ *
+ * Reuses the ported `clipAndInstall` (`common/splines-clip.ts`). `addEdgeLabels`
+ * mirrors `makePortLabels` (`splines.c:1205-1220,1307-1309`): a no-op unless
+ * `labelangle`/`labeldistance` is declared.
+ *
+ * @see lib/common/routespl.c:773-1042
+ * @see lib/dotgen/dotsplines.c:381-387 (curved dispatch)
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Edge } from '../../model/edge.js';
+import type { SplineInfo } from '../../common/types.js';
+/**
+ * Adds head/tail port labels and updates the bbox. No-op unless
+ * `labelangle`/`labeldistance` is declared (handled as external labels
+ * otherwise). @see lib/common/splines.c:1205-1220,1307-1309
+ */
+export declare function addEdgeLabels(e: Edge): void;
+/**
+ * Route a group of straight/curved edges between the same endpoints.
+ *
+ * Single edge (or `Concentrate`): a 4-point bezier from tail port to head port,
+ * bent toward the cycle centroid when curved. Multiple edges: control points
+ * spread symmetrically along the perpendicular by `GD_nodesep` steps.
+ *
+ * `edgeList[0]` is the main edge (per `dotsplines.c:383`); the head of each
+ * subsequent edge is compared to the group head to orient its control points.
+ *
+ * @see lib/common/routespl.c:975-1042
+ */
+export declare function makeStraightEdges(g: Graph, edgeList: Edge[], eCnt: number, et: number, sinfo: SplineInfo): void;
+//# sourceMappingURL=straight-edges.d.ts.map

package/dist/layout/dot/straight-edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"straight-edges.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/straight-edges.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAElD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AA8LxD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAS3C;AAqED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAwB/G"}

package/dist/layout/fdp/cluster-edges.d.ts

@@ -0,0 +1,31 @@
+/**
+ * fdp compound / cluster-edge preprocessing (processClusterEdges).
+ *
+ * When an edge endpoint names a cluster (a node whose name matches a cluster
+ * subgraph — e.g. `e -- clusterB` where `subgraph clusterB {…}` exists), fdp
+ * does NOT draw that node. Instead it replaces the cluster-named endpoint with
+ * an invisible box "cluster node" sized to the cluster (setClustNodes) and
+ * clones the edge onto it, then DELETES the original visible node. dot/neato
+ * keep drawing such a node; only fdp performs this substitution, via
+ * `processClusterEdges` at the top of `fdp_init_node_edge`.
+ *
+ * The cluster node carries the `clustnode` flag (ND_clustnode): deriveGraph
+ * skips it (it is positioned by setClustNodes, not the force solver) and the
+ * dot serializer suppresses its declaration and writes its name as the cluster
+ * name (the part after the synthetic `__i:` prefix).
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/fdpinit.c:fdp_init_node_edge (processClusterEdges call)
+ * @see lib/common/utils.c:processClusterEdges, checkCompound, clustNode
+ */
+import type { Graph } from '../../model/graph.js';
+/**
+ * Replace cluster-edge endpoints that name a cluster with invisible cluster
+ * nodes, clone the edges onto them, and delete the original nodes. Records the
+ * cluster-edge count on the graph (HAS_CLUST_EDGE). Must run after mkClusters
+ * (needs info.clust) and before node ids are assigned.
+ * @see lib/common/utils.c:processClusterEdges
+ */
+export declare function processClusterEdges(g: Graph): void;
+//# sourceMappingURL=cluster-edges.d.ts.map

package/dist/layout/fdp/cluster-edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster-edges.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/cluster-edges.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AA+LlD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAmBlD"}

package/dist/layout/fdp/comp.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Generalized connected components of a derived graph: all port nodes
+ * and pinned nodes are merged into the first component.
+ *
+ * Components are Graph instances parented to the derived graph (so
+ * attribute lookups fall through, as C subgraphs resolve to the dg
+ * root). Their node maps are populated in ascending derived-node id —
+ * cgraph subgraph iteration is id-ordered, not DFS-ordered (mission 5
+ * finding) — and edges are node-induced in dg edge order.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/comp.c (15.0.0)
+ */
+import { Graph } from '../../model/graph.js';
+/**
+ * Find the generalized connected components of derived graph dg.
+ * Ports and pinned nodes all land in the first component.
+ *
+ * @returns components plus whether pinned nodes exist
+ * @see lib/fdpgen/comp.c:findCComp
+ */
+export declare function findCComp(dg: Graph, counter: {
+    value: number;
+}): {
+    comps: Graph[];
+    pinned: boolean;
+};
+//# sourceMappingURL=comp.d.ts.map

package/dist/layout/fdp/comp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comp.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/comp.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAyC7C;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,EAAE,EAAE,KAAK,EACT,OAAO,EAAE;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,GACzB;IAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,CAcrC"}

package/dist/layout/fdp/derive.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Derived-graph construction: clusters collapse into single nodes, and
+ * an edge joins two derived nodes when any real edge joins their
+ * underlying node sets. Boundary ports transform into port nodes.
+ *
+ * The C derived graph is a strict digraph whose edge direction is
+ * canonicalized by node POINTER comparison (`hd > tl`, layout.c:466);
+ * node ids are creation-ordered here, so id comparison models it.
+ * agedge with a NULL name dedups on strict digraphs (cgraph
+ * edge.c:262), merging parallel real edges into one derived edge.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/layout.c:deriveGraph (15.0.0)
+ */
+import { Graph } from '../../model/graph.js';
+import { Node } from '../../model/node.js';
+/** Per-fdp-run bookkeeping. @see lib/fdpgen/layout.c:layout_info */
+export interface LayoutInfo {
+    /** Logical root; the graph passed to fdp_layout. */
+    rootg: Graph;
+    /** Whether a "coords" graph attribute exists (G_coord symbol). */
+    hasCoords: boolean;
+    gid: number;
+    /** Pack parameters resolved by init_info. */
+    pack: import('../pack/types.js').PackInfo;
+}
+/**
+ * Construct a node in a derived graph, allocating its dndata.
+ * @see lib/fdpgen/layout.c:mkDeriveNode
+ */
+export declare function mkDeriveNode(dg: Graph, name: string): Node;
+/**
+ * Create the derived graph of g by collapsing clusters into nodes.
+ * @returns null on the non-comparable-clusters input error
+ * @see lib/fdpgen/layout.c:deriveGraph
+ */
+export declare function deriveGraph(g: Graph, infop: LayoutInfo): Graph | null;
+//# sourceMappingURL=derive.d.ts.map

package/dist/layout/fdp/derive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"derive.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/derive.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAuB3C,oEAAoE;AACpE,MAAM,WAAW,UAAU;IACzB,oDAAoD;IACpD,KAAK,EAAE,KAAK,CAAC;IACb,kEAAkE;IAClE,SAAS,EAAE,OAAO,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;IACZ,6CAA6C;IAC7C,IAAI,EAAE,OAAO,kBAAkB,EAAE,QAAQ,CAAC;CAC3C;AAMD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAM1D;AAsLD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,GAAG,KAAK,GAAG,IAAI,CAiBrE"}

package/dist/layout/fdp/fdp-model.d.ts

@@ -0,0 +1,101 @@
+/**
+ * fdp engine data model — gdata, dndata, bport_t, xparams, and the
+ * accessor macros of the C private interface.
+ *
+ * Spec read at the 15.0.0 tag (post-tag fdpgen commits add an Mlimit
+ * branch and float reorderings the golden refs do not have).
+ *
+ * @see lib/fdpgen/fdp.h (15.0.0)
+ * @see lib/fdpgen/xlayout.h (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Box } from '../../model/geom.js';
+import type { FdpAlgData, FdpDndata } from '../../model/nodeInfo.js';
+/** Layout dimension. @see lib/fdpgen/fdp.h:NDIM */
+export declare const NDIM = 2;
+/** Position supplied by user. @see lib/common/const.h:P_SET */
+export declare const P_SET = 1;
+/** Position fixed during topological layout. @see lib/common/const.h:P_FIX */
+export declare const P_FIX = 2;
+/** Position fixed. @see lib/common/const.h:P_PIN */
+export declare const P_PIN = 3;
+/**
+ * Boundary port: a real edge crossing the cluster boundary, the inside
+ * endpoint, and its angle on the boundary ellipse. C arrays are
+ * 0-terminated; TS uses plain arrays.
+ *
+ * @see lib/fdpgen/fdp.h:bport_t
+ */
+export interface Bport {
+    e: Edge;
+    n: Node;
+    alpha: number;
+}
+/** @see lib/fdpgen/xlayout.h:xparams */
+export interface XParams {
+    numIters: number;
+    T0: number;
+    K: number;
+    C: number;
+    loopcnt: number;
+}
+/** @see lib/fdpgen/fdp.h:gdata */
+export interface Gdata {
+    /** Boundary ports. @see lib/fdpgen/fdp.h:PORTS */
+    ports: Bport[] | null;
+    /** Number of ports. @see lib/fdpgen/fdp.h:NPORTS */
+    nports: number;
+    /** Bounding box of graph in INCHES. @see lib/fdpgen/fdp.h:BB */
+    bb: Box;
+    flags: number;
+    /** Depth in graph hierarchy. @see lib/fdpgen/fdp.h:LEVEL */
+    level: number;
+    /** Smallest containing cluster. @see lib/fdpgen/fdp.h:GPARENT */
+    parent: Graph | null;
+}
+/** Allocate a zeroed gdata record (gv_alloc equivalent). */
+export declare function mkGdata(): Gdata;
+/** GDATA(g) — gdata bound to g.info.alg; binds one if missing. */
+export declare function gdata(g: Graph): Gdata;
+/** Allocate a zeroed dndata record. @see lib/fdpgen/layout.c:mkDeriveNode */
+export declare function mkDndata(): FdpDndata;
+/** DNDATA(n) — dndata of a derived node. */
+export declare function dndata(n: Node): FdpDndata;
+/** DISP(n) @see lib/fdpgen/fdp.h:DISP */
+export declare function disp(n: Node): [number, number];
+/** ANODE(n) @see lib/fdpgen/fdp.h:ANODE */
+export declare function anode(n: Node): Node | null;
+/** IS_PORT(n) @see lib/fdpgen/fdp.h:IS_PORT */
+export declare function isPort(n: Node): boolean;
+/** Bind-or-get the fdp alg record on a REAL node. */
+export declare function fdpData(n: Node): FdpAlgData;
+/** DNODE(n) @see lib/fdpgen/fdp.h:DNODE */
+export declare function getDnode(n: Node): Node | null;
+/** DNODE(n) = dn */
+export declare function setDnode(n: Node, dn: Node | null): void;
+/** PARENT(n) @see lib/fdpgen/fdp.h:PARENT */
+export declare function getParent(n: Node): Graph | null;
+/** PARENT(n) = g */
+export declare function setParent(n: Node, g: Graph): void;
+/** ND_pinned for a derived node. */
+export declare function dnPinned(n: Node): number;
+/** hasPos(n) @see lib/neatogen/neato.h:hasPos */
+export declare function hasPos(n: Node): boolean;
+/** Real edges merged into a derived edge. @see lib/fdpgen/layout.c:addEdge */
+export declare function realEdges(de: Edge): Edge[];
+/** NEW_EDGE(e) — no real edge recorded yet. @see lib/fdpgen/layout.c:NEW_EDGE */
+export declare function isNewEdge(de: Edge): boolean;
+/**
+ * Add real edge e to its image de in the derived graph.
+ * @see lib/fdpgen/layout.c:addEdge
+ */
+export declare function addEdge(de: Edge, e: Edge): void;
+/**
+ * agget(g, name): look up an attribute on g, falling back up the parent
+ * chain (derived components resolve attrs copied onto the derived root).
+ * @see lib/cgraph/attr.c:agget
+ */
+export declare function aggetGraph(g: Graph, name: string): string | undefined;
+//# sourceMappingURL=fdp-model.d.ts.map

package/dist/layout/fdp/fdp-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fdp-model.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/fdp-model.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;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;AAChD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAErE,mDAAmD;AACnD,eAAO,MAAM,IAAI,IAAI,CAAC;AAMtB,+DAA+D;AAC/D,eAAO,MAAM,KAAK,IAAI,CAAC;AACvB,8EAA8E;AAC9E,eAAO,MAAM,KAAK,IAAI,CAAC;AACvB,oDAAoD;AACpD,eAAO,MAAM,KAAK,IAAI,CAAC;AAMvB;;;;;;GAMG;AACH,MAAM,WAAW,KAAK;IACpB,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;CACf;AAMD,wCAAwC;AACxC,MAAM,WAAW,OAAO;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,MAAM,CAAC;CACjB;AAMD,kCAAkC;AAClC,MAAM,WAAW,KAAK;IACpB,kDAAkD;IAClD,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IACtB,oDAAoD;IACpD,MAAM,EAAE,MAAM,CAAC;IACf,gEAAgE;IAChE,EAAE,EAAE,GAAG,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,KAAK,EAAE,MAAM,CAAC;IACd,iEAAiE;IACjE,MAAM,EAAE,KAAK,GAAG,IAAI,CAAC;CACtB;AAED,4DAA4D;AAC5D,wBAAgB,OAAO,IAAI,KAAK,CAS/B;AAED,kEAAkE;AAClE,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAOrC;AAMD,6EAA6E;AAC7E,wBAAgB,QAAQ,IAAI,SAAS,CAUpC;AAED,4CAA4C;AAC5C,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,CAEzC;AAED,yCAAyC;AACzC,wBAAgB,IAAI,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAE9C;AAED,2CAA2C;AAC3C,wBAAgB,KAAK,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,CAE1C;AAED,+CAA+C;AAC/C,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAGvC;AAMD,qDAAqD;AACrD,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,UAAU,CAO3C;AAED,2CAA2C;AAC3C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,CAG7C;AAED,oBAAoB;AACpB,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,CAEvD;AAED,6CAA6C;AAC7C,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,IAAI,CAG/C;AAED,oBAAoB;AACpB,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAEjD;AAMD,oCAAoC;AACpC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAExC;AAED,iDAAiD;AACjD,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAEvC;AAMD,8EAA8E;AAC9E,wBAAgB,SAAS,CAAC,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,CAE1C;AAED,iFAAiF;AACjF,wBAAgB,SAAS,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAE3C;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAQ/C;AAMD;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAQrE"}

package/dist/layout/fdp/grid.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Spatial grid used to localise repulsive-force computation: on each
+ * pass nodes are bucketed into cells; repulsion is only computed
+ * against nodes in the 9 adjacent cells.
+ *
+ * Ordering is load-bearing for float reproducibility:
+ * - C's dtwalk over a Dtoset dictionary visits cells in ascending
+ *   (i, j) order (grid.c:ijcmpf) — walk() replicates that sort.
+ * - C prepends nodes to each cell's list (grid.c:newNode), so within a
+ *   cell nodes appear in REVERSE insertion order — add() unshifts.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/grid.c (15.0.0)
+ */
+import type { Node } from '../../model/node.js';
+/** One grid cell. @see lib/fdpgen/grid.h:cell */
+export interface Cell {
+    i: number;
+    j: number;
+    /** Nodes in reverse insertion order. @see lib/fdpgen/grid.c:newNode */
+    nodes: Node[];
+}
+/**
+ * The grid: cells keyed by (i, j).
+ * Block allocators (newBlock/getCell) are memory management with no
+ * behavioral effect and are not ported.
+ *
+ * @see lib/fdpgen/grid.c:_grid
+ */
+export declare class Grid {
+    private readonly cells;
+    /** Reset the grid, reusing storage. @see lib/fdpgen/grid.c:clearGrid */
+    clear(): void;
+    /** Add node n to cell (i, j). @see lib/fdpgen/grid.c:addGrid */
+    add(i: number, j: number, n: Node): void;
+    /** Cell at (i, j), if any. @see lib/fdpgen/grid.c:findGrid */
+    find(i: number, j: number): Cell | undefined;
+    /**
+     * Apply walkf to each cell in ascending (i, j) order — the dtwalk
+     * traversal order of the Dtoset dictionary.
+     * @see lib/fdpgen/grid.c:walkGrid
+     * @see lib/fdpgen/grid.c:ijcmpf
+     */
+    walk(walkf: (c: Cell, g: Grid) => void): void;
+}
+/** Number of nodes in a cell. @see lib/fdpgen/grid.c:gLength */
+export declare function gLength(c: Cell): number;
+//# sourceMappingURL=grid.d.ts.map

package/dist/layout/fdp/grid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"grid.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/grid.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD,iDAAiD;AACjD,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,uEAAuE;IACvE,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED;;;;;;GAMG;AACH,qBAAa,IAAI;IACf,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA2B;IAEjD,wEAAwE;IACxE,KAAK,IAAI,IAAI;IAIb,gEAAgE;IAChE,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI;IAUxC,8DAA8D;IAC9D,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAI5C;;;;;OAKG;IACH,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;CAM9C;AAED,gEAAgE;AAChE,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAEvC"}

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

@@ -0,0 +1,36 @@
+/**
+ * fdp layout engine entry point — the fdp_layout pipeline:
+ * init (clusters, params, nodes/edges) → recursive layout →
+ * aspect/coord sync → straight-line splines → label placement.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/layout.c:fdp_layout (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+import type { LayoutEngine } from '../../gvc/context.js';
+export { fdpLayout, mkClusters, evalPositions, setBB } from './layout.js';
+export { fdpTLayout } from './tlayout.js';
+export { fdpXLayout } from './xlayout.js';
+export { findCComp } from './comp.js';
+export { deriveGraph, type LayoutInfo } from './derive.js';
+export { fdpInitNodeEdge, fdpCleanup } from './init.js';
+export { fdpInitParams, fdpParms } from './tlayout-parms.js';
+/**
+ * Graph-level initialization: edge type, gdata, clusters, parameters,
+ * nodes and edges. GD_ndim is fixed at 2 (the "dim" attribute's 3D+
+ * modes are not ported — no supported input sets it).
+ * @see lib/fdpgen/layout.c:fdp_init_graph
+ */
+export declare function fdpInitGraph(g: Graph): void;
+/**
+ * The complete fdp pipeline.
+ * @see lib/fdpgen/layout.c:fdp_layout
+ */
+export declare function fdpLayoutEngine(g: Graph): void;
+/**
+ * fdp LayoutEngine plugin for registration with GvcContext.
+ * @see lib/gvc/gvplugin.h:gvlayout_engine_s
+ */
+export declare const fdpEngine: LayoutEngine;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/index.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAezD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,aAAa,CAAC;AAC3D,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAE7D;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAW3C;AAYD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAiC9C;AAED;;;GAGG;AACH,eAAO,MAAM,SAAS,EAAE,YAIvB,CAAC"}

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

@@ -0,0 +1,26 @@
+/**
+ * fdp node/edge initialization and cleanup.
+ *
+ * processClusterEdges (cluster-endpoint/compound edges: an edge whose endpoint
+ * names a cluster, e.g. `e -- clusterB`) runs first, mirroring C — it replaces
+ * such endpoints with invisible cluster nodes and deletes the original nodes,
+ * so fdp (unlike dot/neato) does not draw a node for the cluster name.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/fdpinit.c (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+/**
+ * Initialize all nodes and edges of g for fdp layout. Node sizing
+ * (common_init_node + gv_nodesize) runs via commonInitNodeEdge.
+ * @see lib/fdpgen/fdpinit.c:fdp_init_node_edge
+ */
+export declare function fdpInitNodeEdge(g: Graph): void;
+/**
+ * Release fdp layout state (gv_cleanup analogue; the render pipeline
+ * runs before cleanup per the M2 ordering fix).
+ * @see lib/fdpgen/fdpinit.c:fdp_cleanup
+ */
+export declare function fdpCleanup(g: Graph): void;
+//# sourceMappingURL=init.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/init.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AA4DlD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAkB9C;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAUzC"}

package/dist/layout/fdp/layout.d.ts

@@ -0,0 +1,57 @@
+/**
+ * fdp layout bookkeeping: the cluster recursion over derived graphs,
+ * component packing, bounding-box finalization, and the translation
+ * of relative cluster coordinates to absolute positions.
+ *
+ * Spec read at the 15.0.0 tag.
+ *
+ * @see lib/fdpgen/layout.c (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+import { type LayoutInfo } from './derive.js';
+/** @see lib/fdpgen/layout.c:init_info */
+export declare function initInfo(g: Graph): LayoutInfo;
+/**
+ * Attach each graph's list of immediate child clusters (info.clust,
+ * 0-indexed here vs C's 1-indexed GD_clust) and level/parent gdata.
+ * @see lib/fdpgen/layout.c:mkClusters
+ */
+export declare function mkClusters(g: Graph, pclist: Graph[] | null, parent: Graph): void;
+/**
+ * Translate cluster-relative node positions and cluster boxes to
+ * absolute coordinates (root LL at the origin), in inches.
+ * @see lib/fdpgen/layout.c:evalPositions
+ */
+export declare function evalPositions(g: Graph, rootg: Graph): void;
+/**
+ * Set the point-space bb (info.bb) from the inch-space gdata bb, for
+ * g and all clusters.
+ * @see lib/fdpgen/layout.c:setBB
+ */
+export declare function setBB(g: Graph): void;
+/**
+ * Position cluster nodes (created by processClusterEdges for edges with
+ * cluster endpoints) at the centers of their clusters and size them to the
+ * cluster box, so their incident edges clip to the cluster boundary. Runs
+ * before evalPositions, so the cluster bb (gdata.bb, inches) is still in its
+ * parent-relative frame; pos is the cluster center, likewise relative.
+ * @see lib/fdpgen/layout.c:setClustNodes
+ */
+export declare function setClustNodes(root: Graph): void;
+/**
+ * Lay out g: derive, split into components, tLayout each, expand
+ * clusters recursively, remove overlaps, pack, and finalize.
+ * @returns 0 on success
+ * @see lib/fdpgen/layout.c:layout
+ */
+export declare function layout(g: Graph, infop: LayoutInfo, counter: {
+    value: number;
+}): number;
+/**
+ * Top-level fdp layout: recursive cluster layout, cluster-node
+ * placement, absolute positioning, and point-space bbs.
+ * @returns 0 on success
+ * @see lib/fdpgen/layout.c:fdpLayout
+ */
+export declare function fdpLayout(g: Graph): number;
+//# sourceMappingURL=layout.d.ts.map

package/dist/layout/fdp/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/layout.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAkBlD,OAAO,EAAe,KAAK,UAAU,EAAE,MAAM,aAAa,CAAC;AAuB3D,yCAAyC;AACzC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,UAAU,CAY7C;AAMD;;;;GAIG;AACH,wBAAgB,UAAU,CACxB,CAAC,EAAE,KAAK,EACR,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,EACtB,MAAM,EAAE,KAAK,GACZ,IAAI,CAeN;AAuID;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAmB1D;AAWD;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAUpC;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CA+B/C;AA6FD;;;;;GAKG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,GACtD,MAAM,CAmBR;AAyBD;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAW1C"}

package/dist/layout/fdp/normalize.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Layout normalization: translate the first node to the origin and
+ * rotate so the first edge points at the "normalize" angle. A no-op
+ * unless the attribute is set — and fdp calls it on derived
+ * components, which never inherit the user's normalize attribute
+ * (deriveGraph copies only overlap/sep/K), so for fdp this is
+ * faithfully dead unless set on the derived chain.
+ *
+ * @see lib/neatogen/adjust.c:normalize (15.0.0)
+ */
+import type { Graph } from '../../model/graph.js';
+/**
+ * If "normalize" is set, move the first node to the origin, then
+ * rotate the layout so the first edge sits at the given angle.
+ * @see lib/neatogen/adjust.c:normalize (15.0.0)
+ */
+export declare function normalizeG(g: Graph): void;
+//# sourceMappingURL=normalize.d.ts.map

package/dist/layout/fdp/normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../../src/layout/fdp/normalize.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAyClD;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CA0BzC"}