@knowvah/dot-engine 0.1.0

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

@@ -0,0 +1,57 @@
+/**
+ * Bounding box computation, aspect ratio scaling, and set_aspect for dot.
+ * @see lib/dotgen/position.c:dot_compute_bb, rec_bb, scale_bb, set_aspect
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import { dotRoot } from './mincross-utils.js';
+/** @internal — first NORMAL node in rank, scanning left to right */
+export declare function firstNormalNode(rk: {
+    v: Node[];
+    n: number;
+}): Node | undefined;
+/** @internal — last NORMAL node in rank, scanning right to left */
+export declare function lastNormalNode(rk: {
+    v: Node[];
+    n: number;
+}): Node | undefined;
+/** @internal — find x range of NORMAL nodes in one rank */
+export declare function rankNormalXRange(rk: {
+    v: Node[];
+    n: number;
+}): [number, number];
+/** @see lib/dotgen/position.c:dot_compute_bb (root x-range scan) */
+export declare function computeBbRootX(g: Graph): [number, number];
+/** @see lib/dotgen/position.c:dot_compute_bb */
+export declare function dotComputeBb(g: Graph, root: Graph): void;
+/** @see lib/dotgen/position.c:rec_bb */
+export declare function recBb(g: Graph, root: Graph): void;
+/** @see lib/dotgen/position.c:scale_bb */
+export declare function scaleBb(g: Graph, xf: number, yf: number): void;
+type SzPoint = {
+    x: number;
+    y: number;
+};
+type DrawingPartial = {
+    size: SzPoint;
+    ratioKind: string;
+    ratio?: number;
+};
+/** @internal — fill ratio scale factors */
+export declare function aspectFillScale(d: DrawingPartial, sz: SzPoint): [number, number] | null;
+/** @internal — expand ratio scale factors */
+export declare function aspectExpandScale(d: DrawingPartial, g: Graph): [number, number] | null;
+/** @internal — fixed ratio scale factors */
+export declare function aspectValueScale(d: DrawingPartial, sz: SzPoint): [number, number];
+/** @see lib/dotgen/position.c:set_aspect (choose scale factors for ratio mode) */
+export declare function aspectScaleFactors(g: Graph, sz: SzPoint): [number, number] | null;
+/** @see lib/dotgen/position.c:set_aspect */
+export declare function setAspect(g: Graph): void;
+/**
+ * Set cluster label positions after bounding boxes are computed.
+ * @see lib/common/postproc.c:place_graph_label
+ */
+export declare function placeGraphLabel(g: Graph): void;
+/** @internal — get dot root for use in bbox computations */
+export { dotRoot };
+//# sourceMappingURL=position-bbox.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"position-bbox.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/position-bbox.ts"],"names":[],"mappings":"AAEA;;;GAGG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAa9C,oEAAoE;AACpE,wBAAgB,eAAe,CAAC,EAAE,EAAE;IAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,CAK9E;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,EAAE,EAAE;IAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,CAK7E;AAED,2DAA2D;AAC3D,wBAAgB,gBAAgB,CAAC,EAAE,EAAE;IAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAO/E;AAED,oEAAoE;AACpE,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAkBzD;AAED,gDAAgD;AAChD,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAcxD;AAED,wCAAwC;AACxC,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAIjD;AAED,0CAA0C;AAC1C,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAM9D;AAMD,KAAK,OAAO,GAAG;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AACxC,KAAK,cAAc,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAE3E,2CAA2C;AAC3C,wBAAgB,eAAe,CAAC,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAQvF;AAED,6CAA6C;AAC7C,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAOtF;AAED,4CAA4C;AAC5C,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAKjF;AAED,kFAAkF;AAClF,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAOjF;AAED,4CAA4C;AAC5C,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAkBxC;AAkCD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAU9C;AAED,4DAA4D;AAC5D,OAAO,EAAE,OAAO,EAAE,CAAC"}

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

@@ -0,0 +1,48 @@
+/**
+ * Cluster containment and separation constraints for the dot position phase.
+ * @see lib/dotgen/position.c:contain_nodes, contain_clustnodes,
+ *      keepout_othernodes, contain_subclust, separate_subclust, pos_clusters
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+/** @internal */
+export declare function graphMargin(g: Graph): number;
+/** @internal */
+export declare function graphMinrank(g: Graph): number;
+/** @internal */
+export declare function graphMaxrank(g: Graph): number;
+/** @internal */
+export declare function borderLeft(g: Graph): number;
+/** @internal */
+export declare function borderRight(g: Graph): number;
+/** @internal */
+export declare function borderBottom(g: Graph): number;
+/** @internal */
+export declare function borderTop(g: Graph): number;
+/** @see lib/dotgen/position.c:make_lrvn */
+export declare function makeLrvn(g: Graph): void;
+/** @see lib/dotgen/position.c:contain_nodes (per-rank) */
+export declare function containNodesRank(g: Graph, r: number, ln: Node, rn: Node): void;
+/** @see lib/dotgen/position.c:contain_nodes */
+export declare function containNodes(g: Graph): void;
+/** @see lib/dotgen/position.c:contain_clustnodes */
+export declare function containClustnodes(g: Graph): void;
+/** @see lib/dotgen/position.c:vnode_not_related_to */
+export declare function vnodeNotRelatedTo(g: Graph, v: Node): boolean;
+/** @see lib/dotgen/position.c:keepout_othernodes (left-side scan for one rank) */
+export declare function keepoutLeft(root: Graph, g: Graph, r: number, margin: number): void;
+/** @see lib/dotgen/position.c:keepout_othernodes (right-side scan for one rank) */
+export declare function keepoutRight(root: Graph, g: Graph, r: number, margin: number): void;
+/** @see lib/dotgen/position.c:keepout_othernodes */
+export declare function keepoutOthernodes(g: Graph): void;
+/** @see lib/dotgen/position.c:contain_subclust */
+export declare function containSubclust(g: Graph): void;
+/** @see lib/dotgen/position.c:separate_subclust (check overlap and assign left/right) */
+export declare function separateClustPair(low: Graph, high: Graph, margin: number): void;
+/** @see lib/dotgen/position.c:separate_subclust */
+export declare function separateSubclust(g: Graph): void;
+/** @see lib/dotgen/position.c:pos_clusters */
+export declare function posClusters(g: Graph): void;
+/** @see lib/dotgen/position.c:compress_graph */
+export declare function compressGraph(g: Graph): void;
+//# sourceMappingURL=position-cluster.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"position-cluster.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/position-cluster.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAehD,gBAAgB;AAChB,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE5C;AAED,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAE9E,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAE9E,gBAAgB;AAChB,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE3C;AAED,gBAAgB;AAChB,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE5C;AAED,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE7C;AAED,gBAAgB;AAChB,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE1C;AAMD,2CAA2C;AAC3C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAavC;AAMD,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,CAc9E;AAED,+CAA+C;AAC/C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAO3C;AAMD,oDAAoD;AACpD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAchD;AAMD,sDAAsD;AACtD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAQ5D;AAMD,kFAAkF;AAClF,wBAAgB,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAelF;AAED,mFAAmF;AACnF,wBAAgB,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAenF;AAED,oDAAoD;AACpD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAUhD;AAMD,kDAAkD;AAClD,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAW9C;AAMD,yFAAyF;AACzF,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAsB/E;AAED,mDAAmD;AACnD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAe/C;AAMD,8CAA8C;AAC9C,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAM1C;AAMD,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAO5C"}

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

@@ -0,0 +1,42 @@
+/**
+ * Y-coordinate assignment, cluster height computation, and rank adjustment
+ * for the dot position phase.
+ * @see lib/dotgen/position.c:set_ycoords, clust_ht, adjustRanks, adjustSimple
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+/** @internal */
+export declare function graphMarginY(g: Graph): number;
+/** @internal — largest self-edge label half-height for a node */
+export declare function selfEdgeLabelHt(n: Node): number;
+/** @see lib/dotgen/position.c:clust_ht (single node scan, returns ht2) */
+export declare function clustHtScanNode(g: Graph, n: Node, r: number): number;
+/** @see lib/dotgen/position.c:clust_ht (update nearest enclosing cluster ht) */
+export declare function updateClustNodeHt(g: Graph, n: Node, ht2: number): void;
+/** @see lib/dotgen/position.c:clust_ht (per-rank node scan) */
+export declare function clustHtRankScan(g: Graph): void;
+/** @see lib/dotgen/position.c:clust_ht (sub-cluster ht accumulation) */
+export declare function clustHtSubclusters(g: Graph, margin: number, ht1In: number, ht2In: number): [number, number, boolean];
+/** @see lib/dotgen/position.c:clust_ht (label height adjustment) */
+export declare function clustHtLabel(g: Graph, ht1In: number, ht2In: number): [number, number, boolean];
+/** @see lib/dotgen/position.c:clust_ht */
+export declare function clustHt(g: Graph): boolean;
+/** @internal — recompute maxht after adjustRanks (exact_ranksep path) */
+export declare function recomputeMaxht(g: Graph): number;
+/** @internal — re-assign y if ranks are equally spaced */
+export declare function equalSpaceRanks(g: Graph, maxht: number): void;
+/** @see lib/dotgen/position.c:set_ycoords (initial y assignment loop) */
+export declare function setYcoordsInitial(g: Graph, lbl: boolean): void;
+/** @see lib/dotgen/position.c:set_ycoords (copy y from rank leader to all nodes) */
+export declare function setYcoordsCopy(g: Graph): void;
+/** @see lib/dotgen/position.c:set_ycoords */
+export declare function setYcoords(g: Graph): void;
+/** @internal — shift ranks above minr by deltop */
+export declare function shiftRanksAbove(root: Graph, minr: number, deltop: number): void;
+/** @see lib/dotgen/position.c:adjustSimple */
+export declare function adjustSimple(g: Graph, delta: number, marginTotal: number): void;
+/** @see lib/dotgen/position.c:adjustRanks (label height delta application) */
+export declare function adjustRanksLabel(g: Graph, root: Graph, marginTotal: number): void;
+/** @see lib/dotgen/position.c:adjustRanks */
+export declare function adjustRanks(g: Graph, marginTotal: number): void;
+//# sourceMappingURL=position-ycoords.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"position-ycoords.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/position-ycoords.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAahD,gBAAgB;AAChB,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAE7C;AAMD,iEAAiE;AACjE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAY/C;AAED,0EAA0E;AAC1E,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMpE;AAED,gFAAgF;AAChF,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAOtE;AAED,+DAA+D;AAC/D,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAU9C;AAED,wEAAwE;AACxE,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,KAAK,EACR,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAY3B;AAED,oEAAoE;AACpE,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAO9F;AAED,0CAA0C;AAC1C,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAmBzC;AAMD,yEAAyE;AACzE,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAW/C;AAED,0DAA0D;AAC1D,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAO7D;AAED,yEAAyE;AACzE,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,GAAG,IAAI,CA2B9D;AAED,oFAAoF;AACpF,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK7C;AAED,6CAA6C;AAC7C,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAKzC;AAMD,mDAAmD;AACnD,wBAAgB,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAK/E;AAED,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAmB/E;AAED,8EAA8E;AAC9E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAgBjF;AAED,6CAA6C;AAC7C,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CA4B/D"}

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

@@ -0,0 +1,47 @@
+/**
+ * Dot position phase entry point: x-coordinate assignment, graph connectivity,
+ * leaf expansion stubs, and the main dot_position function.
+ * @see lib/dotgen/position.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+/**
+ * Reads ND_rank (set to x-coordinate by network simplex), writes to
+ * ND_coord.x, then RESTORES ND_rank = i (actual rank index).
+ *
+ * AD-8: This is the critical dual-use restoration point.
+ * After this function, ND_rank is valid again as a rank index.
+ *
+ * @see lib/dotgen/position.c:set_xcoords
+ */
+/** @see lib/dotgen/position.c:set_xcoords (rank→coord copy + rank restore) */
+export declare function setXcoordsFromRank(g: Graph): void;
+/** @see lib/dotgen/position.c:set_xcoords */
+export declare function setXcoords(g: Graph): void;
+/** @see lib/dotgen/position.c:connectGraph (check edge list for cross-rank edge) */
+export declare function edgeListCrossesRank(el: {
+    list: Edge[];
+    size: number;
+} | undefined, r: number): boolean;
+/** @see lib/dotgen/position.c:connectGraph (find node with cross-rank edge in rank) */
+export declare function rankHasCrossEdge(rk: {
+    v: Node[];
+    n: number;
+}, r: number): boolean;
+/** @see lib/dotgen/position.c:connectGraph */
+export declare function connectGraph(g: Graph): void;
+/** @see lib/dotgen/position.c:nsiter2 — nslimit attribute not yet ported */
+export declare function nsiter2(_g: Graph): number;
+/** @internal — expand rank slot array for leaf nodes */
+export declare function expandRankSlots(rk: {
+    v: Node[];
+    n: number;
+}, newN: number): void;
+/** @see lib/dotgen/position.c:make_leafslots */
+export declare function makeLeafslots(g: Graph): void;
+/** @see lib/dotgen/position.c:1015 expand_leaves */
+export declare function expandLeaves(g: Graph): void;
+/** @see lib/dotgen/position.c:dot_position */
+export declare function dotPosition(g: Graph): number;
+//# sourceMappingURL=position.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"position.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/position.ts"],"names":[],"mappings":"AAEA;;;;GAIG;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;AAmBhD;;;;;;;;GAQG;AACH,8EAA8E;AAC9E,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAUjD;AAED,6CAA6C;AAC7C,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAGzC;AAMD,oFAAoF;AACpF,wBAAgB,mBAAmB,CACjC,EAAE,EAAE;IAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,EAC9C,CAAC,EAAE,MAAM,GACR,OAAO,CAOT;AAED,uFAAuF;AACvF,wBAAgB,gBAAgB,CAAC,EAAE,EAAE;IAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAOjF;AAED,8CAA8C;AAC9C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAc3C;AAMD,4EAA4E;AAC5E,wBAAgB,OAAO,CAAC,EAAE,EAAE,KAAK,GAAG,MAAM,CAAuB;AAMjE,wDAAwD;AACxD,wBAAgB,eAAe,CAAC,EAAE,EAAE;IAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAQhF;AAED,gDAAgD;AAChD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAY5C;AAED,oDAAoD;AACpD,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAY3C;AAUD,8CAA8C;AAC9C,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CA+B5C"}

package/dist/layout/dot/rank-dot2.d.ts

@@ -0,0 +1,114 @@
+/** @see lib/dotgen/rank.c — dot2_rank pipeline */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import { Graph } from '../../model/graph.js';
+/** Mutable state replacing C statics Last_node and id in weak(). */
+export interface XgState {
+    lastNode: Node | undefined;
+    weakId: number;
+}
+export declare function eMinlen(e: Edge): number;
+export declare function eWeight(e: Edge): number;
+export declare function nRankOrZero(n: Node): number;
+export declare function gMaxrankOrNeg(g: Graph): number;
+export declare function gMinrankOrMax(g: Graph): number;
+export declare function gHasParent(g: Graph): boolean;
+export declare function gLevel(g: Graph): number;
+export declare function gParentOrSelf(g: Graph): Graph;
+/** @see lib/dotgen/rank.c:find */
+export declare function d2find(n: Node): Node;
+/** @see lib/dotgen/rank.c:union_one */
+export declare function d2unionOne(leader: Node, n: Node | undefined): Node;
+/** @see lib/dotgen/rank.c:union_all */
+export declare function d2unionAll(g: Graph): Node | undefined;
+/** @see lib/dotgen/rank.c:makeXnode — C's `agnode(G, name, 1)` returns the
+ *  existing node when one with `name` is present, so the fixed-name helper nodes
+ *  TOP/BOT are a single shared node across all strong clusters (compile_clusters
+ *  calls makeXnode(Xg, TOPNODE) once per cluster). Creating a fresh node per call
+ *  gives each cluster its own TOP/BOT, splitting the STRONG_CLUSTER_WEIGHT
+ *  constraint and derailing the rank solve. Real/weak node names are unique, so
+ *  this dedup only affects TOP/BOT/ROOT — exactly as in C. */
+export declare function makeXnode(Xg: Graph, name: string, st: XgState): Node;
+export declare function xgFindEdge(Xg: Graph, t: Node, h: Node): Edge | undefined;
+/** Xg edges are calloc'd in C: minlen/weight are 0, not the user-edge default 1
+ *  (dot_init_edge, dotinit.c:85). merge() relies on it — MAX(0,minlen) keeps a
+ *  minlen of 0, and += weight accumulates from 0. */
+export declare function xgAddEdge(Xg: Graph, t: Node, h: Node): Edge;
+export declare function xgDeleteEdge(Xg: Graph, e: Edge): void;
+/** @see lib/dotgen/rank.c:merge */
+export declare function xgMerge(e: Edge, minlen: number, weight: number): void;
+/** @see lib/dotgen/rank.c:rankset_kind */
+export declare function csRanksetKind(g: Graph): number;
+/** @see lib/dotgen/rank.c:set_parent + cluster setup in compile_samerank */
+export declare function csSetupCluster(g: Graph, parentClust: Graph | undefined): Graph | undefined;
+export declare function csProcessClusterNodes(g: Graph): void;
+export declare function csProcessRankset(g: Graph, clust: Graph | undefined): void;
+export declare function csCheckDegenerate(g: Graph): void;
+/** @see lib/dotgen/rank.c:compile_samerank */
+export declare function compileSamerank(g: Graph, parentClust: Graph | undefined): void;
+/** @see lib/dotgen/rank.c:compile_nodes */
+export declare function compileNodes(g: Graph, Xg: Graph, st: XgState): void;
+/** @see lib/dotgen/rank.c:strong */
+export declare function xgStrong(Xg: Graph, t: Node, h: Node, orig: Edge): void;
+/** @see lib/dotgen/rank.c:weak — find existing weak diamond v→t, v→h */
+export declare function xgWeakExists(Xg: Graph, t: Node, h: Node): boolean;
+export declare function xgWeakSetWeights(e: Edge, f: Edge, origW: number, origML: number): void;
+/** @see lib/dotgen/rank.c:weak */
+export declare function xgWeak(Xg: Graph, t: Node, h: Node, orig: Edge, st: XgState): void;
+/** @see lib/dotgen/rank.c:is_nonconstraint */
+export declare function isNonConstraint(e: Edge): boolean;
+/** @see lib/dotgen/rank.c:is_a_strong_cluster */
+export declare function isAStrongCluster(g: Graph): boolean;
+/** @see lib/dotgen/rank.c:dot_lca */
+export declare function dotLca(c0: Graph, c1: Graph): Graph;
+/** @see lib/dotgen/rank.c:is_internal_to_cluster */
+export declare function isInternalToCluster(e: Edge): boolean;
+/** Returns true if edge direction should be swapped for internal cluster. */
+export declare function ceShouldSwap(e: Edge, tc: Graph | undefined, hc: Graph | undefined): boolean;
+export declare function ceInternal(Xg: Graph, e: Edge, Xt: Node, Xh: Node): void;
+/** @see lib/dotgen/rank.c:compile_edges inner body */
+export declare function compileEdgeItem(Xg: Graph, e: Edge, Xt: Node, st: XgState): void;
+/** @see lib/dotgen/rank.c:compile_edges */
+export declare function compileEdges(g: Graph, Xg: Graph, st: XgState): void;
+interface ClusterBounds {
+    top: Node | undefined;
+    bot: Node | undefined;
+}
+export declare function ccProcessNode(g: Graph, Xg: Graph, st: XgState, n: Node, b: ClusterBounds): void;
+export declare function ccStrongCluster(g: Graph, Xg: Graph, st: XgState, top: Node | undefined, bot: Node | undefined): ClusterBounds;
+/** @see lib/dotgen/rank.c:compile_clusters */
+export declare function compileClusters(g: Graph, Xg: Graph, st: XgState, top: Node | undefined, bot: Node | undefined): void;
+export declare function reverseEdge2(Xg: Graph, e: Edge): void;
+interface DfsFrame {
+    v: Node;
+    edges: Edge[];
+    i: number;
+}
+export declare function dfsNode(Xg: Graph, v: Node, frames: DfsFrame[]): void;
+export declare function dfsStep(Xg: Graph, frames: DfsFrame[]): void;
+/** @see lib/dotgen/rank.c:break_cycles */
+export declare function breakCycles(Xg: Graph): void;
+/** @see lib/dotgen/rank.c:dfscc (iterative) */
+export declare function dfsccNode(Xg: Graph, start: Node, cc: number): void;
+/** @see lib/dotgen/rank.c:connect_components */
+export declare function connectComponents(Xg: Graph, st: XgState): number;
+/** @see lib/dotgen/rank.c:add_fast_edges */
+export declare function addFastEdges(Xg: Graph): void;
+export declare function setMinMax2Clusters(g: Graph): void;
+export declare function setMinMax2ScanNode(g: Graph, n: Node, ref: {
+    v: Node | undefined;
+}): void;
+/** @see lib/dotgen/rank.c:setMinMax */
+export declare function setMinMax2(g: Graph, doRoot: boolean): void;
+export declare function readoutCopyRank(g: Graph, n: Node): void;
+export declare function readoutUpdateMinrk(n: Node, xn: Node, minrk: number[]): void;
+export declare function readoutApplyMinrk(g: Graph, minrk: number[]): void;
+export declare function readoutShiftAll(g: Graph, delta: number): void;
+export declare function readoutScanNodes(g: Graph, minrk: number[] | undefined): void;
+export declare function readoutNormalize(g: Graph, minrk: number[] | undefined): boolean;
+/** @see lib/dotgen/rank.c:readout_levels */
+export declare function readoutLevels(g: Graph, Xg: Graph, ncc: number): void;
+/** @see lib/dotgen/rank.c:dot2_rank */
+export declare function dot2Rank(g: Graph): void;
+export {};
+//# sourceMappingURL=rank-dot2.d.ts.map

package/dist/layout/dot/rank-dot2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-dot2.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/rank-dot2.ts"],"names":[],"mappings":"AACA,kDAAkD;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAsB7C,oEAAoE;AACpE,MAAM,WAAW,OAAO;IAAG,QAAQ,EAAE,IAAI,GAAG,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;CAAE;AAMxE,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+B;AACvE,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA+B;AACvE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA6B;AACzE,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAiC;AAChF,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAsD;AACrG,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAAwC;AACrF,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAA8B;AACtE,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAA+B;AAM7E,kCAAkC;AAClC,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAKpC;AAED,uCAAuC;AACvC,wBAAgB,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,SAAS,GAAG,IAAI,CAGlE;AAED,uCAAuC;AACvC,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,SAAS,CAOrD;AAiBD;;;;;;8DAM8D;AAC9D,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAWpE;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,SAAS,CAExE;AAED;;qDAEqD;AACrD,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAI3D;AAED,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAGrD;AAED,mCAAmC;AACnC,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAGrE;AAMD,0CAA0C;AAC1C,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAQ9C;AAED,4EAA4E;AAC5E,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAW1F;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAEpD;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,SAAS,GAAG,IAAI,CAOzE;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAKhD;AAED,8CAA8C;AAC9C,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,GAAG,SAAS,GAAG,IAAI,CAO9E;AAMD,2CAA2C;AAC3C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CASnE;AAMD,oCAAoC;AACpC,wBAAgB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAGtE;AAED,wEAAwE;AACxE,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAOjE;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAKtF;AAED,kCAAkC;AAClC,wBAAgB,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAIjF;AAED,8CAA8C;AAC9C,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAIhD;AAED,iDAAiD;AACjD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAElD;AAED,qCAAqC;AACrC,wBAAgB,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,KAAK,CAOlD;AAED,oDAAoD;AACpD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAMpD;AAED,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,GAAG,SAAS,EAAE,EAAE,EAAE,KAAK,GAAG,SAAS,GAAG,OAAO,CAK3F;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,CAKvE;AAED,sDAAsD;AACtD,wBAAgB,eAAe,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAQ/E;AAED,2CAA2C;AAC3C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAMnE;AAMD,UAAU,aAAa;IAAG,GAAG,EAAE,IAAI,GAAG,SAAS,CAAC;IAAC,GAAG,EAAE,IAAI,GAAG,SAAS,CAAC;CAAE;AAEzE,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,aAAa,GAAG,IAAI,CAW/F;AAED,wBAAgB,eAAe,CAC7B,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,IAAI,GAAG,SAAS,GAC7E,aAAa,CAQf;AAED,8CAA8C;AAC9C,wBAAgB,eAAe,CAC7B,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,IAAI,GAAG,SAAS,GAC7E,IAAI,CAON;AAMD,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAIrD;AAED,UAAU,QAAQ;IAAG,CAAC,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,IAAI,EAAE,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;CAAE;AAEzD,wBAAgB,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAIpE;AAED,wBAAgB,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAO3D;AAED,0CAA0C;AAC1C,wBAAgB,WAAW,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAQ3C;AAMD,+CAA+C;AAC/C,wBAAgB,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAYlE;AAED,gDAAgD;AAChD,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,GAAG,MAAM,CAYhE;AAMD,4CAA4C;AAC5C,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAO5C;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAIjD;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE;IAAE,CAAC,EAAE,IAAI,GAAG,SAAS,CAAA;CAAE,GAAG,IAAI,CAIxF;AAED,uCAAuC;AACvC,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAO1D;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAIvD;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAI3E;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAEjE;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAE7D;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,SAAS,GAAG,IAAI,CAK5E;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,SAAS,GAAG,OAAO,CAS/E;AAED,4CAA4C;AAC5C,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAOpE;AAMD,uCAAuC;AACvC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAmBvC"}

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

@@ -0,0 +1,119 @@
+/** @see lib/dotgen/rank.c — dot1_rank pipeline (dot2_rank in rank-dot2.ts) */
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Graph } from '../../model/graph.js';
+import { class1 } from './classify.js';
+export declare const SAMERANK = 1;
+export declare const MINRANK = 2;
+export declare const SOURCERANK = 3;
+export declare const MAXRANK = 4;
+export declare const SINKRANK = 5;
+export declare const LEAFSET = 6;
+export declare const CLUSTER = 7;
+export declare const SLACKNODE = 2;
+export declare const EDGE_LABEL = 1;
+/** @see lib/common/const.h:HEAD_LABEL */
+export declare const HEAD_LABEL: number;
+/** @see lib/common/const.h:TAIL_LABEL */
+export declare const TAIL_LABEL: number;
+/** @see lib/common/const.h:NODE_XLABEL */
+export declare const NODE_XLABEL: number;
+/** @see lib/common/const.h:EDGE_XLABEL */
+export declare const EDGE_XLABEL: number;
+export declare const NEW_RANK: number;
+export declare const LOCAL = 100;
+export declare const GLOBAL = 101;
+export declare const NOCLUST = 102;
+/**
+ * Back-edge penalty multiplier for cluster constraints.
+ * @see lib/dotgen/class1.c:CL_BACK
+ */
+export declare const CL_BACK = 10;
+/**
+ * Edge type: edge is ignored during layout (concentrated / back-edge suppressed).
+ * @see lib/dotgen/class2.c:IGNORED
+ */
+export declare const IGNORED = 6;
+/** Global cluster layout type. @see lib/common/globals.h:CL_type */
+export declare let clType: number;
+export declare function setClType(t: number): void;
+/**
+ * @see lib/common/utils.c:mapBool — mapbool(p) === mapBool(p, false).
+ * Only a leading-digit value is parsed numerically (`gv_isdigit(*p)` →
+ * `atoi(p) != 0`); any other unrecognized string (e.g. "none") returns the
+ * default `false`. The previous `parseInt(s) !== 0` returned `true` for such
+ * strings because `NaN !== 0` is true — so `constraint=none` was treated as a
+ * rank constraint, mis-ranking clusters joined only by constraint=none edges.
+ */
+export declare function mapbool(s: string | undefined): boolean;
+/** @see lib/util/gv_math.h:scale_clamp */
+export declare function scaleClamp(nnodes: number, scale: number): number;
+/** @see lib/common/utils.c:is_a_cluster */
+export declare function isACluster(g: Graph): boolean;
+export { class1 };
+export declare function cleanup1ClearNode(n: Node): void;
+export declare function cleanup1CompSlot(g: Graph, comp: Node[], ci: number): void;
+export declare function cleanup1VirtA(g: Graph): void;
+export declare function cleanup1VirtB(g: Graph): void;
+/** @see lib/dotgen/rank.c:cleanup1 */
+export declare function cleanup1(g: Graph): void;
+/** @see lib/dotgen/rank.c:edgelabel_ranks */
+export declare function edgelabelRanks(g: Graph): void;
+/** @see lib/dotgen/rank.c:rank_set_class */
+export declare function rankSetClass(g: Graph): number;
+export declare function collapseRanksetMinMax(g: Graph, kind: number, u: Node): void;
+/** @see lib/dotgen/rank.c:collapse_rankset */
+export declare function collapseRankset(g: Graph, subg: Graph, kind: number): void;
+/** @see lib/dotgen/rank.c:make_new_cluster */
+export declare function makeNewCluster(g: Graph, subg: Graph): void;
+/** @see lib/dotgen/rank.c:node_induce */
+export declare function nodeInduce(par: Graph, clust: Graph): void;
+/** @see lib/dotgen/rank.c:dot_scan_ranks */
+export declare function dotScanRanks(g: Graph): void;
+export declare function clusterLeaderScan(g: Graph): [Node | undefined, number];
+/** @see lib/dotgen/rank.c:cluster_leader */
+export declare function clusterLeader(clust: Graph): void;
+/** @see lib/dotgen/rank.c:collapse_cluster */
+export declare function collapseCluster(g: Graph, subg: Graph): void;
+/** @see lib/dotgen/rank.c:collapse_sets */
+export declare function collapseSets(rg: Graph, g: Graph): void;
+/** @see lib/dotgen/rank.c:find_clusters */
+export declare function findClusters(g: Graph): void;
+/** @see lib/dotgen/rank.c:set_minmax */
+export declare function gLeaderRank(g: Graph): number;
+export declare function gMinrankVal(g: Graph): number;
+export declare function gMaxrankVal(g: Graph): number;
+export declare function gNCluster(g: Graph): number;
+export declare function gClust(g: Graph): Graph[];
+/** Used by expandNode and setMinMax2 in rank-dot2.ts */
+export declare function nRank(n: Node): number;
+export declare function nRanktype(n: Node): number;
+export declare function gMaxrankDef(g: Graph): number;
+export declare function gMinrankDef(g: Graph): number;
+/** @see lib/dotgen/rank.c:set_minmax */
+export declare function setMinmax(g: Graph): void;
+export declare function minmaxEdgesReverse(n: Node, isOut: boolean): number;
+/** @see lib/dotgen/rank.c:minmax_edges — returns [slenX, slenY] */
+export declare function minmaxEdges(g: Graph): [number, number];
+export declare function nOutEdge0(n: Node): Edge | undefined;
+export declare function nInEdge0(n: Node): Edge | undefined;
+export declare function mmEdges2CheckMax(g: Graph, n: Node, slen1: number): boolean;
+export declare function mmEdges2CheckMin(g: Graph, n: Node, slen0: number): boolean;
+/** @see lib/dotgen/rank.c:minmax_edges2 */
+export declare function minmaxEdges2(g: Graph, slen: [number, number]): boolean;
+/** @see lib/dotgen/rank.c:rank1 */
+export declare function rank1(g: Graph): void;
+/** @see lib/dotgen/rank.c:expand_ranksets (inner loop helper) */
+export declare function expandNode(g: Graph, n: Node): void;
+export declare function expandRankPostprocess(g: Graph): void;
+/** @see lib/dotgen/rank.c:expand_ranksets */
+export declare function expandRanksets(g: Graph): void;
+/** @see lib/dotgen/rank.c:dot1_rank */
+export declare function dot1Rank(g: Graph): void;
+/**
+ * Assign integer ranks to all nodes in g.
+ * Dispatches to dot1Rank or dot2Rank based on GD_flags & NEW_RANK.
+ * @see lib/dotgen/rank.c:dot_rank
+ */
+export declare function dotRank(g: Graph): void;
+//# sourceMappingURL=rank.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rank.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/rank.ts"],"names":[],"mappings":"AACA,8EAA8E;AAC9E,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAQlD,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAOvC,eAAO,MAAM,QAAQ,IAAM,CAAC;AAC5B,eAAO,MAAM,OAAO,IAAO,CAAC;AAC5B,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,eAAO,MAAM,OAAO,IAAO,CAAC;AAC5B,eAAO,MAAM,QAAQ,IAAM,CAAC;AAC5B,eAAO,MAAM,OAAO,IAAO,CAAC;AAC5B,eAAO,MAAM,OAAO,IAAO,CAAC;AAC5B,eAAO,MAAM,SAAS,IAAK,CAAC;AAC5B,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,yCAAyC;AACzC,eAAO,MAAM,UAAU,QAAS,CAAC;AACjC,yCAAyC;AACzC,eAAO,MAAM,UAAU,QAAS,CAAC;AACjC,0CAA0C;AAC1C,eAAO,MAAM,WAAW,QAAS,CAAC;AAClC,0CAA0C;AAC1C,eAAO,MAAM,WAAW,QAAS,CAAC;AAClC,eAAO,MAAM,QAAQ,QAAW,CAAC;AACjC,eAAO,MAAM,KAAK,MAAW,CAAC;AAC9B,eAAO,MAAM,MAAM,MAAU,CAAC;AAC9B,eAAO,MAAM,OAAO,MAAS,CAAC;AAE9B;;;GAGG;AACH,eAAO,MAAM,OAAO,KAAK,CAAC;AAE1B;;;GAGG;AACH,eAAO,MAAM,OAAO,IAAI,CAAC;AAEzB,oEAAoE;AACpE,eAAO,IAAI,MAAM,QAAQ,CAAC;AAC1B,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAgB;AAM1D;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAOtD;AAED,0CAA0C;AAC1C,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAIhE;AAED,2CAA2C;AAC3C,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAI5C;AAED,OAAO,EAAE,MAAM,EAAE,CAAC;AAOlB,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI/C;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAezE;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAQ5C;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAQ5C;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAWvC;AAMD,6CAA6C;AAC7C,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAQ7C;AAMD,4CAA4C;AAC5C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAS7C;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAQ3E;AAED,8CAA8C;AAC9C,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAezE;AAMD,8CAA8C;AAC9C,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAO1D;AAuCD,yCAAyC;AACzC,wBAAgB,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAuBzD;AAED,4CAA4C;AAC5C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAkB3C;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,GAAG,SAAS,EAAE,MAAM,CAAC,CAStE;AAED,4CAA4C;AAC5C,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAQhD;AAMD,8CAA8C;AAC9C,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,CAQ3D;AAED,2CAA2C;AAC3C,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,IAAI,CAUtD;AAED,2CAA2C;AAC3C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAK3C;AAOD,wCAAwC;AACxC,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAA0C;AACvF,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAC7E,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAgC;AAC7E,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAkC;AAC7E,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,CAA+B;AAExE,wDAAwD;AACxD,wBAAgB,KAAK,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAA6B;AACnE,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAiC;AAC3E,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAiC;AAC9E,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAsD;AAMnG,wCAAwC;AACxC,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAMxC;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAQlE;AAED,mEAAmE;AACnE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAOtD;AAGD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,SAAS,CAAgC;AACpF,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,SAAS,CAA+B;AAElF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAQ1E;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAQ1E;AAED,2CAA2C;AAC3C,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO,CAStE;AAMD,mCAAmC;AACnC,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAmBpC;AAED,iEAAiE;AACjE,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAMlD;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAOpD;AAED,6CAA6C;AAC7C,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAe7C;AAED,uCAAuC;AACvC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAWvC;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAOtC"}

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

@@ -0,0 +1,70 @@
+/**
+ * TypeScript port of lib/dotgen/sameport.c — dot_sameports.
+ *
+ * Merges edges with specified samehead/sametail attributes onto the same port.
+ *
+ * @see lib/dotgen/sameport.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { Point, Port } from '../../model/geom.js';
+/** @see lib/common/const.h:ARR_LEN (approximate — actual value depends on arrow rendering) */
+export declare const ARR_LEN = 10;
+/** A group of edges sharing the same samehead/sametail id at a node. */
+export interface SameGroup {
+    id: string;
+    edges: Edge[];
+}
+/** @see lib/dotgen/sameport.c:sameedge */
+export declare function sameedge(same: SameGroup[], e: Edge, id: string): void;
+/**
+ * Move curve[0] to node u's shape boundary along the Bézier, exactly as C's
+ * shape_clip: build the node's shape inside-function (ellipse vs polygon, pen-
+ * width aware) and bezier-clip with left_inside = insidefn(curve[0]). curve[0]
+ * is the node center, which is always inside, so left_inside is true.
+ *
+ * Replaces an earlier rectangle approximation, which was wrong for ellipse
+ * nodes (every honda head is an ellipse) and shifted the shared port ~17px.
+ *
+ * @see lib/common/splines.c:shape_clip / shape_clip0
+ */
+export declare function shapeClip(u: Node, curve: Point[]): void;
+/** Compute (x1,y1) offset to node boundary for average direction. */
+export declare function computeBoundaryOffset(u: Node, x: number, y: number, ranksep: number): {
+    x1: number;
+    y1: number;
+};
+/** Compute the average direction unit vector from u toward each edge's other end. */
+export declare function averageDirection(u: Node, edges: Edge[]): {
+    x: number;
+    y: number;
+};
+/** Build the shared port object for this group at node u. */
+export declare function buildSharedPort(u: Node, edges: Edge[], ranksep: number): Port;
+/** Assign prt to edge f at whichever end matches u. */
+export declare function assignHeadIfMatch(f: Edge, u: Node, prt: Port): void;
+/** Walk the forward virtual chain (via head.out) assigning ports. */
+export declare function assignPortForwardChain(e: Edge, u: Node, prt: Port): void;
+/** Walk the backward virtual chain (via tail.in) assigning ports. */
+export declare function assignPortBackwardChain(e: Edge, u: Node, prt: Port): void;
+/** Assign prt to all virtual edges of e that touch u. */
+export declare function assignPortToAllVirts(e: Edge, u: Node, prt: Port): void;
+/** @see lib/dotgen/sameport.c:sameport */
+export declare function sameport(u: Node, edges: Edge[], ranksep: number): void;
+/** True if any edge in g has a samehead attribute set. */
+export declare function graphHasSamehead(g: Graph): boolean;
+/** True if any edge in g has a sametail attribute set. */
+export declare function graphHasSametail(g: Graph): boolean;
+/** Collect samehead groups for node n. */
+export declare function collectSamehead(n: Node): SameGroup[];
+/** Collect sametail groups for node n. */
+export declare function collectSametail(n: Node): SameGroup[];
+/** Apply sameport merging for all multi-edge groups at node n. */
+export declare function applyGroupsToNode(n: Node, groups: SameGroup[], ranksep: number): void;
+/**
+ * Merge edge ports in g for edges sharing samehead/sametail attributes.
+ * @see lib/dotgen/sameport.c:dot_sameports
+ */
+export declare function dotSameports(g: Graph): void;
+//# sourceMappingURL=sameport.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sameport.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/sameport.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,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAavD,8FAA8F;AAC9F,eAAO,MAAM,OAAO,KAAK,CAAC;AAO1B,wEAAwE;AACxE,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAOD,0CAA0C;AAC1C,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAKrE;AAOD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAIvD;AAOD,qEAAqE;AACrE,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAC7C;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAkB5B;AAED,qFAAqF;AACrF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAWjF;AAED,6DAA6D;AAC7D,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAuB7E;AAOD,uDAAuD;AACvD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,IAAI,CAGnE;AAED,qEAAqE;AACrE,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,IAAI,CAYxE;AAED,qEAAqE;AACrE,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,IAAI,CAYzE;AAED,yDAAyD;AACzD,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,IAAI,CAKtE;AAOD,0CAA0C;AAC1C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAKtE;AAMD,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAKlD;AAED,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAKlD;AAOD,0CAA0C;AAC1C,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,CAQpD;AAED,0CAA0C;AAC1C,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,CAQpD;AAED,kEAAkE;AAClE,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAIrF;AAOD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAS3C"}

package/dist/layout/dot/self-loop.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Self-loop routing for the dot engine.
+ *
+ * Ports the self-edge branch of dot_splines_ in lib/dotgen/dotsplines.c:305-409.
+ * Self-loops are stored in ND_other (node.info.other) by class2OneEdge.
+ * This module: collects them, computes sizey from the rank table, and calls
+ * the shared makeSelfEdge dispatcher.
+ *
+ * @see lib/dotgen/dotsplines.c:305-409
+ * @see lib/common/splines.c:makeSelfEdge
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { Edge } from '../../model/edge.js';
+import type { SplineInfo } from '../../common/types.js';
+/**
+ * Build the dot-engine SplineInfo (sinfo).
+ * @see lib/dotgen/dotsplines.c:125-126
+ */
+export declare function buildDotSinfo(): SplineInfo;
+/**
+ * Collect node.info.other edges into `edges`, restoring rw from mval first.
+ *
+ * In position(), each NORMAL node that has self-loops has its rw increased to
+ * accommodate the loop geometry and the original value saved in mval.
+ * We restore the original rw here before routing.
+ *
+ * @see lib/dotgen/dotsplines.c:305-318
+ */
+export declare function collectOtherEdges(n: Node, edges: Edge[]): void;
+/**
+ * Compute the vertical sizing parameter for self-loops on node n.
+ *
+ * Mirrors the C branch exactly:
+ *   if r == maxrank: sizey = rank[r-1].v[0].y - n.y   (or ht if r==0)
+ *   elif r == minrank: sizey = n.y - rank[r+1].v[0].y
+ *   else: sizey = min(rank[r-1].v[0].y - n.y, n.y - rank[r+1].v[0].y)
+ *
+ * @see lib/dotgen/dotsplines.c:389-403
+ */
+export declare function computeSizey(g: Graph, n: Node): number;
+/**
+ * Route a contiguous group of cnt parallel self-loops via makeSelfEdge.
+ *
+ * @param g       - the graph (provides rank table for sizey)
+ * @param edges   - slice of the sorted edge list starting at the group
+ * @param cnt     - number of parallel self-loops in this group
+ * @param multisep - sd.Multisep (= nodesep)
+ * @param sinfo   - dot SplineInfo callbacks
+ *
+ * @see lib/dotgen/dotsplines.c:388-409
+ */
+export declare function routeSelfEdgeGroup(g: Graph, edges: Edge[], cnt: number, multisep: number, sinfo: SplineInfo): void;
+//# sourceMappingURL=self-loop.d.ts.map

package/dist/layout/dot/self-loop.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-loop.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/self-loop.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;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,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAWxD;;;GAGG;AACH,wBAAgB,aAAa,IAAI,UAAU,CAO1C;AAOD;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAc9D;AA+BD;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAOtD;AAOD;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,KAAK,EACR,KAAK,EAAE,IAAI,EAAE,EACb,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,UAAU,GAChB,IAAI,CAKN"}