@knowvah/dot-engine 0.1.0

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

@@ -0,0 +1,102 @@
+/**
+ * Cluster expansion, rank merging, cluster marking, and skeleton building
+ * for the dot layout engine.
+ *
+ * @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';
+import type { MincrossContext } from './mincross-utils.js';
+import { mergeChain } from './classify.js';
+export { CLUSTER_EDGE } from './cluster-path.js';
+export { mapInterclustNode } from './cluster-path.js';
+export { mergeChain };
+/**
+ * True when edges e and f can be merged as parallel intercluster edges.
+ * Must match C exactly: same tail, same head, same label identity, and equal ports.
+ *
+ * @see lib/dotgen/class2.c:mergeable
+ */
+export declare function interclexpMergeable(prev: Edge | undefined, e: Edge): boolean;
+/** Rank equality helper — extracts ?? so callers stay below CCN 10. */
+export declare function interclexpRanksEq(e: Edge): boolean;
+/** Head-rank-higher helper — extracts ?? so callers stay below CCN 10. */
+export declare function interclexpHeadHigher(e: Edge): boolean;
+/** @see lib/dotgen/cluster.c:interclexp (flat edge case) */
+export declare function interclexpFlat(g: Graph, e: Edge, prev: Edge | undefined): Edge | undefined;
+/** @see lib/dotgen/cluster.c:interclexp (mergeable multi-edge case) */
+export declare function interclexpMergeCase(subg: Graph, e: Edge, prev: Edge): Edge | undefined;
+/** @see lib/dotgen/cluster.c:interclexp (single edge processing) */
+export declare function interclexpOneEdge(subg: Graph, g: Graph, e: Edge, prev: Edge | undefined): Edge | undefined;
+/** @see lib/dotgen/cluster.c:interclexp */
+export declare function interclexp(subg: Graph): void;
+/** Return [minrank, maxrank] defaults-to-0, factoring out ?? for callers. */
+export declare function subgraphBounds(g: Graph): [number, number];
+/** @see lib/dotgen/cluster.c:merge_ranks (slot setup for one rank) */
+export declare function mergeRanksSetup(subg: Graph, root: Graph, r: number, pos: number): number;
+/** @see lib/dotgen/cluster.c:merge_ranks (node move for one rank) */
+export declare function mergeRanksInstall(subg: Graph, root: Graph, r: number, ipos: number): void;
+/** @see lib/dotgen/cluster.c:merge_ranks (per-rank body) */
+export declare function mergeRanksOne(subg: Graph, root: Graph, r: number): void;
+/** @see lib/dotgen/cluster.c:merge_ranks */
+export declare function mergeRanks(subg: Graph): void;
+/** @see lib/dotgen/cluster.c:remove_rankleaders */
+export declare function removeRankleaders(g: Graph): void;
+/** Minimal MincrossContext for cluster expansion (no crossing minimization). */
+export declare function makeClusterCtx(root: Graph, mn: number, mx: number): MincrossContext;
+/** @see lib/dotgen/cluster.c:expand_cluster */
+export declare function expandCluster(subg: Graph): number;
+/** @see lib/dotgen/cluster.c:mark_clusters (virtual node marking) */
+export declare function markClustersVnodes(clust: Graph, n: Node): void;
+/**
+ * Mirror cgraph agdelnode(clust, n): remove the node from the cluster subgraph
+ * AND delete its incident edges from the subgraph (node_induce/mark_clusters
+ * induce root edges whose endpoints are transient cluster members; deleting only
+ * the node leaves the edge behind, so agContainsEdge wrongly reports it internal
+ * — 1332 chain orphaned, b53 foreign node re-ranked). agdelete affects the
+ * subgraph only, not root/ancestors. @see lib/dotgen/cluster.c:mark_clusters
+ */
+export declare function agDeleteFromCluster(clust: Graph, n: Node): void;
+/**
+ * C node_induce first loop: a node is in at most one cluster at this level. A
+ * node already claimed by an earlier sibling cluster (ranktype set, or contained
+ * in another of par's clusters) is agdeleted from clust — node AND incident
+ * edges — so this cluster's internal dot1Rank does not re-rank the foreign node
+ * (b53: node_49 owned by cluster_node_43 was also ranked by cluster_node_52,
+ * clobbering its rank). makeNewCluster has not yet added clust to par.clust, so
+ * par.clust holds only earlier siblings. @see lib/dotgen/rank.c:node_induce
+ */
+export declare function pruneForeignClusterNodes(par: Graph, clust: Graph): void;
+/**
+ * mark_clusters per-node: claim `n` for `clust`, or agdelete it if already
+ * claimed (first-cluster-wins). ranktype defaults to NORMAL(==0) in C (calloc);
+ * TS leaves it undefined, so coerce undefined→0 — else untouched NORMAL nodes
+ * are wrongly skipped and never receive ND_clust. @see lib/dotgen/cluster.c:mark_clusters
+ */
+export declare function markClusterNode(clust: Graph, n: Node, g: Graph): void;
+/** @see lib/dotgen/cluster.c:mark_clusters */
+export declare function markClusters(g: Graph): void;
+/** @see lib/dotgen/cluster.c:build_skeleton (edge span accumulation) */
+export declare function buildSkeletonEdgeCounts(subg: Graph, v: Node): void;
+/** @see lib/dotgen/cluster.c:build_skeleton (per-node count update) */
+export declare function buildSkeletonCountsNode(subg: Graph, v: Node): void;
+/** @see lib/dotgen/cluster.c:build_skeleton (trim UF_size) */
+export declare function buildSkeletonTrimSize(subg: Graph, mn: number, mx: number): void;
+/** @see lib/dotgen/cluster.c:build_skeleton (edge count accumulation) */
+export declare function buildSkeletonCounts(_g: Graph, subg: Graph, mn: number, mx: number): void;
+/** @see lib/dotgen/cluster.c:build_skeleton */
+export declare function buildSkeleton(g: Graph, subg: Graph): void;
+/** @see lib/dotgen/cluster.c:install_cluster (rank install loop) */
+export declare function installClusterRanks(ctx: MincrossContext, g: Graph, clust: Graph, mn: number, mx: number): number;
+/** @see lib/dotgen/cluster.c:install_cluster */
+export declare function installCluster(g: Graph, n: Node, pass: number, q: Node[]): number;
+/** @see lib/dotgen/cluster.c:mark_lowclusters (clear pass) */
+export declare function markLowclustersZap(root: Graph): void;
+/** @see lib/dotgen/cluster.c:mark_lowclusters (virtual chain assign for one edge) */
+export declare function markLowclusterChain(orig: Edge, g: Graph): void;
+/** @see lib/dotgen/cluster.c:mark_lowclusters (assign pass, recursive) */
+export declare function markLowclusterBasic(g: Graph): void;
+/** @see lib/dotgen/cluster.c:mark_lowclusters */
+export declare function markLowclusters(root: Graph): void;
+//# sourceMappingURL=cluster.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/cluster.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;AAQhD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAS3D,OAAO,EAAE,UAAU,EAAW,MAAM,eAAe,CAAC;AAEpD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,CAAC;AAMtB;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,GAAG,SAAS,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAM5E;AAED,uEAAuE;AACvE,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAElD;AAED,0EAA0E;AAC1E,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAErD;AAED,4DAA4D;AAC5D,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS,CAW1F;AAED,uEAAuE;AACvE,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,GAAG,SAAS,CAQtF;AAED,oEAAoE;AACpE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS,CAM1G;AAED,2CAA2C;AAC3C,wBAAgB,UAAU,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CAkB5C;AAMD,6EAA6E;AAC7E,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAEzD;AAED,sEAAsE;AACtE,wBAAgB,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAIxF;AAED,qEAAqE;AACrE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAiBzF;AAED,4DAA4D;AAC5D,wBAAgB,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAIvE;AAED,4CAA4C;AAC5C,wBAAgB,UAAU,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CAO5C;AAMD,mDAAmD;AACnD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAWhD;AAMD,gFAAgF;AAChF,wBAAgB,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,eAAe,CAWnF;AAED,+CAA+C;AAC/C,wBAAgB,aAAa,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,CAajD;AAMD,qEAAqE;AACrE,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAS9D;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAY/D;AASD;;;;;;;;GAQG;AACH,wBAAgB,wBAAwB,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAWvE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAYrE;AAED,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAY3C;AAMD,wEAAwE;AACxE,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAelE;AAED,uEAAuE;AACvE,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAIlE;AAED,8DAA8D;AAC9D,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAK/E;AAED,yEAAyE;AACzE,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAGxF;AAED,+CAA+C;AAC/C,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAkBzD;AAMD,oEAAoE;AACpE,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAMhH;AAED,gDAAgD;AAChD,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,MAAM,CAWjF;AAuBD,8DAA8D;AAC9D,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CAcpD;AAED,qFAAqF;AACrF,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAM9D;AAED,0EAA0E;AAC1E,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAUlD;AAED,iDAAiD;AACjD,wBAAgB,eAAe,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CAGjD"}

package/dist/layout/dot/compound-clip.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Geometric helpers for compound edge clipping — bezier subdivision,
+ * crossing detection, spline/box intersection.
+ *
+ * @see lib/dotgen/compound.c
+ */
+import type { Point, Box } from '../../model/geom.js';
+/** Sign comparison matching C fcmp(). @see lib/util/gv_math.h:fcmp */
+export declare function fcmp(a: number, b: number): number;
+/** True if p is on or inside box bb. @see lib/dotgen/compound.c:inBoxf */
+export declare function inBoxf(p: Point, bb: Box): boolean;
+/** Midpoint of two points. @see lib/common/utils.c:mid_pointf */
+export declare function midPointf(a: Point, b: Point): Point;
+type CasteljauRow = [Point, Point, Point, Point];
+/** One De Casteljau subdivision step. */
+export declare function casteljauStep(prev: CasteljauRow, t: number): CasteljauRow;
+/** Subdivide cubic Bezier at t; return left or right half. @see lib/common/utils.c:Bezier */
+export declare function subdivideBezier(v: readonly Point[], t: number, side: 'left' | 'right'): Point[];
+/** Count control-polygon crossings of x = xcoord. */
+export declare function countVertCross(pts: Point[], xcoord: number): number;
+/** Count control-polygon crossings of y = ycoord. */
+export declare function countHorzCross(pts: Point[], ycoord: number): number;
+/** Axis-range constraint for findVertical / findHorizontal. */
+export interface AxisRange {
+    coord: number;
+    lo: number;
+    hi: number;
+}
+/** Extract AxisRange for the vertical sides of a box. */
+export declare function vertRange(bb: Box, side: 'left' | 'right'): AxisRange;
+/** Extract AxisRange for the horizontal sides of a box. */
+export declare function horzRange(bb: Box, side: 'bottom' | 'top'): AxisRange;
+/** nc===1 endpoint check: return tmax only if endpoint is ON the line and in range. */
+export declare function checkVertEndpoint(p3: Point, ax: AxisRange, tmax: number): number;
+/** nc===1 endpoint check: return tmax only if endpoint is ON the line and in range. */
+export declare function checkHorzEndpoint(p3: Point, ax: AxisRange, tmax: number): number;
+/** Subdivide-and-recurse for vertical crossing search. */
+export declare function searchVert(pts: Point[], tmin: number, tmax: number, ax: AxisRange): number;
+/** Find first t where Bezier crosses x=ax.coord, y in [ax.lo,ax.hi]. @see lib/dotgen/compound.c:findVertical */
+export declare function findVertical(pts: Point[], tmin: number, tmax: number, ax: AxisRange): number;
+/** Subdivide-and-recurse for horizontal crossing search. */
+export declare function searchHorz(pts: Point[], tmin: number, tmax: number, ax: AxisRange): number;
+/** Find first t where Bezier crosses y=ax.coord, x in [ax.lo,ax.hi]. @see lib/dotgen/compound.c:findHorizontal */
+export declare function findHorizontal(pts: Point[], tmin: number, tmax: number, ax: AxisRange): number;
+/** Update best-t and truncate pts to that crossing. */
+export declare function tryUpdateIntersect(t: number, tmin: number, orig: Point[], pts: Point[]): number;
+/**
+ * Find earliest Bezier/box crossing; truncate pts to that point.
+ * @see lib/dotgen/compound.c:splineIntersectf
+ */
+export declare function splineIntersectf(pts: Point[], bb: Box): boolean;
+/** Left-side intersection of pp→cp with bb. */
+export declare function tryLeftSide(pp: Point, cp: Point, bb: Box): Point | null;
+/** Right-side intersection of pp→cp with bb. */
+export declare function tryRightSide(pp: Point, cp: Point, bb: Box): Point | null;
+/** Bottom-side intersection of pp→cp with bb. */
+export declare function tryBottomSide(pp: Point, cp: Point, bb: Box): Point | null;
+/** Top-side intersection of pp→cp with bb. */
+export declare function tryTopSide(pp: Point, cp: Point, bb: Box): Point | null;
+/**
+ * Intersection of segment [pp→cp] with box bb (pp inside/on, cp outside).
+ * Tries sides in C order: left, right, bottom, top. The slope-scaled delta
+ * is rounded with C `round()` (half away from zero) — it is negative
+ * whenever the cluster wall lies below/left of the endpoint.
+ * @see lib/dotgen/compound.c:boxIntersectf
+ */
+export declare function boxIntersectf(pp: Point, cp: Point, bb: Box): Point;
+export {};
+//# sourceMappingURL=compound-clip.d.ts.map

package/dist/layout/dot/compound-clip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compound-clip.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/compound-clip.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAGtD,sEAAsE;AACtE,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIjD;AAED,0EAA0E;AAC1E,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAEjD;AAED,iEAAiE;AACjE,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,KAAK,CAEnD;AAMD,KAAK,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAEjD,yCAAyC;AACzC,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,YAAY,CAQzE;AAED,6FAA6F;AAC7F,wBAAgB,eAAe,CAAC,CAAC,EAAE,SAAS,KAAK,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,KAAK,EAAE,CAM/F;AAMD,qDAAqD;AACrD,wBAAgB,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAQnE;AAED,qDAAqD;AACrD,wBAAgB,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAQnE;AAMD,+DAA+D;AAC/D,MAAM,WAAW,SAAS;IAAG,KAAK,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;CAAE;AAErE,yDAAyD;AACzD,wBAAgB,SAAS,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAEpE;AAED,2DAA2D;AAC3D,wBAAgB,SAAS,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,GAAG,KAAK,GAAG,SAAS,CAEpE;AAED,uFAAuF;AACvF,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAEhF;AAED,uFAAuF;AACvF,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAEhF;AAED,0DAA0D;AAC1D,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,GAAG,MAAM,CAI1F;AAED,gHAAgH;AAChH,wBAAgB,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,GAAG,MAAM,CAa5F;AAED,4DAA4D;AAC5D,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,GAAG,MAAM,CAI1F;AAED,kHAAkH;AAClH,wBAAgB,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,GAAG,MAAM,CAO9F;AAMD,uDAAuD;AACvD,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,MAAM,CAK/F;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAQ/D;AAMD,+CAA+C;AAC/C,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKvE;AAED,gDAAgD;AAChD,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKxE;AAED,iDAAiD;AACjD,wBAAgB,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKzE;AAED,8CAA8C;AAC9C,wBAAgB,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKtE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,CAMlE"}

package/dist/layout/dot/compound-geom.d.ts

@@ -0,0 +1,115 @@
+/**
+ * Geometric primitives for compound-edge spline clipping.
+ * Bezier subdivision, crossing detection, and box-intersection math
+ * extracted from lib/dotgen/compound.c.
+ *
+ * @see lib/dotgen/compound.c
+ */
+import type { Point, Box } from '../../model/geom.js';
+/**
+ * Sign comparison for doubles, matching C fcmp().
+ * Returns -1, 0, or 1.
+ *
+ * @see lib/util/gv_math.h:fcmp
+ */
+export declare function fcmp(a: number, b: number): number;
+/**
+ * Returns true if point p is on or inside box bb.
+ *
+ * @see lib/dotgen/compound.c:inBoxf
+ */
+export declare function inBoxf(p: Point, bb: Box): boolean;
+/**
+ * Midpoint of two points. Matches C mid_pointf().
+ *
+ * @see lib/common/utils.c:mid_pointf
+ */
+export declare function midPointf(a: Point, b: Point): Point;
+/** One triangle row for De Casteljau; avoids nested array allocation. */
+type CasteljauRow = [Point, Point, Point, Point];
+/** Compute one row of the De Casteljau triangle at parameter t. */
+export declare function casteljauStep(prev: CasteljauRow, t: number): CasteljauRow;
+/**
+ * De Casteljau subdivision of a cubic Bezier at parameter t.
+ * Returns left-half or right-half control points.
+ * Matches C Bezier() triangle computation.
+ *
+ * @see lib/common/utils.c:Bezier
+ */
+export declare function subdivideBezier(v: readonly Point[], t: number, side: 'left' | 'right'): Point[];
+/**
+ * Count control-polygon crossings of vertical line x = xcoord.
+ *
+ * @see lib/dotgen/compound.c:countVertCross
+ */
+export declare function countVertCross(pts: Point[], xcoord: number): number;
+/**
+ * Count control-polygon crossings of horizontal line y = ycoord.
+ *
+ * @see lib/dotgen/compound.c:countHorzCross
+ */
+export declare function countHorzCross(pts: Point[], ycoord: number): number;
+/**
+ * Axis-line specification for findAxisCrossing.
+ * Bundles the line coordinate and perpendicular range to avoid 6-param
+ * signatures on recursive calls.
+ */
+export interface LineSpec {
+    /** The coordinate of the axis-aligned line being tested. */
+    lineCoord: number;
+    /** Lower bound of the perpendicular range. */
+    rangeMin: number;
+    /** Upper bound of the perpendicular range. */
+    rangeMax: number;
+    /** 'v' = vertical (x = lineCoord); 'h' = horizontal (y = lineCoord). */
+    axis: 'v' | 'h';
+}
+/** Return true if the Bezier endpoint lies within spec's perpendicular range. */
+export declare function endpointInRange(pts: Point[], spec: LineSpec): boolean;
+/** Return true if the endpoint coord is within 0.005 of the line. */
+export declare function endpointNearLine(pts: Point[], spec: LineSpec): boolean;
+/** Count crossings of pts with the axis line described by spec. */
+export declare function countCrossings(pts: Point[], spec: LineSpec): number;
+/**
+ * Find the first t in [tmin, tmax] where the Bezier crosses the axis line
+ * described by spec. Returns -1 if not found.
+ * Recursive binary subdivision (Graphics Gems pp.411-415).
+ *
+ * Replaces findVertical and findHorizontal from compound.c.
+ *
+ * @see lib/dotgen/compound.c:findVertical
+ * @see lib/dotgen/compound.c:findHorizontal
+ */
+export declare function findAxisCrossing(pts: Point[], tmin: number, tmax: number, spec: LineSpec): number;
+/** Update best-t and rewrite pts[0..3] from orig at parameter t if better. */
+export declare function tryUpdateIntersect(t: number, tmin: number, orig: Point[], pts: Point[]): number;
+/** Build the four LineSpec values for the sides of a box. */
+export declare function boxLineSpecs(bb: Box): [LineSpec, LineSpec, LineSpec, LineSpec];
+/**
+ * Find the earliest intersection of Bezier pts[0..3] with box bb and
+ * truncate pts to that point. Returns true when an intersection was found.
+ *
+ * @see lib/dotgen/compound.c:splineIntersectf
+ */
+export declare function splineIntersectf(pts: Point[], bb: Box): boolean;
+/** Check left-side intersection of segment pp→cp with bb. */
+export declare function tryLeftSide(pp: Point, cp: Point, bb: Box): Point | null;
+/** Check right-side intersection of segment pp→cp with bb. */
+export declare function tryRightSide(pp: Point, cp: Point, bb: Box): Point | null;
+/** Check bottom-side intersection of segment pp→cp with bb. */
+export declare function tryBottomSide(pp: Point, cp: Point, bb: Box): Point | null;
+/** Check top-side intersection of segment pp→cp with bb. */
+export declare function tryTopSide(pp: Point, cp: Point, bb: Box): Point | null;
+/**
+ * Find intersection of segment [pp, cp] with box bb.
+ * pp is inside/on the box; cp is outside. Tries four sides in C order.
+ * The slope-scaled delta is rounded with C `round()` (half away from zero),
+ * NOT Math.round: the delta is negative whenever the cluster wall lies
+ * below/left of the endpoint, and dot node coords are integers here, so
+ * exact .5 ties are routine.
+ *
+ * @see lib/dotgen/compound.c:boxIntersectf
+ */
+export declare function boxIntersectf(pp: Point, cp: Point, bb: Box): Point;
+export {};
+//# sourceMappingURL=compound-geom.d.ts.map

package/dist/layout/dot/compound-geom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compound-geom.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/compound-geom.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAOtD;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIjD;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAEjD;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,KAAK,CAEnD;AAMD,yEAAyE;AACzE,KAAK,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAEjD,mEAAmE;AACnE,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,YAAY,CAQzE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,CAAC,EAAE,SAAS,KAAK,EAAE,EACnB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,MAAM,GAAG,OAAO,GACrB,KAAK,EAAE,CAQT;AAMD;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CASnE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CASnE;AAMD;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,4DAA4D;IAC5D,SAAS,EAAE,MAAM,CAAC;IAClB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IACjB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IACjB,wEAAwE;IACxE,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC;CACjB;AAED,iFAAiF;AACjF,wBAAgB,eAAe,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAGrE;AAED,qEAAqE;AACrE,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAGtE;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,GAAG,MAAM,CAInE;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GACvD,MAAM,CAYR;AAMD,8EAA8E;AAC9E,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GACnD,MAAM,CAKR;AAED,6DAA6D;AAC7D,wBAAgB,YAAY,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAO9E;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAQ/D;AAMD,6DAA6D;AAC7D,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKvE;AAED,8DAA8D;AAC9D,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKxE;AAED,+DAA+D;AAC/D,wBAAgB,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKzE;AAED,4DAA4D;AAC5D,wBAAgB,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,GAAG,IAAI,CAKtE;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,GAAG,KAAK,CAQlE"}

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

@@ -0,0 +1,56 @@
+/**
+ * Compound edge support — clips splines to cluster bounding boxes.
+ *
+ * @see lib/dotgen/compound.c
+ */
+import type { Point, Box, Bezier } from '../../model/geom.js';
+import type { Graph } from '../../model/graph.js';
+import type { Edge } from '../../model/edge.js';
+export { fcmp, inBoxf, midPointf, casteljauStep, subdivideBezier, countVertCross, countHorzCross, tryUpdateIntersect, splineIntersectf, tryLeftSide, tryRightSide, tryBottomSide, tryTopSide, boxIntersectf, } from './compound-clip.js';
+/** Recursively populate name→cluster map. @see lib/common/utils.c:fillMap */
+export declare function fillClustMap(g: Graph, map: Map<string, Graph>): void;
+/** Build a name→cluster map for all clusters reachable from g. @see lib/common/utils.c:mkClustMap */
+export declare function mkClustMap(g: Graph): Map<string, Graph>;
+interface ClipState {
+    e: Edge;
+    bez: Bezier;
+    size: number;
+    endi: number;
+    starti: number;
+}
+/** Degenerate head clip: first control point already inside cluster bb. */
+export declare function clipHeadDegenerate(state: ClipState, bb: Box, ep: Point): void;
+/** Normal head clip: scan forward for first segment exiting cluster bb. */
+export declare function clipHeadNormal(state: ClipState, bb: Box): void;
+/** Apply head clip when head node coord is inside cluster bb. */
+export declare function applyHeadClip(state: ClipState, bb: Box): boolean;
+/** Clip head end of edge; returns true when clipping was applied. @see lib/dotgen/compound.c */
+export declare function clipHead(state: ClipState, bb: Box, headInBox: boolean): boolean;
+/** Degenerate tail clip: last selected control point is inside cluster bb. */
+export declare function clipTailDegenerate(state: ClipState, bb: Box): void;
+/** Normal tail clip: scan backward for last segment exiting cluster bb. */
+export declare function clipTailNormal(state: ClipState, bb: Box): void;
+/** Apply tail clip. */
+export declare function applyTailClip(state: ClipState, bb: Box): boolean;
+/** Clip tail end of edge; returns true when clipping was applied. @see lib/dotgen/compound.c */
+export declare function clipTail(state: ClipState, bb: Box, tailInBox: boolean): boolean;
+export declare function resolveClusterPair(e: Edge, clustMap: Map<string, Graph>): {
+    lh: Graph | null;
+    lt: Graph | null;
+};
+/** Returns false when edge is not eligible for compound clipping. */
+export declare function isCompoundEdgeEligible(e: Edge): boolean;
+/** Replace bez.list with the trimmed slice [starti..endi]. */
+export declare function applyBezierSlice(state: ClipState): void;
+/**
+ * Clip the spline for edge e against its lhead/ltail cluster bounding boxes,
+ * re-clipping the arrowhead(s) to the new cluster-boundary tips.
+ * @see lib/dotgen/compound.c:makeCompoundEdge
+ */
+export declare function makeCompoundEdge(e: Edge, clustMap: Map<string, Graph>): void;
+/**
+ * Clip splines at cluster boundaries for edges with lhead/ltail attributes.
+ * @see lib/dotgen/compound.c:dot_compoundEdges
+ */
+export declare function dotCompoundEdges(g: Graph): void;
+//# sourceMappingURL=compound.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"compound.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/compound.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAUhD,OAAO,EACL,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,eAAe,EACvD,cAAc,EAAE,cAAc,EAAE,kBAAkB,EAClD,gBAAgB,EAChB,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa,GACpE,MAAM,oBAAoB,CAAC;AAM5B,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,IAAI,CAOpE;AAED,qGAAqG;AACrG,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAIvD;AAMD,UAAU,SAAS;IAAG,CAAC,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;CAAE;AA4CzF,2EAA2E;AAC3E,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAU7E;AAED,2EAA2E;AAC3E,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,GAAG,IAAI,CAgB9D;AAED,iEAAiE;AACjE,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAUhE;AAED,gGAAgG;AAChG,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,GAAG,OAAO,CAG/E;AAMD,8EAA8E;AAC9E,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,GAAG,IAAI,CAYlE;AAED,2EAA2E;AAC3E,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,GAAG,IAAI,CAgB9D;AAED,uBAAuB;AACvB,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAUhE;AAED,gGAAgG;AAChG,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,GAAG,OAAO,CAG/E;AAYD,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GACpC;IAAE,EAAE,EAAE,KAAK,GAAG,IAAI,CAAC;IAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAAA;CAAE,CAMxC;AAED,qEAAqE;AACrE,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAGvD;AAED,8DAA8D;AAC9D,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAMvD;AA0BD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,IAAI,CAU5E;AAMD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK/C"}

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

@@ -0,0 +1,88 @@
+/**
+ * TypeScript port of lib/dotgen/conc.c — dot_concentrate.
+ *
+ * Build edge concentrators for parallel edges with a common endpoint.
+ *
+ * @see lib/dotgen/conc.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Port } from '../../model/geom.js';
+/** @see lib/dotgen/dotsplines.c:portcmp */
+export declare function portcmp(p0: Port, p1: Port): number;
+/** @see lib/dotgen/conc.c:downcandidate */
+export declare function downcandidate(v: Node): boolean;
+/** @see lib/dotgen/conc.c:upcandidate */
+export declare function upcandidate(v: Node): boolean;
+/** Walk to_orig chain to find the underlying NORMAL edge. */
+export declare function findNormalEdge(e: Edge): Edge | undefined;
+/** @see lib/dotgen/conc.c:samedir */
+export declare function sameDir(e: Edge, f: Edge): boolean;
+/** @see lib/dotgen/conc.c:bothdowncandidates */
+export declare function bothdowncandidates(u: Node, v: Node): boolean;
+/** @see lib/dotgen/conc.c:bothupcandidates */
+export declare function bothupcandidates(u: Node, v: Node): boolean;
+/** Find or create the left-side representative edge in the DOWN merge. */
+export declare function resolveDownRep(left: Node, headNode: Node, e: Edge): Edge;
+/** Drain all in-edges from right into f, then delete e. */
+export declare function drainIntoDown(right: Node, f: Edge, e: Edge): void;
+/** Merge one out-edge of right into left (DOWN direction). */
+export declare function mergeOneOutEdge(left: Node, right: Node): void;
+/** Find or create the left-side representative edge in the UP merge. */
+export declare function resolveUpRep(left: Node, tailNode: Node, e: Edge): Edge;
+/** Drain all out-edges from right into f, then delete e. */
+export declare function drainIntoUp(right: Node, f: Edge, e: Edge): void;
+/** Merge one in-edge of right into left (UP direction). */
+export declare function mergeOneInEdge(left: Node, right: Node): void;
+/** Compact the rank array after merging positions lpos+1..rpos into lpos. */
+export declare function compactRank(g: Graph, r: number, lpos: number, rpos: number): void;
+/** Merge right into left using DOWN semantics. */
+export declare function absorbNodeDown(left: Node, right: Node, g: Graph): void;
+/** Merge right into left using UP semantics. */
+export declare function absorbNodeUp(left: Node, right: Node, g: Graph): void;
+/** @see lib/dotgen/conc.c:mergevirtual */
+export declare function mergeVirtual(g: Graph, r: number, lpos: number, rpos: number, dir: number): void;
+/** @see lib/dotgen/conc.c:infuse */
+export declare function infuse(g: Graph, n: Node): void;
+/** Infuse virtual nodes along the to_virt/out chain of edge e. */
+export declare function infuseEdgeChain(g: Graph, e: Edge): void;
+/** True if virtual node n's orig edge has both endpoints in g. */
+export declare function virtNodeInGraph(g: Graph, n: Node): boolean;
+/** Compute the highest valid index (maxi) for one rank vlist. */
+export declare function computeMaxi(g: Graph, r: number): number;
+/** @see lib/dotgen/conc.c:rebuild_vlists — fill one rank's v pointer. */
+export declare function fillRankVlist(g: Graph, r: number, root: Graph): number;
+/** Infuse every node (and its out-edge chains) in g into rankleader. */
+export declare function infuseAllNodes(g: Graph): void;
+/** Fill all per-rank vlists for g using root as the master rank table. */
+export declare function fillAllRankVlists(g: Graph): number;
+/** Recursively rebuild vlists for all clusters of g. */
+export declare function rebuildClusterVlists(g: Graph): number;
+/** @see lib/dotgen/conc.c:rebuild_vlists */
+export declare function rebuildVlists(g: Graph): number;
+/** @see lib/dotgen/conc.c:dot_concentrate — one downward rank sweep */
+export declare function concentrateOneRankDown(g: Graph, r: number): void;
+/** @see lib/dotgen/conc.c:dot_concentrate — one upward rank sweep */
+export declare function concentrateOneRankUp(g: Graph, r: number): void;
+/** Run the downward concentration pass; return the last r examined. */
+export declare function runDownPass(g: Graph): number;
+/** Run the upward concentration pass from r down to 1. */
+export declare function runUpPass(g: Graph, startR: number): void;
+/**
+ * Build edge concentrators for parallel edges with a common endpoint.
+ *
+ * The final cluster loop here is a distinct call site from
+ * `rebuildClusterVlists`'s recursive nested-cluster loop inside
+ * `rebuildVlists` — C's `dot_concentrate` (conc.c:237-243) calls
+ * `rebuild_vlists` directly on each of `g`'s own top-level clusters and, on
+ * ANY failure (including one bubbled up from a doubly-nested cluster),
+ * reports a single `agerr(AGPREV, ...)` continuation line (no "Error:"/
+ * "Warning:" prefix — AGPREV reuses the previous call's level) and
+ * normalizes the return to -1. Do not fold this into `rebuildClusterVlists`:
+ * that helper is also called recursively from inside `rebuildVlists` itself,
+ * where C does NOT emit this message.
+ * @see lib/dotgen/conc.c:dot_concentrate
+ */
+export declare function dotConcentrate(g: Graph): number;
+//# sourceMappingURL=conc.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"conc.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/conc.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAkBhD,2CAA2C;AAC3C,wBAAgB,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,MAAM,CAQlD;AAOD,2CAA2C;AAC3C,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAK9C;AAED,yCAAyC;AACzC,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAK5C;AAOD,6DAA6D;AAC7D,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,SAAS,CAMxD;AAED,qCAAqC;AACrC,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CASjD;AAOD,gDAAgD;AAChD,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAO5D;AAED,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAO1D;AAOD,0EAA0E;AAC1E,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAKxE;AAED,2DAA2D;AAC3D,wBAAgB,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAOjE;AAED,8DAA8D;AAC9D,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,CAI7D;AAED,wEAAwE;AACxE,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAKtE;AAED,4DAA4D;AAC5D,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAO/D;AAED,2DAA2D;AAC3D,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,CAI5D;AAED,6EAA6E;AAC7E,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAUjF;AAED,kDAAkD;AAClD,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAGtE;AAED,gDAAgD;AAChD,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAGpE;AAED,0CAA0C;AAC1C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAS/F;AAOD,oCAAoC;AACpC,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAM9C;AAED,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAQvD;AAED,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAI1D;AAED,iEAAiE;AACjE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAmBvD;AAED,yEAAyE;AACzE,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,MAAM,CAoCtE;AAED,wEAAwE;AACxE,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAoB7C;AAED,0EAA0E;AAC1E,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAYlD;AAED,wDAAwD;AACxD,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAQrD;AAED,4CAA4C;AAC5C,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAU9C;AAMD,uEAAuE;AACvE,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAShE;AAED,qEAAqE;AACrE,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAS9D;AAED,uEAAuE;AACvE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAM5C;AAED,0DAA0D;AAC1D,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAGxD;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAa/C"}

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

@@ -0,0 +1,66 @@
+/** @see lib/dotgen/decomp.c  @see lib/common/utils.c (UF_*) */
+import type { Node } from '../../model/node.js';
+import type { Graph } from '../../model/graph.js';
+import type { EdgeList } from '../../model/nodeInfo.js';
+/**
+ * Return `g`'s member nodes in AGSEQ order (global, root-graph-wide creation
+ * order), mirroring `agfstnode(g)`/`agnxtnode(g,n)` — NOT the subgraph-local
+ * first-insertion order that `g.nodes` (a `Map`) iterates by default.
+ *
+ * C's `agfstnode` walks a dict ordered by `agsubnodeseqcmpf`
+ * (`AGSEQ(node)`, assigned once at node creation and never touched by later
+ * `agsubnode` membership calls), independent of which subgraph a node was
+ * textually declared in. `Node.id` mirrors AGSEQ (assigned once at first
+ * global creation by `NodeRegistry.ensure`/`agnode`'s `freshNodeId`), so a
+ * `.id`-ascending sort reproduces C's order for any (sub)graph.
+ *
+ * Every C function that iterates a subgraph via `agfstnode`/`agnxtnode` must
+ * use this helper instead of `g.nodes.values()` directly — see F7's audit
+ * table in `.agent-notes/path-structure-xns-residuals.md` for the site list.
+ *
+ * @see lib/cgraph/node.c:43 (agfstnode), :50 (agnxtnode)
+ * @see lib/cgraph/node.c:283-290 (agsubnodeseqcmpf, AGSEQ comparator)
+ * @see lib/cgraph/node.c:162 (agnextseq(g,AGNODE), AGSEQ assignment at creation)
+ */
+export declare function nodesInSeq(g: Graph): Node[];
+/** @see lib/common/utils.c:UF_find */
+export declare function ufFind(n: Node): Node;
+/**
+ * Union two UF sets. Inlines ufRoot (init + find).
+ *
+ * C's tie-break reads `ND_id(u) > ND_id(v)` — but `ND_id` is a distinct,
+ * dotgen-only `Agnodeinfo_t.id` field (lib/common/types.h:432, guarded by
+ * `#ifndef DOT_ONLY`) that is NEVER assigned anywhere in the `dot` layout
+ * engine's source (only neatogen/fdpgen/sfdpgen/sparse — unrelated engines —
+ * write it). It is therefore always 0 for both real and virtual nodes under
+ * `dot`, so `ND_id(u) > ND_id(v)` is always false and C always takes the
+ * `else` branch: the first argument's resolved root unconditionally wins.
+ * This is NOT the same field as AGID (cgraph's unique per-node id, exposed
+ * here as `Node.id`) — using `.id` for this comparison would introduce
+ * spurious branching C never performs, since AGID differs between every
+ * pair of real nodes.
+ * @see lib/common/utils.c:UF_union
+ */
+export declare function ufUnion(u: Node, v: Node): Node;
+/** @see lib/common/utils.c:UF_singleton */
+export declare function ufSingleton(u: Node): void;
+/** @see lib/common/utils.c:UF_setname */
+export declare function ufSetname(u: Node, v: Node): void;
+/**
+ * Push unvisited UF-root neighbors onto the BFS stack.
+ * @see lib/dotgen/decomp.c (inlined in searchComponent)
+ */
+export declare function decompPushNeighbors(stk: Node[], el: EdgeList | undefined, n: Node, cmark: number): void;
+/**
+ * BFS over one component; builds g.info.nlist linked list (prev/next).
+ * Clears g.info.nlist before traversal.
+ * @see lib/dotgen/decomp.c:beginComponent  @see lib/dotgen/decomp.c:searchComponent
+ */
+export declare function decompSearch(g: Graph, start: Node, cmark: number): void;
+/**
+ * Find connected components and store in `g.info.comp`.
+ * pass=0: real nodes. pass=1: cluster skeleton leaders.
+ * @see lib/dotgen/decomp.c:decompose
+ */
+export declare function decompose(g: Graph, pass: 0 | 1): void;
+//# sourceMappingURL=decomp.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"decomp.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/decomp.ts"],"names":[],"mappings":"AACA,+DAA+D;AAC/D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAMxD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,CAE3C;AAMD,sCAAsC;AACtC,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAOpC;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAU9C;AAED,2CAA2C;AAC3C,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAEzC;AAED,yCAAyC;AACzC,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAGhD;AAOD;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,QAAQ,GAAG,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAC5D,IAAI,CASN;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAoBvE;AAcD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAWrD"}

package/dist/layout/dot/edge-order.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Edge routing order for dot, matching C `dot_splines_`.
+ *
+ * C routes edges from a list built rank-major (`GD_rank[i].v[j]` out-edges of
+ * NORMAL / splineMerge nodes) then `qsort`-ed by `edgecmp`. Because
+ * `recover_slack` re-centres shared virtual nodes that other edges read as
+ * `maximal_bbox` neighbours, corridor geometry is routing-order-dependent — so
+ * the port must route in C's order, not `g.nodes.values()` insertion order.
+ *
+ * The port iterates the ORIGINAL edges directly (real tails), so `edgecmp`'s
+ * `getmainedge` mapping is the identity here and the rank/coord keys read the
+ * original endpoints. `AGSEQ` (the port's `Edge.seq`) is unique, making the
+ * comparator a total order — a stable `Array.sort` over any collection order
+ * reproduces C's `qsort` result (edgecmp-equal originals never occur, and C
+ * batches genuinely-equivalent edges via the cnt-loop, so their relative
+ * routing order is immaterial).
+ *
+ * @see lib/dotgen/dotsplines.c:dot_splines_ (edges list build + sort)
+ * @see lib/dotgen/dotsplines.c:edgecmp
+ */
+import type { Edge } from '../../model/edge.js';
+/**
+ * Compare two original edges in C `dot_splines_` routing order via their
+ * lexicographic `edgecmp` keys. @see lib/dotgen/dotsplines.c:edgecmp
+ */
+export declare function edgeRouteCmp(a: Edge, b: Edge): number;
+//# sourceMappingURL=edge-order.d.ts.map

package/dist/layout/dot/edge-order.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-order.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/edge-order.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AA2BhD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAOrD"}

package/dist/layout/dot/edge-route-arrow.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Arrowhead polygon geometry for dot-layout edge rendering.
+ *
+ * @see lib/common/arrows.c:arrow_type_normal0
+ * @see lib/common/arrows.c:miter_shape
+ */
+import type { Point } from '../../model/geom.js';
+import type { ArrowDrawOp } from '../../common/arrows-types.js';
+/** Arrow length in points. @see lib/common/arrows.c:#define ARROW_LENGTH 10. */
+export declare const ARROW_LENGTH = 10;
+/** Arrow width factor. @see lib/common/arrows.c:arrowwidth = 0.35 */
+export declare const ARROW_WIDTH_FACTOR = 0.35;
+/**
+ * Three-point arrowhead polygon: [rightBase, adj_tip, leftBase].
+ *
+ * Matches C's arrow_type_normal0 for a standard "normal" arrowhead:
+ *   1. delta_tip correction shifts both the polygon tip and base TOWARD the
+ *      shaft by the miter-join extension length, so the filled polygon covers
+ *      the miter join produced by the SVG renderer at the sharp tip vertex.
+ *      Formula: (penwidth / (2 * arrowwidth)) * sqrt(1 + arrowwidth^2)
+ *   2. Polygon order is [a[1]=right_base, a[2]=adj_tip, a[3]=left_base]
+ *      (matching gvrender_polygon(job, &a[1], 3)).
+ *
+ * @see lib/common/arrows.c:arrow_type_normal0
+ * @see lib/common/arrows.c:miter_shape
+ */
+export declare function arrowheadPolygon(arrowTip: Point, arrowDir: Point, penwidth?: number): Point[];
+/** Minimal edge shape exposing the arrow-related attributes. */
+interface ArrowAttrEdge {
+    attrs: Map<string, string>;
+}
+/** The arrowhead/arrowtail name for an edge end (default "normal"). */
+export declare function edgeArrowName(e: ArrowAttrEdge, end: 'head' | 'tail'): string;
+/** The `arrowsize` edge attribute (default 1.0; clamped to ≥0 like late_double). */
+export declare function edgeArrowsize(e: ArrowAttrEdge): number;
+/**
+ * Typed arrow draw-ops for one edge end: reads `arrowhead`/`arrowtail` +
+ * `arrowsize`, resolves the compound arrow type, and dispatches to the full
+ * geometry table (`arrowDrawOps`). `tip` is the node-boundary point, `dir`
+ * points from tip toward the shaft (away from the node).
+ *
+ * @see lib/common/arrows.c:arrow_gen
+ */
+export declare function arrowDrawOpsForEnd(e: ArrowAttrEdge, end: 'head' | 'tail', tip: Point, dir: Point, penwidth: number): ArrowDrawOp[];
+export {};
+//# sourceMappingURL=edge-route-arrow.d.ts.map

package/dist/layout/dot/edge-route-arrow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-route-arrow.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/edge-route-arrow.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAIjD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAEhE,gFAAgF;AAChF,eAAO,MAAM,YAAY,KAAK,CAAC;AAE/B,qEAAqE;AACrE,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAEvC;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,SAAM,GAAG,KAAK,EAAE,CAe1F;AAOD,gEAAgE;AAChE,UAAU,aAAa;IAAG,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE;AAEtD,uEAAuE;AACvE,wBAAgB,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAE5E;AAED,oFAAoF;AACpF,wBAAgB,aAAa,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAGtD;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,GAC/E,WAAW,EAAE,CAKf"}