@knowvah/dot-engine 2.6.12 → 2.7.1

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

@@ -1 +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,eAAe,EACxC,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"}
+{"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;AAShD,OAAO,EACL,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EACxC,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/edge-route-clip.d.ts

@@ -85,12 +85,22 @@ export declare function makeBoxInsideFn(halfW: number, halfH: number, penwidth?:
  */
 export declare function makeEllipseInsideFn(rx: number, ry: number, penwidth?: number): (lx: number, ly: number) => boolean;
 /**
- * Clip path START to the tail arrowhead base (symmetric to arrowEndClip).
+ * Clip path START to the tail arrowhead base (the arrowEndClip counterpart).
  *
- * path4[0] = tail node boundary (inside arrowhead sphere); after clip,
- * path4[0] = arrowhead base (elen from tailTip).
+ * Ports the bezier part of lib/common/arrows.c:arrowStartClip (:313-339); the
+ * `spl->sflag/sp` bookkeeping and the `startp += 3` step live in the caller
+ * (compound.ts:arrowStartClipIdx). Line map (C -> here):
+ *   :323-326 sp[0..2] = ps[startp+3..], sp[3] = spl->sp -> `sp` below
+ *   :328     if (slen > 0)                              -> `elen > 0`
+ *   :329-330 inside_context {p = &sp[3], r = &slen}     -> `inside` (centre = tip)
+ *   :331     bezier_clip(&ctx, inside, sp, false)       -> bezierClipNode, right
+ *            inside, in ABSOLUTE coordinates (centre 0,0), as C does
+ *   :334-337 ps[startp..startp+3] = sp[3..0]            -> returned array
+ *   :281-283 inside(): DIST(p, a.p[0]) <= a.r[0]        -> distFused <= elen
+ * path4[0] is the tip (spl->sp) at every call site, so elen <= 0 returns the
+ * same points.
  *
- * @see lib/common/arrows.c:arrowEndClip
+ * @see lib/common/arrows.c:arrowStartClip
  */
 export declare function tailArrowEndClip(path4: Point[], tailTip: Point, elen: number): Point[];
 //# sourceMappingURL=edge-route-clip.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"edge-route-clip.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/edge-route-clip.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAWjD;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,EAAE,EAAE,KAAK,EAAE,EACX,CAAC,EAAE,MAAM,GACR,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,CAAC,CAK3B;AA2DD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,EAAE,EAAE,KAAK,EAAE,EACX,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,EAC7C,UAAU,EAAE,OAAO,GAClB,KAAK,EAAE,CAMT;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAIpD;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,KAAK,EAAE,EACd,QAAQ,EAAE,KAAK,EACf,IAAI,EAAE,MAAM,GACX,KAAK,EAAE,CAMT;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAG9F;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,IAAM,CAAC;AAExC;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,QAAQ,SAAuB,GAC9B,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,CAKrC;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,QAAQ,SAAuB,GAC9B,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,CAKrC;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EAAE,EACd,OAAO,EAAE,KAAK,EACd,IAAI,EAAE,MAAM,GACX,KAAK,EAAE,CAIT"}
+{"version":3,"file":"edge-route-clip.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/edge-route-clip.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAWjD;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,EAAE,EAAE,KAAK,EAAE,EACX,CAAC,EAAE,MAAM,GACR,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,CAAC,CAK3B;AA2DD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,EAAE,EAAE,KAAK,EAAE,EACX,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,EAC7C,UAAU,EAAE,OAAO,GAClB,KAAK,EAAE,CAMT;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAIpD;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,KAAK,EAAE,EACd,QAAQ,EAAE,KAAK,EACf,IAAI,EAAE,MAAM,GACX,KAAK,EAAE,CAMT;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAG9F;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,IAAM,CAAC;AAExC;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,QAAQ,SAAuB,GAC9B,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,CAKrC;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,QAAQ,SAAuB,GAC9B,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,CAKrC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EAAE,EACd,OAAO,EAAE,KAAK,EACd,IAAI,EAAE,MAAM,GACX,KAAK,EAAE,CAMT"}

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

@@ -1 +1 @@
-{"version":3,"file":"edge-route-routing.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/edge-route-routing.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAIjD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAGpD,OAAO,EACL,WAAW,EACZ,MAAM,uBAAuB,CAAC;AAM/B,uDAAuD;AACvD,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,KAAK,EAAE,CAAC;IACnB,QAAQ,EAAE,KAAK,CAAC;IAChB,QAAQ,EAAE,KAAK,CAAC;CACjB;AAED,wEAAwE;AACxE,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAQD;;;GAGG;AACH;;;;;;GAMG;AACH,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,iEAAiE;AACjE,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;CACf;AAID,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,YAAY,EAClB,KAAK,CAAC,EAAE;IAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAA;CAAE,GACnD;IAAE,OAAO,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,EAAE,CAAA;CAAE,CAe3E;AAOD;;;GAGG;AACH;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,cAAc,CAAC,QAAQ,SAAuB,GAAG,MAAM,CAGtE;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAC1B,GAAG,EAAE,OAAO,GACX,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,CAOrC;AAED,wBAAgB,WAAW,CACzB,MAAM,EAAE,KAAK,EAAE,EACf,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,QAAQ,SAAuB,EAC/B,IAAI,GAAE,SAAqB,GAC1B;IAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAAC,QAAQ,EAAE,KAAK,CAAC;IAAC,QAAQ,EAAE,KAAK,CAAA;CAAE,CAexD;AAOD;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,YAAY,EAClB,QAAQ,SAAuB,EAC/B,IAAI,CAAC,EAAE,SAAS,GACf,gBAAgB,CASlB;AAOD;;;GAGG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,GACjD,gBAAgB,CAalB"}
+{"version":3,"file":"edge-route-routing.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/edge-route-routing.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAIjD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAGpD,OAAO,EACL,WAAW,EACZ,MAAM,uBAAuB,CAAC;AAM/B,uDAAuD;AACvD,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,KAAK,EAAE,CAAC;IACnB,QAAQ,EAAE,KAAK,CAAC;IAChB,QAAQ,EAAE,KAAK,CAAC;CACjB;AAED,wEAAwE;AACxE,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAQD;;;GAGG;AACH;;;;;;GAMG;AACH,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,iEAAiE;AACjE,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;CACf;AAID,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,YAAY,EAClB,KAAK,CAAC,EAAE;IAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAA;CAAE,GACnD;IAAE,OAAO,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,EAAE,CAAA;CAAE,CAe3E;AAOD;;;GAGG;AACH;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,cAAc,CAAC,QAAQ,SAAuB,GAAG,MAAM,CAGtE;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAC1B,GAAG,EAAE,OAAO,GACX,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,OAAO,CAOrC;AAED,wBAAgB,WAAW,CACzB,MAAM,EAAE,KAAK,EAAE,EACf,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,QAAQ,SAAuB,EAC/B,IAAI,GAAE,SAAqB,GAC1B;IAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAAC,QAAQ,EAAE,KAAK,CAAC;IAAC,QAAQ,EAAE,KAAK,CAAA;CAAE,CAuBxD;AAOD;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,YAAY,EAClB,QAAQ,SAAuB,EAC/B,IAAI,CAAC,EAAE,SAAS,GACf,gBAAgB,CASlB;AAOD;;;GAGG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,GACjD,gBAAgB,CAalB"}

package/dist/layout/dot/graph-label.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-label.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/graph-label.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAElD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAKhE,6DAA6D;AAC7D,eAAO,MAAM,WAAW,QAAS,CAAC;AA8ClC;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,KAAK,GAAG;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAMnG;AAeD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,GAAG,SAAS,GAAG,IAAI,CAuBhF"}
+{"version":3,"file":"graph-label.d.ts","sourceRoot":"","sources":["../../../src/layout/dot/graph-label.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAElD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAMhE,6DAA6D;AAC7D,eAAO,MAAM,WAAW,QAAS,CAAC;AA+BlC;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,KAAK,GAAG;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAMnG;AAeD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,GAAG,SAAS,GAAG,IAAI,CAuBhF"}

package/dist/layout/neato/__fixtures__/dijkstra-f.d.ts

@@ -0,0 +1,11 @@
+export interface DijkstraFFixture {
+    n: number;
+    rows: {
+        edges: number[];
+        ewgts: number[];
+    }[];
+    /** expected[s][j] = float32 bits of dist(s -> j), as 8-digit hex */
+    expected: string[][];
+}
+export declare const DIJKSTRA_F_FIXTURES: Record<'g9' | 'r2' | 'r5', DijkstraFFixture>;
+//# sourceMappingURL=dijkstra-f.d.ts.map

package/dist/layout/neato/__fixtures__/dijkstra-f.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra-f.d.ts","sourceRoot":"","sources":["../../../../src/layout/neato/__fixtures__/dijkstra-f.ts"],"names":[],"mappings":"AAKA,MAAM,WAAW,gBAAgB;IAC/B,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IAC7C,oEAAoE;IACpE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;CACtB;AAED,eAAO,MAAM,mBAAmB,EAAE,MAAM,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,gBAAgB,CAI5E,CAAC"}

package/dist/layout/neato/__fixtures__/hier-imds.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Expected vectors for the T17 smart_ini_x tests, captured from a native
+ * clang -O3 -arch arm64 (-DDIGCOLA) harness linking lib/neatogen/{smart_ini_x,
+ * kkutils,dijkstra,bfs,matrix_ops,conjgrad}.c unmodified (graphviz 16.1.0),
+ * run once per case in a fresh process (libc rand() starts at its seed).
+ * Graphs follow neatoinit.c:makeGraphData adjacency (out edges, then in edges;
+ * duplicate endpoints merged with fmax of len).
+ */
+import type { VtxData } from '../dijkstra.js';
+/** One undirected-adjacency edge . */
+export type HierEdge = readonly [number, number, number];
+/** Names of the harness cases. */
+export type ImdsCaseName = 'probe' | 'probe_nowgt' | 'probe_frac' | 'c1554' | 'disc' | 'dag32' | 'dag32_tight' | 'dag9' | 'dag17' | 'dag24';
+/** Harness case: graph spec plus native results. */
+export interface ImdsCase {
+    readonly edges: readonly HierEdge[];
+    readonly haveLen: boolean;
+    readonly haveDir: boolean;
+    /** Native compute_apsp matrix (row-major) or, for n > 7, its row sums. */
+    readonly D: readonly number[];
+    readonly n: number;
+    readonly tol: number;
+    readonly rv: number;
+    readonly input: readonly number[];
+    readonly x: readonly number[];
+    readonly y: readonly number[];
+}
+/**
+ * Mirror of neatoinit.c:makeGraphData's adjacency construction.  is
+ * the empty array (C NULL) unless .
+ * @see lib/neatogen/neatoinit.c:makeGraphData
+ */
+export declare function buildGraph(n: number, edges: readonly HierEdge[], haveLen: boolean, haveDir: boolean): VtxData[];
+/** Native results per harness case (see file header). */
+export declare const IMDS_CASES: Readonly<Record<ImdsCaseName, ImdsCase>>;
+//# sourceMappingURL=hier-imds.d.ts.map

package/dist/layout/neato/__fixtures__/hier-imds.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hier-imds.d.ts","sourceRoot":"","sources":["../../../../src/layout/neato/__fixtures__/hier-imds.ts"],"names":[],"mappings":"AACA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAE9C,sCAAsC;AACtC,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAEzD,kCAAkC;AAClC,MAAM,MAAM,YAAY,GACpB,OAAO,GAAG,aAAa,GAAG,YAAY,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG,aAAa,GACnF,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC;AAE/B,oDAAoD;AACpD,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,0EAA0E;IAC1E,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC/B;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CACxB,CAAC,EAAE,MAAM,EACT,KAAK,EAAE,SAAS,QAAQ,EAAE,EAC1B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,GACf,OAAO,EAAE,CAsBX;AAED,yDAAyD;AACzD,eAAO,MAAM,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,CAiF/D,CAAC"}

package/dist/layout/neato/__fixtures__/hier-majorization.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Expected layouts for the T22 stress_majorization_with_hierarchy tests, captured
+ * from a native clang -O3 -flto=thin -arch arm64 (-DDIGCOLA) harness that links the
+ * oracle's own lib/neatogen (graphviz 16.1.0) and calls the function with a fresh
+ * libc rand()/drand48() stream (srand(1), srand48(seed)). Graphs are neato vtx_data
+ * with haveDir (edists); `g40` is a seeded random DAG (40 nodes, 70 edges).
+ * Generated data: do not hand-edit.
+ */
+/** One harness invocation and its native result. */
+export interface MajorizationCase {
+    readonly name: string;
+    readonly graph: 'probe' | 'c1554' | 'rdag' | 'g40';
+    readonly dim: number;
+    readonly opts: number;
+    readonly maxi: number;
+    readonly levelsGap: number;
+    readonly epsilon: number;
+    /** `srand48` seed before the call. */
+    readonly seed: number;
+    /** Native return value (iterations). */
+    readonly rv: number;
+    /** Native `d_coords`, one array per axis. */
+    readonly coords: readonly (readonly number[])[];
+}
+/** `vtx_data` rows of the `g40` graph. */
+export declare const G40_ROWS: readonly {
+    edges: number[];
+    ewgts: number[];
+    edists: number[];
+}[];
+export declare const MAJORIZATION_CASES: readonly MajorizationCase[];
+//# sourceMappingURL=hier-majorization.d.ts.map

package/dist/layout/neato/__fixtures__/hier-majorization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hier-majorization.d.ts","sourceRoot":"","sources":["../../../../src/layout/neato/__fixtures__/hier-majorization.ts"],"names":[],"mappings":"AACA;;;;;;;GAOG;AAEH,oDAAoD;AACpD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,GAAG,MAAM,GAAG,KAAK,CAAC;IACnD,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,sCAAsC;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,wCAAwC;IACxC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,6CAA6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC;CACjD;AAED,0CAA0C;AAC1C,eAAO,MAAM,QAAQ,EAAE,SAAS;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE,EAAgjF,CAAC;AAEvoF,eAAO,MAAM,kBAAkB,EAAE,SAAS,gBAAgB,EAkHzD,CAAC"}

package/dist/layout/neato/cdt-surface.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cdt-surface.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/cdt-surface.ts"],"names":[],"mappings":"AAuCA,mEAAmE;AACnE,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,sDAAsD;IACtD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,2EAA2E;IAC3E,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AA0lBD;;;;;GAKG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GACjE,OAAO,GAAG,IAAI,CAwDhB"}
+{"version":3,"file":"cdt-surface.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/cdt-surface.ts"],"names":[],"mappings":"AAwCA,mEAAmE;AACnE,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,sDAAsD;IACtD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,2EAA2E;IAC3E,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAwlBD;;;;;GAKG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GACjE,OAAO,GAAG,IAAI,CA+ChB"}

package/dist/layout/neato/compute-hierarchy.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Partition graph nodes into levels by the minimizer of the hierarchy energy.
+ *
+ * @see lib/neatogen/compute_hierarchy.c
+ */
+import type { VtxData } from './dijkstra.js';
+/** Result of `compute_hierarchy` on success (C return value 0). */
+export interface Hierarchy {
+    /** Node ids sorted by `y`; level `k` is `ordering[levels[k-1]..levels[k])`. */
+    ordering: Int32Array;
+    /** Start index (in `ordering`) of every level but the first; `[n]` when there is one level. */
+    levels: Int32Array;
+    /** C `*num_levelsp` (0 means a single level, `levels = [n]`). */
+    numLevels: number;
+}
+/**
+ * Order the nodes by `y` (computed by `computeYCoords` unless `given` is
+ * supplied) and cut a new level wherever consecutive values differ by more
+ * than `max(absTol, relTol * span / (n - 1))`. Returns `null` where C returns
+ * nonzero (`compute_y_coords` failed).
+ * @see lib/neatogen/compute_hierarchy.c:compute_hierarchy
+ */
+export declare function computeHierarchy(graph: VtxData[], n: number, absTol: number, relTol: number, given: Float64Array | null): Hierarchy | null;
+//# sourceMappingURL=compute-hierarchy.d.ts.map

package/dist/layout/neato/compute-hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compute-hierarchy.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/compute-hierarchy.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAI7C,mEAAmE;AACnE,MAAM,WAAW,SAAS;IACxB,+EAA+E;IAC/E,QAAQ,EAAE,UAAU,CAAC;IACrB,+FAA+F;IAC/F,MAAM,EAAE,UAAU,CAAC;IACnB,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;CACnB;AAsCD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,OAAO,EAAE,EAChB,CAAC,EAAE,MAAM,EACT,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,YAAY,GAAG,IAAI,GACzB,SAAS,GAAG,IAAI,CAkBlB"}

package/dist/layout/neato/conjgrad-mkernel.d.ts

@@ -0,0 +1,20 @@
+/**
+ * `result = packed_matrix * vector` for the packed upper triangle of a
+ * symmetric matrix: per row the first `16*floor(len/16)` products of the
+ * reduction are rounded before their adds, the rest fused; the scatter into
+ * `result[j]` is fused throughout.
+ * @see lib/neatogen/matrix_ops.c:right_mult_with_vector_ff
+ */
+export declare function rightMultWithVectorFFFused(m: Float32Array, n: number, vector: Float32Array, result: Float32Array): void;
+/** Options of {@link conjugateGradientMkernelFused} (C's trailing `tol`, `max_iterations`). */
+export interface CgMkernelOptions {
+    tol: number;
+    maxIterations: number;
+}
+/**
+ * Solve `A*x = b` by conjugate gradients, `A` packed symmetric; `x` and `b` are
+ * centred. Returns 1 on an unexpected zero residual, else 0.
+ * @see lib/neatogen/conjgrad.c:conjugate_gradient_mkernel
+ */
+export declare function conjugateGradientMkernelFused(A: Float32Array, x: Float32Array, b: Float32Array, n: number, o: CgMkernelOptions): number;
+//# sourceMappingURL=conjgrad-mkernel.d.ts.map

package/dist/layout/neato/conjgrad-mkernel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conjgrad-mkernel.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/conjgrad-mkernel.ts"],"names":[],"mappings":"AA8BA;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CACxC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GACrE,IAAI,CAeN;AAmBD,+FAA+F;AAC/F,MAAM,WAAW,gBAAgB;IAC/B,GAAG,EAAE,MAAM,CAAC;IACZ,aAAa,EAAE,MAAM,CAAC;CACvB;AAgDD;;;;GAIG;AACH,wBAAgB,6BAA6B,CAC3C,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,gBAAgB,GAChF,MAAM,CAQR"}

package/dist/layout/neato/conjgrad.d.ts

@@ -1,3 +1,4 @@
+import type { VtxData } from './dijkstra.js';
 /**
  * Conjugate gradient solvers for packed symmetric float matrices.
  * @see lib/neatogen/conjgrad.c
@@ -57,5 +58,23 @@ export interface CgOptions {
  * @see lib/neatogen/conjgrad.c:conjugate_gradient_mkernel
  */
 export declare function conjugateGradientMkernel(A: Float32Array, x: Float32Array, b: Float32Array, n: number, opts: CgOptions): number;
+/**
+ * Solve `A x = b` by conjugate gradients; `x` and `b` are orthogonalized
+ * against 1. Returns C's `rv` (1 on the zero-length-residual failure).
+ * @see lib/neatogen/conjgrad.c:conjugate_gradient
+ */
+export declare function conjugateGradient(A: VtxData[], x: Float64Array, b: Float64Array, n: number, tol: number, maxIterations: number): number;
+/** Stopping rule and centring of {@link conjugateGradientF} (C's trailing parameters). */
+export interface CgfOptions {
+    tol: number;
+    maxIterations: number;
+    ortho1: boolean;
+}
+/**
+ * Solves A x = b for a float** matrix with double x, b (x, b centred when
+ * `ortho1`). Returns 0, or 1 after a zero-length residual (callers test `< 0`).
+ * @see lib/neatogen/conjgrad.c:conjugate_gradient_f
+ */
+export declare function conjugateGradientF(A: readonly Float32Array[], x: Float64Array, b: Float64Array, n: number, opts: CgfOptions): number;
 export {};
 //# sourceMappingURL=conjgrad.d.ts.map

package/dist/layout/neato/conjgrad.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"conjgrad.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/conjgrad.ts"],"names":[],"mappings":"AACA;;;GAGG;AAEH;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,GAAG,IAAI,CAKzD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,GACd,IAAI,CASN;AAED,uDAAuD;AACvD,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAO1D;AAED,mDAAmD;AACnD,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAIxE;AAED,iCAAiC;AACjC,UAAU,OAAO;IACf,CAAC,EAAE,YAAY,CAAC;IAChB,CAAC,EAAE,YAAY,CAAC;IAChB,EAAE,EAAE,YAAY,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;GAGG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,GACR,OAAO,CAST;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,MAAM,EACT,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,OAAO,GACb,MAAM,CASR;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,OAAO,GACZ,MAAM,CAWR;AAED,oDAAoD;AACpD,MAAM,WAAW,SAAS;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CACtC,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,SAAS,GACd,MAAM,CASR"}
+{"version":3,"file":"conjgrad.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/conjgrad.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAc7C;;;GAGG;AAEH;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,GAAG,IAAI,CAKzD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,GACd,IAAI,CASN;AAED,uDAAuD;AACvD,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAO1D;AAED,mDAAmD;AACnD,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAIxE;AAED,iCAAiC;AACjC,UAAU,OAAO;IACf,CAAC,EAAE,YAAY,CAAC;IAChB,CAAC,EAAE,YAAY,CAAC;IAChB,EAAE,EAAE,YAAY,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;GAGG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,GACR,OAAO,CAST;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,MAAM,EACT,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,OAAO,GACb,MAAM,CASR;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,OAAO,GACZ,MAAM,CAWR;AAED,oDAAoD;AACpD,MAAM,WAAW,SAAS;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CACtC,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,SAAS,GACd,MAAM,CASR;AAgED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,OAAO,EAAE,EACZ,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,GAAG,EAAE,MAAM,EACX,aAAa,EAAE,MAAM,GACpB,MAAM,CAkBR;AAoED,0FAA0F;AAC1F,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,OAAO,CAAC;CACjB;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,SAAS,YAAY,EAAE,EAC1B,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,UAAU,GACf,MAAM,CAaR"}

package/dist/layout/neato/constrained-majorization.d.ts

@@ -0,0 +1,26 @@
+import type { Node } from '../../model/node.js';
+import type { DirectedVtxData } from './opt-arrangement.js';
+/** The scalar parameters of `stress_majorization_with_hierarchy`. */
+export interface HierarchyOpts {
+    /** Dimensionality of the layout. */
+    dim: number;
+    /** `opt_*` bits. */
+    opts: number;
+    /** `MODEL_*` (neato.h values). */
+    model: number;
+    /** Maximum number of iterations. */
+    maxi: number;
+    /** Minimum separation of consecutive levels (`levelsgap`). */
+    levelsGap: number;
+    /** The `Epsilon` global: convergence tolerance (`epsilon` attribute). */
+    epsilon: number;
+}
+/**
+ * Stress majorization of the layout under hierarchy constraints. Writes the
+ * layout to `dCoords` and returns the iteration count (C's return value; -1
+ * on failure). Graphs without directed edges, and layouts that find no
+ * hierarchy, go to the unconstrained stress majorization.
+ * @see lib/neatogen/constrained_majorization.c:stress_majorization_with_hierarchy
+ */
+export declare function stressMajorizationWithHierarchy(graph: DirectedVtxData[], n: number, dCoords: Float64Array[], nodes: Node[], o: HierarchyOpts): number;
+//# sourceMappingURL=constrained-majorization.d.ts.map

package/dist/layout/neato/constrained-majorization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constrained-majorization.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/constrained-majorization.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAQhD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AA8B5D,qEAAqE;AACrE,MAAM,WAAW,aAAa;IAC5B,oCAAoC;IACpC,GAAG,EAAE,MAAM,CAAC;IACZ,oBAAoB;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,kCAAkC;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,8DAA8D;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,yEAAyE;IACzE,OAAO,EAAE,MAAM,CAAC;CACjB;AAuXD;;;;;;GAMG;AACH,wBAAgB,+BAA+B,CAC7C,KAAK,EAAE,eAAe,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,aAAa,GAC5F,MAAM,CAyBR"}

package/dist/layout/neato/dijkstra.d.ts

@@ -25,24 +25,41 @@ export interface TermSgd {
     d: number;
     w: number;
 }
-/** Push vertex index `idx` into the heap. @internal */
-export declare function heapPush(heap: number[], dist: Float32Array, idx: number): void;
-/** Sift the root down to restore heap order after replacing it. @internal */
-export declare function heapSiftDown(heap: number[], dist: Float32Array): void;
-/** Pop and return the vertex with minimum distance. @internal */
-export declare function heapPop(heap: number[], dist: Float32Array): number;
-/** Build a min-heap from all nodes except `src`. @internal */
-export declare function heapBuildExcluding(src: number, n: number, dist: Float32Array): number[];
-/** Initialise dist array from source edges. @internal */
-export declare function dijkstraInitDist(src: number, graph: VtxData[], n: number, dist: Float32Array): void;
-/** Relax all outgoing edges of `closest`. @internal */
-export declare function dijkstraRelax(closest: number, closestDist: number, graph: VtxData[], dist: Float32Array, heap: number[]): void;
+/** C `FLT_MAX`: the "unreachable" distance of dijkstra_f. */
+export declare const FLT_MAX = 3.4028234663852886e+38;
 /**
- * Single-source shortest paths (weighted) from `src`.
- * Populates `dist` with Float32 distances; unreachable nodes get Infinity.
- * Equivalent to `dijkstra_f` in lib/neatogen/dijkstra.c.
+ * Weighted single-source shortest paths from `vertex`; assumes a connected
+ * graph, unreachable vertices keep `FLT_MAX`. All arithmetic is C `float`.
  *
  * @see lib/neatogen/dijkstra.c:dijkstra_f
  */
-export declare function dijkstra(src: number, graph: VtxData[], n: number, dist: Float32Array): void;
+export declare function dijkstra(vertex: number, graph: VtxData[], n: number, dist: Float32Array): void;
+/** C `(DistType)INT_MAX`. @see lib/neatogen/dijkstra.c:MAX_DIST */
+export declare const MAX_DIST = 2147483647;
+/**
+ * The heap of dijkstra.c: `data[i] = vertexNum <=> index[vertexNum] = i`, with
+ * the 0-rooted `left = 2i`, `right = 2i + 1`, `parent = i / 2` numbering.
+ * @see lib/neatogen/dijkstra.c:heap
+ */
+export interface NgHeap {
+    data: number[];
+    heapSize: number;
+    index: Int32Array;
+}
+/** @see lib/neatogen/dijkstra.c:initHeap */
+export declare function ngInitHeap(startVertex: number, dist: Int32Array, n: number): NgHeap;
+/**
+ * Pops the closest vertex; returns -1 (C `false`) when the heap is empty.
+ * @see lib/neatogen/dijkstra.c:extractMax
+ */
+export declare function ngExtractMax(h: NgHeap, dist: Int32Array): number;
+/** @see lib/neatogen/dijkstra.c:increaseKey */
+export declare function ngIncreaseKey(h: NgHeap, increasedVertex: number, newDist: number, dist: Int32Array): void;
+/**
+ * Single-source shortest paths on the int-truncated edge weights `ewgts`;
+ * unreachable vertices get `prevClosestDist + 10` (INT_MAX when that would
+ * overflow).
+ * @see lib/neatogen/dijkstra.c:ngdijkstra
+ */
+export declare function ngdijkstra(vertex: number, graph: VtxData[], n: number, dist: Int32Array): void;
 //# sourceMappingURL=dijkstra.d.ts.map

package/dist/layout/neato/dijkstra.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dijkstra.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/dijkstra.ts"],"names":[],"mappings":"AACA,mCAAmC;AAEnC;;;;;;;;;GASG;AACH,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;;GAIG;AACH,MAAM,WAAW,OAAO;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAMD,uDAAuD;AACvD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,MAAM,EAAE,EACd,IAAI,EAAE,YAAY,EAClB,GAAG,EAAE,MAAM,GACV,IAAI,CAWN;AAED,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAcrE;AAED,iEAAiE;AACjE,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,CAOlE;AAED,8DAA8D;AAC9D,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,YAAY,GACjB,MAAM,EAAE,CAMV;AAMD,yDAAyD;AACzD,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,OAAO,EAAE,EAChB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,YAAY,GACjB,IAAI,CAKN;AAED,uDAAuD;AACvD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,EAAE,EAChB,IAAI,EAAE,YAAY,EAClB,IAAI,EAAE,MAAM,EAAE,GACb,IAAI,CAUN;AAMD;;;;;;GAMG;AACH,wBAAgB,QAAQ,CACtB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,OAAO,EAAE,EAChB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,YAAY,GACjB,IAAI,CASN"}
+{"version":3,"file":"dijkstra.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/dijkstra.ts"],"names":[],"mappings":"AACA,mCAAmC;AAEnC;;;;;;;;;GASG;AACH,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;;GAIG;AACH,MAAM,WAAW,OAAO;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAOD,6DAA6D;AAC7D,eAAO,MAAM,OAAO,yBAAwB,CAAC;AAqE7C;;;;;GAKG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,OAAO,EAAE,EAChB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,YAAY,GACjB,IAAI,CAeN;AAMD,mEAAmE;AACnE,eAAO,MAAM,QAAQ,aAAa,CAAC;AAEnC;;;;GAIG;AACH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,UAAU,CAAC;CACnB;AAgDD,4CAA4C;AAC5C,wBAAgB,UAAU,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAgBnF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,MAAM,CAQhE;AAED,+CAA+C;AAC/C,wBAAgB,aAAa,CAC3B,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GACpE,IAAI,CAUN;AAOD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI,CAuB9F"}

package/dist/layout/neato/gts-triangle.d.ts

@@ -0,0 +1,14 @@
+/**
+ * GTS's enclosing triangle, split from cdt-surface.ts to mirror the GTS source
+ * file it ports (the oracle links libgts 0.7.6 for neato's constrained
+ * Delaunay triangulation).
+ * @see gts-0.7.6 src/triangle.c
+ */
+/**
+ * Vertices of the triangle enclosing points (px[0..n), py[0..n)). The oracle's
+ * libgts (arm64) fuses r*SQRT3 + xo, r*2 + yo, xo - r*SQRT3 and
+ * dx*dx + dy*dy (fmadd/fmsub in _gts_triangle_enclosing), so those are fma.
+ * @see gts-0.7.6 src/triangle.c:gts_triangle_enclosing
+ */
+export declare function gtsTriangleEnclosing(px: number[], py: number[], n: number, scale: number): [[number, number], [number, number], [number, number]];
+//# sourceMappingURL=gts-triangle.d.ts.map

package/dist/layout/neato/gts-triangle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gts-triangle.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/gts-triangle.ts"],"names":[],"mappings":"AACA;;;;;GAKG;AAOH;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GACnD,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAoBxD"}

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

@@ -12,7 +12,8 @@ import type { Node } from '../../model/node.js';
 import type { Edge } from '../../model/edge.js';
 import type { VtxData } from './dijkstra.js';
 import { checkStart } from './start.js';
-export { checkStart };
+import { makeGraphDataC, graphHasLen } from './make-graph-data.js';
+export { makeGraphDataC, graphHasLen, checkStart };
 /** Kamada-Kawai energy minimization. @see lib/neatogen/neatoprocs.h */
 export declare const MODE_KK = 0;
 /** Stress majorization (default). @see lib/neatogen/neatoprocs.h */
@@ -143,17 +144,6 @@ export declare function mapModelToStress(model: number): number;
 export declare function neatoMaxIter(maxiter: string | undefined, mode: number, n: number): number;
 /** Run stress majorization and write positions back. @see lib/neatogen/neatoinit.c:majorization */
 export declare function runMajorization(g: Graph, mode: number, model: number): void;
-/** Any edge carries a len attr (C: agattr_text(g, AGEDGE, "len")). */
-export declare function graphHasLen(g: Graph): boolean;
-/**
- * C makeGraphData's vtx_data: per node out-edges then in-edges (agfstedge order), self at
- * index 0, duplicate neighbours merged (len keeps the max). ewgts: lens (default 1.0) if any
- * len attr, else 1.0 under haveDir (hier/ipsep), else absent (C NULL). eweights (haveWt)
- * and edists are not built: nothing on a supported path reads them.
- * @see lib/neatogen/neatoinit.c:makeGraphData
- * @see lib/neatogen/stuff.c:setEdgeLen
- */
-export declare function makeGraphDataC(g: Graph, nodeList: Node[], haveLen: boolean, haveDir: boolean): VtxData[];
 /** Dispatch to the layout solver for the mode. @see lib/neatogen/neatoinit.c:neatoLayout */
 export declare function solveModel(g: Graph, mode: number, model: number): void;
 /** Minimum X and Y across all node positions. @see lib/neatogen/neatoinit.c (translate logic) */

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

@@ -1 +1 @@
-{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/init.ts"],"names":[],"mappings":"AACA;;;;;;;;GAQG;AAGH,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,OAAO,EAAE,MAAM,eAAe,CAAC;AAS7C,OAAO,EAAE,UAAU,EAA0D,MAAM,YAAY,CAAC;AAEhG,OAAO,EAAE,UAAU,EAAE,CAAC;AAgBtB,uEAAuE;AACvE,eAAO,MAAM,OAAO,IAAI,CAAC;AACzB,oEAAoE;AACpE,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,iFAAiF;AACjF,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,mEAAmE;AACnE,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,kEAAkE;AAClE,eAAO,MAAM,QAAQ,IAAI,CAAC;AAO1B,6DAA6D;AAC7D,eAAO,MAAM,eAAe,IAAI,CAAC;AACjC,kEAAkE;AAClE,eAAO,MAAM,aAAa,IAAI,CAAC;AAC/B,gEAAgE;AAChE,eAAO,MAAM,YAAY,IAAI,CAAC;AAC9B,mDAAmD;AACnD,eAAO,MAAM,SAAS,IAAI,CAAC;AAY3B;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,SAAW,GAAG,IAAI,CAc3D;AAMD;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAaxC;AAMD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAKxE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,CAGnF;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGjD;AAED;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CACrB,CAAC,EAAE,KAAK,EACR,WAAW,EAAE,MAAM,EACnB,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,GACtB,MAAM,CAaR;AAMD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,CAK9C;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAE1D;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAI1C;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAOpF;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAO5D;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,CAKhD;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,YAAY,EAAE,CAS1E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAM5F;AAMD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAKtD;AAMD,uGAAuG;AACvG,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIzF;AAED,mGAAmG;AACnG,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAoB3E;AAED,sEAAsE;AACtE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAK7C;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAC7D,OAAO,EAAE,CAyBX;AAED,4FAA4F;AAC5F,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAWtE;AAMD,iGAAiG;AACjG,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAUnE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAOrE;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAI7C;AAMD;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAc7C;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAS3C"}
+{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/init.ts"],"names":[],"mappings":"AACA;;;;;;;;GAQG;AAGH,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,OAAO,EAAE,MAAM,eAAe,CAAC;AAU7C,OAAO,EACL,UAAU,EACX,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAKnE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;AAgBnD,uEAAuE;AACvE,eAAO,MAAM,OAAO,IAAI,CAAC;AACzB,oEAAoE;AACpE,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,iFAAiF;AACjF,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,mEAAmE;AACnE,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,kEAAkE;AAClE,eAAO,MAAM,QAAQ,IAAI,CAAC;AAO1B,6DAA6D;AAC7D,eAAO,MAAM,eAAe,IAAI,CAAC;AACjC,kEAAkE;AAClE,eAAO,MAAM,aAAa,IAAI,CAAC;AAC/B,gEAAgE;AAChE,eAAO,MAAM,YAAY,IAAI,CAAC;AAC9B,mDAAmD;AACnD,eAAO,MAAM,SAAS,IAAI,CAAC;AAY3B;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,SAAW,GAAG,IAAI,CAc3D;AAMD;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAaxC;AAMD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAKxE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,CAGnF;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGjD;AAED;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CACrB,CAAC,EAAE,KAAK,EACR,WAAW,EAAE,MAAM,EACnB,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,GACtB,MAAM,CAaR;AAMD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,CAK9C;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,OAAO,EAAE,CAE1D;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAI1C;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAOpF;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAO5D;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,CAKhD;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,YAAY,EAAE,CAS1E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAM5F;AAMD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAKtD;AAMD,uGAAuG;AACvG,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIzF;AA2CD,mGAAmG;AACnG,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAiB3E;AAED,4FAA4F;AAC5F,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAWtE;AAMD,iGAAiG;AACjG,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAUnE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAOrE;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAI7C;AAMD;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAc7C;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAS3C"}

package/dist/layout/neato/kkutils.d.ts

@@ -0,0 +1,20 @@
+import type { VtxData } from './dijkstra.js';
+/**
+ * Sort `ordering[0..size)` by ascending `place[ordering[i]]`.
+ * @see lib/neatogen/kkutils.c:quicksort_place
+ */
+export declare function quicksortPlace(place: Float64Array, ordering: Int32Array, size: number): void;
+/**
+ * Sort `ordering[first..last]` (inclusive) by ascending `place[ordering[i]]`
+ * (float keys); a no-op unless `first < last`.
+ * @see lib/neatogen/kkutils.c:quicksort_placef
+ */
+export declare function quicksortPlacef(place: Float32Array, ordering: Int32Array, first: number, last: number): void;
+/**
+ * All-pairs shortest-path lengths as `DistType` (int) rows: Dijkstra when the
+ * graph has edge lengths (`graph->ewgts`; the port's empty array is C NULL),
+ * BFS otherwise.
+ * @see lib/neatogen/kkutils.c:compute_apsp
+ */
+export declare function computeApsp(graph: VtxData[], n: number): Int32Array[];
+//# sourceMappingURL=kkutils.d.ts.map

package/dist/layout/neato/kkutils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kkutils.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/kkutils.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAyB7C;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAE5F;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,YAAY,EACnB,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GACX,IAAI,CAIN;AAwBD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE,CAErE"}

package/dist/layout/neato/make-graph-data.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Neato's sparse graph (`vtx_data`) construction: `makeGraphData` and the
+ * DIGCOLA edge-direction pass (`dfsCycle`, `acyclic`) it ends with.
+ *
+ * @see lib/neatogen/neatoinit.c
+ */
+import type { Graph } from '../../model/graph.js';
+import type { Node } from '../../model/node.js';
+import type { DirectedVtxData } from './opt-arrangement.js';
+/** Any edge carries a len attr (C: agattr_text(g, AGEDGE, "len")). */
+export declare function graphHasLen(g: Graph): boolean;
+/** The visit state C keeps in `ND_mark` / `ND_onstack`. */
+interface DfsState {
+    readonly mode: number;
+    readonly mark: Uint8Array;
+    readonly onstack: Uint8Array;
+}
+/**
+ * dfs for breaking cycles in vtxdata. C recurses; the recursion is replaced by
+ * an explicit stack of (vertex, next edge slot) frames, which visits in the
+ * same order but cannot overflow the JS stack on a long path.
+ * @see lib/neatogen/neatoinit.c:dfsCycle
+ */
+export declare function dfsCycle(graph: DirectedVtxData[], start: number, st: DfsState): void;
+/**
+ * do a dfs of the vtx_data, looking for cycles, reversing edges. C keeps the
+ * visit state in `ND_mark`/`ND_onstack`; it is local to this pass here.
+ * @see lib/neatogen/neatoinit.c:acyclic
+ */
+export declare function acyclic(graph: DirectedVtxData[], nv: number, mode: number): void;
+/**
+ * C makeGraphData's vtx_data: per node out-edges then in-edges (agfstedge order), self at
+ * index 0, duplicate neighbours merged (len keeps the max). ewgts: lens (default 1.0) if any
+ * len attr, else 1.0 under haveDir (hier/ipsep), else absent (C NULL). Under haveDir `edists`
+ * holds the direction of each first-seen edge (-1 tail, +1 head, 0 for dir=none) and the
+ * graph is then made acyclic. eweights (haveWt) are not built: nothing on a supported path
+ * reads them.
+ * @see lib/neatogen/neatoinit.c:makeGraphData
+ * @see lib/neatogen/stuff.c:setEdgeLen
+ */
+export declare function makeGraphDataC(g: Graph, nodeList: Node[], haveLen: boolean, haveDir: boolean, mode?: number): DirectedVtxData[];
+export {};
+//# sourceMappingURL=make-graph-data.d.ts.map

package/dist/layout/neato/make-graph-data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"make-graph-data.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/make-graph-data.ts"],"names":[],"mappings":"AACA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAY5D,sEAAsE;AACtE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAK7C;AAWD,2DAA2D;AAC3D,UAAU,QAAQ;IAChB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC;CAC9B;AAkBD;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,GAAG,IAAI,CAwBpF;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAMhF;AAuCD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAE,MAAW,GAChF,eAAe,EAAE,CAQnB"}

package/dist/layout/neato/matrix-ops.d.ts

@@ -1,3 +1,10 @@
+import type { VtxData } from './dijkstra.js';
+/**
+ * fmadd: round(a * b + c) once. `common/fma` splits operands (Dekker), which
+ * turns an infinite operand into NaN where the hardware fmadd gives inf, so
+ * non-finite products and addends take the plain expression (exact then).
+ */
+export declare function fma(a: number, b: number, c: number): number;
 /** Subtract the mean (double precision). @see matrix_ops.c:orthog1 */
 export declare function orthog1(n: number, vec: Float64Array): void;
 /** Subtract the mean (float precision). @see matrix_ops.c:orthog1f */
@@ -25,4 +32,43 @@ export declare function invertVec(n: number, vec: Float32Array): void;
 export declare function sqrtVecF(n: number, source: Float32Array, target: Float32Array): void;
 /** vec = 1/sqrtf(vec) where vec > 0. @see matrix_ops.c:invert_sqrt_vec */
 export declare function invertSqrtVec(n: number, vec: Float32Array): void;
+/** Block width of a call site compiled as a scalar loop (all fmadd). */
+export declare const BLOCK_NONE = 1;
+/**
+ * Sum of `a[i] * b[i]` over `n` terms, the first `block * floor(n / block)`
+ * unfused and the rest fused, as the oracle's inlined copy of the site.
+ * @see lib/neatogen/matrix_ops.c:vectors_inner_product
+ */
+export declare function innerProduct(n: number, v1: Float64Array, v2: Float64Array, block: number): number;
+/** vec1[0..end] += fac * vec2[0..end] (fmadd). @see lib/neatogen/matrix_ops.c:scadd */
+export declare function scadd(vec1: Float64Array, end: number, fac: number, vec2: Float64Array): void;
+/** 2-norm of vec[0..end]. @see lib/neatogen/matrix_ops.c:norm */
+export declare function norm(vec: Float64Array, end: number, block: number): number;
+/** result = vector * alpha (aliasing allowed). @see lib/neatogen/matrix_ops.c:vectors_scalar_mult */
+export declare function vectorsScalarMult(n: number, vector: Float64Array, alpha: number, result: Float64Array): void;
+/** dest = source. @see lib/neatogen/matrix_ops.c:copy_vector */
+export declare function copyVector(n: number, source: Float64Array, dest: Float64Array): void;
+/** result = v1 + v2 (aliasing allowed). @see lib/neatogen/matrix_ops.c:vectors_addition */
+export declare function vectorsAddition(n: number, v1: Float64Array, v2: Float64Array, result: Float64Array): void;
+/** result = v1 - v2 (aliasing allowed). @see lib/neatogen/matrix_ops.c:vectors_subtraction */
+export declare function vectorsSubtraction(n: number, v1: Float64Array, v2: Float64Array, result: Float64Array): void;
+/** Largest |vector[i]| (start -1e50). @see lib/neatogen/matrix_ops.c:max_abs */
+export declare function maxAbs(n: number, vector: Float64Array): number;
+/**
+ * result = matrix * vector for an n x n float** matrix and double vector;
+ * each row's reduction is blocked as the call site was compiled.
+ * @see lib/neatogen/matrix_ops.c:right_mult_with_vector_f
+ */
+export declare function rightMultWithVectorF(matrix: readonly Float32Array[], n: number, vector: Float64Array, result: Float64Array, block: number): void;
+/**
+ * result = matrix * vector over the sparse `vtx_data` rows (`ewgts` weights).
+ * The loop is scalar in the oracle: every term is an fmadd.
+ * @see lib/neatogen/matrix_ops.c:right_mult_with_vector
+ */
+export declare function rightMultWithVector(matrix: VtxData[], n: number, vector: Float64Array, result: Float64Array): void;
+/**
+ * `vec[i] = rand() % RANGE`, then orthogonalize against 1.
+ * @see lib/neatogen/matrix_ops.c:init_vec_orth1
+ */
+export declare function initVecOrth1(n: number, vec: Float64Array): void;
 //# sourceMappingURL=matrix-ops.d.ts.map

package/dist/layout/neato/matrix-ops.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrix-ops.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/matrix-ops.ts"],"names":[],"mappings":"AAcA,sEAAsE;AACtE,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAK1D;AAED,sEAAsE;AACtE,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAK3D;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GACrE,IAAI,CAYN;AAED,+DAA+D;AAC/D,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GAClE,IAAI,CAEN;AAED,+EAA+E;AAC/E,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,GAC3D,IAAI,CAGN;AAED,8FAA8F;AAC9F,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,GAAG,MAAM,CAI1F;AAED,qCAAqC;AACrC,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAEjF;AAED,iCAAiC;AACjC,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,MAAM,CAO5D;AAED,mCAAmC;AACnC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAE5D;AAED,mCAAmC;AACnC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAI5D;AAED,4EAA4E;AAC5E,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GAAG,IAAI,CAIpF;AAED,0EAA0E;AAC1E,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAIhE"}
+{"version":3,"file":"matrix-ops.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/matrix-ops.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAI7C;;;;GAIG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAG3D;AAED,sEAAsE;AACtE,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAK1D;AAED,sEAAsE;AACtE,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAK3D;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GACrE,IAAI,CAYN;AAED,+DAA+D;AAC/D,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GAClE,IAAI,CAEN;AAED,+EAA+E;AAC/E,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,GAC3D,IAAI,CAGN;AAED,8FAA8F;AAC9F,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,GAAG,MAAM,CAI1F;AAED,qCAAqC;AACrC,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAEjF;AAED,iCAAiC;AACjC,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,MAAM,CAO5D;AAED,mCAAmC;AACnC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAE5D;AAED,mCAAmC;AACnC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAI5D;AAED,4EAA4E;AAC5E,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GAAG,IAAI,CAIpF;AAED,0EAA0E;AAC1E,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAIhE;AAeD,wEAAwE;AACxE,eAAO,MAAM,UAAU,IAAI,CAAC;AAE5B;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAOjG;AAED,uFAAuF;AACvF,wBAAgB,KAAK,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAE5F;AAED,iEAAiE;AACjE,wBAAgB,IAAI,CAAC,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE1E;AAED,qGAAqG;AACrG,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,GACnE,IAAI,CAEN;AAED,gEAAgE;AAChE,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAEpF;AAED,2FAA2F;AAC3F,wBAAgB,eAAe,CAC7B,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GAClE,IAAI,CAEN;AAED,8FAA8F;AAC9F,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GAClE,IAAI,CAEN;AAED,gFAAgF;AAChF,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,GAAG,MAAM,CAO9D;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,SAAS,YAAY,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EACtF,KAAK,EAAE,MAAM,GACZ,IAAI,CAUN;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,GACvE,IAAI,CAON;AAKD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAG/D"}

package/dist/layout/neato/opt-arrangement.d.ts

@@ -0,0 +1,20 @@
+import type { VtxData } from './dijkstra.js';
+/** `vtx_data` with the `DIGCOLA` `edists` field (`int8_t *`, `NULL` when absent). */
+export interface DirectedVtxData extends VtxData {
+    edists?: ArrayLike<number> | null;
+}
+/**
+ * Build `b` with `-b[i] = sum_j -w_ij * delta_ij` (the balance vector; the
+ * matrix is -L, so `-Lx = -b` is solved). `b` is left untouched when node 0 has
+ * no `edists` (C: `continue`, `b` stays calloc-zero).
+ * @see lib/neatogen/opt_arrangement.c:construct_b
+ */
+export declare function constructB(graph: DirectedVtxData[], n: number, b: Float64Array): void;
+/**
+ * Find the y coordinates of a directed graph by solving `L*y = b`. Starts from
+ * a `rand()`-seeded vector, so the result depends on the libc rand stream
+ * position (`common/crand`). Returns 1 when conjugate gradient fails.
+ * @see lib/neatogen/opt_arrangement.c:compute_y_coords
+ */
+export declare function computeYCoords(graph: VtxData[], n: number, yCoords: Float64Array, maxIterations: number): 0 | 1;
+//# sourceMappingURL=opt-arrangement.d.ts.map

package/dist/layout/neato/opt-arrangement.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"opt-arrangement.d.ts","sourceRoot":"","sources":["../../../src/layout/neato/opt-arrangement.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAG7C,qFAAqF;AACrF,MAAM,WAAW,eAAgB,SAAQ,OAAO;IAC9C,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;CACnC;AAKD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,GAAG,IAAI,CAWrF;AAmBD;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,OAAO,EAAE,EAChB,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,YAAY,EACrB,aAAa,EAAE,MAAM,GACpB,CAAC,GAAG,CAAC,CAgBP"}