@graphty/webgpu-graph-algorithms 0.6.3 → 0.6.4

package/dist/src/primitives/core-shape.js.map

@@ -1 +1 @@
-{"version":3,"file":"core-shape.js","sourceRoot":"","sources":["../../../src/primitives/core-shape.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAIhD,iJAAiJ;AACjJ,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC;AAQjC;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,IAAiB;IAC3C,MAAM,EAAE,IAAI,EAAE,GAA4C,IAAI,CAAC,QAAQ,CAAC;IACxE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,OAAO,IAAI,CAAC,IAAI,2BAA2B,EAAE;YAC1F,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,QAAQ,EAAE,8DAA8D;SAC3E,CAAC,CAAC;IACP,CAAC;IACD,MAAM,EAAE,GAAkC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC;IACtE,MAAM,SAAS,GACX,EAAE,KAAK,SAAS;QAChB,EAAE,CAAC,MAAM,KAAK,CAAC;QACf,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QACX,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,OAAO,IAAI,CAAC,IAAI,+EAA+E,EAC/F;YACI,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,QAAQ,EAAE,8BAA8B,IAAI,CAAC,IAAI,GAAG,CAAC,aAAa;SACrE,CACJ,CAAC;IACN,CAAC;IACD,MAAM,cAAc,GAAsD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9G,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAiB,EAAE,SAAiB;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,GAAG,SAAS,yBAAyB,KAAK,wBAAwB,EAClE;YACI,QAAQ,EAAE,aAAa;YACvB,KAAK,EAAE,KAAK;YACZ,QAAQ,EAAE,0BAA0B;SACvC,CACJ,CAAC;IACN,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAiB;IACxC,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,IAAiB,EAAE,IAAwC,EAAE,CAAY;IACnG,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACtD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,oDAAoD,IAAI,EAAE,EAAE;YACzG,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,IAAI;YACX,QAAQ,EAAE,+CAA+C;SAC5D,CAAC,CAAC;IACP,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AAChF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAiB,EAAE,SAAiB;IAClE,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QACpD,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,GAAG,SAAS,+CAA+C,EAAE;YACrG,OAAO,EAAE,GAAG,SAAS,WAAW;SACnC,CAAC,CAAC;IACP,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,IAAiB,EAAE,QAAgB,EAAE,KAAa,EAAE,SAAiB;IACjG,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,gBAAgB,CACtB,aAAa,EACb,GAAG,SAAS,4CAA4C,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,oBAAoB,SAAS,8BAA8B,EAC5I,EAAE,MAAM,EAAE,CAAC,GAAG,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,CAC/D,CAAC;IACN,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,UAAU,CAAC,CAAc,EAAE,QAAgB;IACvD,MAAM,EAAE,MAAM,EAAE,GAA8C,CAAC,CAAC,QAAQ,CAAC;IACzE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,6BAA6B,EAAE;YACzF,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,CAAC,CAAC,IAAI;YACb,QAAQ,EAAE,wCAAwC;SACrD,CAAC,CAAC;IACP,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC;IACzC,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,IAAI,CAAC;IAC3C,MAAM,KAAK,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACpD,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;QACrB,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,OAAO,CAAC,CAAC,IAAI,eAAe,KAAK,sCAAsC,QAAQ,EAAE,EACjF;YACI,QAAQ,EAAE,UAAU;YACpB,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,KAAK;SAClB,CACJ,CAAC;IACN,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACjB,MAAM,EAAE,CAAC,CAAC;QACV,IAAI,EAAE,UAAmB;QACzB,MAAM;QACN,MAAM;QACN,OAAO;QACP,SAAS,EAAE,IAAI;QACf,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,IAAI;QACb,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,OAAO,KAAK,IAAI;KAC/B,CAAC,CAAC;AACP,CAAC"}
+{"version":3,"file":"core-shape.js","sourceRoot":"","sources":["../../../src/primitives/core-shape.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAIhD,iJAAiJ;AACjJ,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC;AAQjC;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,IAAiB;IAC3C,MAAM,EAAE,IAAI,EAAE,GAA4C,IAAI,CAAC,QAAQ,CAAC;IACxE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,OAAO,IAAI,CAAC,IAAI,2BAA2B,EAAE;YAC1F,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,QAAQ,EAAE,8DAA8D;SAC3E,CAAC,CAAC;IACP,CAAC;IACD,MAAM,EAAE,GAAkC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC;IACtE,MAAM,SAAS,GACX,EAAE,KAAK,SAAS;QAChB,EAAE,CAAC,MAAM,KAAK,CAAC;QACf,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QACX,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,OAAO,IAAI,CAAC,IAAI,+EAA+E,EAC/F;YACI,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,QAAQ,EAAE,8BAA8B,IAAI,CAAC,IAAI,GAAG,CAAC,aAAa;SACrE,CACJ,CAAC;IACN,CAAC;IACD,MAAM,cAAc,GAAsD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9G,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAiB,EAAE,SAAiB;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,GAAG,SAAS,yBAAyB,KAAK,wBAAwB,EAClE;YACI,QAAQ,EAAE,aAAa;YACvB,KAAK,EAAE,KAAK;YACZ,QAAQ,EAAE,0BAA0B;SACvC,CACJ,CAAC;IACN,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAiB;IACxC,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,IAAiB,EAAE,IAAwC,EAAE,CAAY;IACnG,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACtD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,oDAAoD,IAAI,EAAE,EAAE;YACzG,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,IAAI;YACX,QAAQ,EAAE,+CAA+C;SAC5D,CAAC,CAAC;IACP,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AAChF,CAAC;AASD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,WAAW,CAAC,IAAiB;IACzC,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACpC,OAAO,EAAE,CAAC,CAAC,KAAK;QAChB,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;QACrD,IAAI,EAAE;YACF,GAAG,IAAI;YACP,MAAM,EAAE,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YACxC,OAAO,EAAE,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;SAC5E;KACJ,CAAC,CAAC,CAAC;AACR,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAiB,EAAE,SAAiB;IAClE,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QACpD,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,GAAG,SAAS,+CAA+C,EAAE;YACrG,OAAO,EAAE,GAAG,SAAS,WAAW;SACnC,CAAC,CAAC;IACP,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,IAAiB,EAAE,QAAgB,EAAE,KAAa,EAAE,SAAiB;IACjG,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,gBAAgB,CACtB,aAAa,EACb,GAAG,SAAS,4CAA4C,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,oBAAoB,SAAS,8BAA8B,EAC5I,EAAE,MAAM,EAAE,CAAC,GAAG,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,CAC/D,CAAC;IACN,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,UAAU,CAAC,CAAc,EAAE,QAAgB;IACvD,MAAM,EAAE,MAAM,EAAE,GAA8C,CAAC,CAAC,QAAQ,CAAC;IACzE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC,IAAI,6BAA6B,EAAE;YACzF,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,CAAC,CAAC,IAAI;YACb,QAAQ,EAAE,wCAAwC;SACrD,CAAC,CAAC;IACP,CAAC;IACD,+GAA+G;IAC/G,iGAAiG;IACjG,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC1G,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC;IAC9G,MAAM,KAAK,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACpD,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;QACrB,MAAM,IAAI,gBAAgB,CACtB,oBAAoB,EACpB,OAAO,CAAC,CAAC,IAAI,eAAe,KAAK,sCAAsC,QAAQ,EAAE,EACjF;YACI,QAAQ,EAAE,UAAU;YACpB,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,KAAK;SAClB,CACJ,CAAC;IACN,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACjB,MAAM,EAAE,CAAC,CAAC;QACV,IAAI,EAAE,UAAmB;QACzB,MAAM;QACN,MAAM;QACN,OAAO;QACP,SAAS,EAAE,IAAI;QACf,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,IAAI;QACb,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,OAAO,KAAK,IAAI;KAC/B,CAAC,CAAC;AACP,CAAC"}

package/dist/src/primitives/frontier.d.ts

@@ -0,0 +1,156 @@
+/**
+ * The `Frontier` of design 6 row 7 and the device-side dispatch selector of design 5.4 (P8-T4; the P8 plan's PD-1,
+ * PD-3, PD-8, PD-23, DEP-P8-A, DEP-P8-C). A traversal's per-level state is two n-slot vertex queues, ONE 24-word
+ * counters block (every counter of the phase is a word of it: a four-byte word is never a legal storage-binding
+ * offset, and the selector must reach every count it acts on through one binding), the indirect args buffer of
+ * `MAX_LEVELS_PER_SUBMIT x FRONTIER_CANDIDATES` 16-byte slots, and the edge queue. The host never reads a counter
+ * inside a submit: `frontier-finalize`, one lane, runs at the START of every level (role 0: rotates
+ * `nextFrontierCount` into `frontierCount`, advances `level`, decides `done`, writes this level's slots) and again once
+ * the edge queue is filled (role 1: clamps `edgeCount`, sizes the contract slot, or on an overflow --
+ * `edgeCountUnclamped > edgeCapacity` -- sizes the fused-retry slot instead, PD-23), and the kernels that follow
+ * dispatch indirectly from those slots. The host records up to `MAX_LEVELS_PER_SUBMIT` levels per submit and reads
+ * `done` (four bytes) once per submit; a boundary that finds `done` set zeroes its slots and moves no counter, so the
+ * recorded levels past the end are no-ops and the counters freeze at the finishing boundary's values.
+ *
+ * The seed: `frontierCount` is NEVER seeded, because the first boundary rotates it out unread. A BFS driver calls
+ * `reset(queue, source, { nextFrontierCount: 1, level: U32_MAX })`: the first boundary rotates the 1 in, adds it into
+ * `visitedCount`, and wraps `level` to 0, so the level-0 expansion claims the source's neighbours at `level + 1 == 1`.
+ * `reset` is a queue write, ordered before the submit that follows, and it puts the source on side 0.
+ *
+ * Every buffer comes from the caller's ONE lease (`scope.scratch`, `scope.indirect`) so the algorithm's dispose()
+ * releases them together (design 4.4). The two vertex queues are two BUFFERS, never two ranges of one: `Kernel.bind`
+ * rejects one buffer bound read-only and read-write in one dispatch even for disjoint ranges. `src/primitives/**`
+ * never imports `src/context.ts`.
+ */
+import { type Binding } from "../types/memory.js";
+import { type ReduceScope } from "./reduce.js";
+/** The seven indirect slots of one level (`FRONTIER_CANDIDATES`), by the kernel that dispatches from each. */
+export declare const SLOT: Readonly<{
+    expand: 0;
+    contract: 1;
+    fused: 2;
+    fillBits: 3;
+    bitset: 4;
+    bottomUp: 5;
+    fusedRetry: 6;
+}>;
+/** The words of the counters block (`FRONTIER_COUNTERS`), by index: byte offset 4 x word; no driver types a number. */
+export declare const W: Readonly<{
+    frontierCount: 0;
+    nextFrontierCount: 1;
+    frontierDegreeSum: 2;
+    prevFrontierCount: 3;
+    prevDegreeSum: 4;
+    unvisitedCount: 5;
+    unvisitedDegreeSum: 6;
+    unvisitedListLen: 7;
+    edgeCount: 8;
+    edgeCountUnclamped: 9;
+    overflowLevels: 10;
+    level: 11;
+    visitedCount: 12;
+    switches: 13;
+    direction: 14;
+    done: 15;
+    arcsScanned: 16;
+    fusedLevels: 17;
+    twoPhaseLevels: 18;
+    bottomUpLevels: 19;
+    farCount: 20;
+    nextFarCount: 21;
+    thresholdBits: 22;
+    deltaBits: 23;
+    path: 24;
+}>;
+/** The words a `reset` seeds (every other word is zeroed). */
+export type FrontierSeed = Readonly<Partial<Record<keyof typeof W, number>>>;
+/** A ReduceScope that can also lease an INDIRECT buffer (the args of the frontier); `algorithmScope` is one. */
+export interface FrontierScope extends ReduceScope {
+    /** A STORAGE | INDIRECT | COPY_DST | COPY_SRC buffer of the scope's lease. */
+    indirect(byteLength: number, label: string): GPUBuffer;
+}
+/** The `FrontierParams` fields a caller passes to `recordFinalize`; the planner fills `role`, `slotBase`, `wg`, `edgeCapacity` and `n` itself. A missing field is written as 0. */
+export type FrontierFinalizeFields = Readonly<Partial<Record<"alpha" | "beta" | "fusedMax" | "maxDepth" | "mode" | "cutoffBits" | "arcBase" | "arcEnd" | "predKind" | "bitsBase" | "source" | "stride" | "firstOfSubmit" | "iteration", number>>>;
+/** The frontier queue of design 6 row 7: two vertex queues, the counters block, the args buffer and the edge queue, all leased by the caller's scope. */
+export declare class Frontier {
+    /** The two n-slot u32 vertex queues (`vertices[side]` is the input of the current level). */
+    readonly vertices: readonly [Binding, Binding];
+    /** The `FrontierCounters` block, 96 B, bound by every kernel as `array<atomic<u32>>`. */
+    readonly counters: Binding;
+    /** The indirect args, `MAX_LEVELS_PER_SUBMIT x FRONTIER_CANDIDATES` 16-byte slots (usage INDIRECT | STORAGE | COPY_DST | COPY_SRC). */
+    readonly args: Binding;
+    /** The edge queue: `edgeCapacity` entries of u32 (the target vertex of an arc). */
+    readonly edgeQueue: Binding;
+    /** How many entries the edge queue holds; role 1 clamps `edgeCount` to it and detects an overflow above it. */
+    readonly edgeCapacity: number;
+    /** The vertex count (a `reset` source is below it). */
+    readonly n: number;
+    private sideIndex;
+    /**
+     * Wraps the leased buffers; use prepareFrontier().
+     * @param vertices - the two vertex queues
+     * @param counters - the counters block
+     * @param args - the args buffer
+     * @param edgeQueue - the edge queue
+     * @param edgeCapacity - the edge queue's entry count
+     * @param n - the vertex count
+     */
+    constructor(vertices: readonly [Binding, Binding], counters: Binding, args: Binding, edgeQueue: Binding, edgeCapacity: number, n: number);
+    /**
+     * Which vertex queue is the input of the current level (a host-side index between two cached bind-group sets).
+     * @returns 0 or 1
+     */
+    get side(): 0 | 1;
+    /**
+     * The vertex queue the current level expands from.
+     * @returns `vertices[side]`
+     */
+    get input(): Binding;
+    /**
+     * The vertex queue the current level's claims append to.
+     * @returns `vertices[1 - side]`
+     */
+    get output(): Binding;
+    /** Flips the two vertex queues; the counts rotate inside the block, so nothing else moves. */
+    swap(): void;
+    /**
+     * Seeds a traversal: one `queue.writeBuffer` of the whole 96-byte block (zero except the caller's words) and one of
+     * `vertices[0][0] = source`, both ordered before the submit that follows; the source is on side 0 afterwards.
+     * `frontierCount` is not a word to seed: the first boundary rotates word 1 into it (the BFS seed is
+     * `{ nextFrontierCount: 1, level: U32_MAX }`). A source outside `[0, n)`, an unknown word or a value that is not a
+     * u32 is E_INVALID_ARGUMENT before anything is written.
+     * @param queue - the device queue
+     * @param source - the source vertex
+     * @param seed - the words to seed
+     */
+    reset(queue: GPUQueue, source: number, seed: FrontierSeed): void;
+}
+/** A prepared frontier (design 6 row 7): the leased queue and the recorded selector dispatches. */
+export interface FrontierPlanner {
+    /** The queue the planner sizes the slots of. */
+    readonly frontier: Frontier;
+    /**
+     * Records one `frontier-finalize` dispatch (one workgroup) in `role` for `level` of the current submit: one
+     * `FrontierParams` record with `slotBase = level x FRONTIER_CANDIDATES`, `wg`, `edgeCapacity` and `n` filled by the
+     * planner and every other field from `fields`. A level outside `[0, MAX_LEVELS_PER_SUBMIT)` or a role outside
+     * `[0, 3]` is E_INVALID_ARGUMENT before anything is recorded.
+     * @param pass - the compute pass
+     * @param role - 0 the level boundary, 1 the edge-queue role (2 and 3 are P8-T9's)
+     * @param level - the level inside the submit
+     * @param fields - the tuning and window words
+     */
+    recordFinalize(pass: GPUComputePassEncoder, role: number, level: number, fields: FrontierFinalizeFields): void;
+}
+/**
+ * Leases the frontier's buffers from the scope and compiles the selector so `recordFinalize` is synchronous. The
+ * edge capacity defaults to `max(1, min(arcCount, floor(maxStorageBufferBindingSize / 4)))` (never a zero-length
+ * buffer: the one-node graph has no arcs); a test passes a small one to force the overflow path. The planner lives
+ * exactly as long as the scope: never use it after the scope's dispose().
+ * @param scope - the caller's scope (device, caps, cache, scratch, indirect, params)
+ * @param n - the vertex count
+ * @param arcCount - the arc count (the natural edge-queue size)
+ * @param edgeCapacity - the edge queue's entry count, when the caller chooses it (an integer >= 1)
+ * @returns the planner
+ */
+export declare function prepareFrontier(scope: FrontierScope, n: number, arcCount: number, edgeCapacity?: number): Promise<FrontierPlanner>;
+//# sourceMappingURL=frontier.d.ts.map

package/dist/src/primitives/frontier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"frontier.d.ts","sourceRoot":"","sources":["../../../src/primitives/frontier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAOH,OAAO,EAAE,KAAK,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C,8GAA8G;AAC9G,eAAO,MAAM,IAAI,EAAE,QAAQ,CAAC;IACxB,MAAM,EAAE,CAAC,CAAC;IACV,QAAQ,EAAE,CAAC,CAAC;IACZ,KAAK,EAAE,CAAC,CAAC;IACT,QAAQ,EAAE,CAAC,CAAC;IACZ,MAAM,EAAE,CAAC,CAAC;IACV,QAAQ,EAAE,CAAC,CAAC;IACZ,UAAU,EAAE,CAAC,CAAC;CACjB,CAA2G,CAAC;AAE7G,uHAAuH;AACvH,eAAO,MAAM,CAAC,EAAE,QAAQ,CAAC;IACrB,aAAa,EAAE,CAAC,CAAC;IACjB,iBAAiB,EAAE,CAAC,CAAC;IACrB,iBAAiB,EAAE,CAAC,CAAC;IACrB,iBAAiB,EAAE,CAAC,CAAC;IACrB,aAAa,EAAE,CAAC,CAAC;IACjB,cAAc,EAAE,CAAC,CAAC;IAClB,kBAAkB,EAAE,CAAC,CAAC;IACtB,gBAAgB,EAAE,CAAC,CAAC;IACpB,SAAS,EAAE,CAAC,CAAC;IACb,kBAAkB,EAAE,CAAC,CAAC;IACtB,cAAc,EAAE,EAAE,CAAC;IACnB,KAAK,EAAE,EAAE,CAAC;IACV,YAAY,EAAE,EAAE,CAAC;IACjB,QAAQ,EAAE,EAAE,CAAC;IACb,SAAS,EAAE,EAAE,CAAC;IACd,IAAI,EAAE,EAAE,CAAC;IACT,WAAW,EAAE,EAAE,CAAC;IAChB,WAAW,EAAE,EAAE,CAAC;IAChB,cAAc,EAAE,EAAE,CAAC;IACnB,cAAc,EAAE,EAAE,CAAC;IACnB,QAAQ,EAAE,EAAE,CAAC;IACb,YAAY,EAAE,EAAE,CAAC;IACjB,aAAa,EAAE,EAAE,CAAC;IAClB,SAAS,EAAE,EAAE,CAAC;IACd,IAAI,EAAE,EAAE,CAAC;CACZ,CA0BC,CAAC;AAEH,8DAA8D;AAC9D,MAAM,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AAE7E,gHAAgH;AAChH,MAAM,WAAW,aAAc,SAAQ,WAAW;IAC9C,8EAA8E;IAC9E,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;CAC1D;AAED,mLAAmL;AACnL,MAAM,MAAM,sBAAsB,GAAG,QAAQ,CACzC,OAAO,CACH,MAAM,CACA,OAAO,GACP,MAAM,GACN,UAAU,GACV,UAAU,GACV,MAAM,GACN,YAAY,GACZ,SAAS,GACT,QAAQ,GACR,UAAU,GACV,UAAU,GACV,QAAQ,GACR,QAAQ,GACR,eAAe,GACf,WAAW,EACb,MAAM,CACT,CACJ,CACJ,CAAC;AAoCF,yJAAyJ;AACzJ,qBAAa,QAAQ;IACjB,6FAA6F;IAC7F,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC/C,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,uIAAuI;IACvI,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,mFAAmF;IACnF,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,+GAA+G;IAC/G,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,uDAAuD;IACvD,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,SAAS,CAAY;IAE7B;;;;;;;;OAQG;gBAEC,QAAQ,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,EACrC,QAAQ,EAAE,OAAO,EACjB,IAAI,EAAE,OAAO,EACb,SAAS,EAAE,OAAO,EAClB,YAAY,EAAE,MAAM,EACpB,CAAC,EAAE,MAAM;IAUb;;;OAGG;IACH,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAEhB;IAED;;;OAGG;IACH,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED;;;OAGG;IACH,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED,8FAA8F;IAC9F,IAAI,IAAI,IAAI;IAIZ;;;;;;;;;OASG;IACH,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI;CAcnE;AAED,mGAAmG;AACnG,MAAM,WAAW,eAAe;IAC5B,gDAAgD;IAChD,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B;;;;;;;;;OASG;IACH,cAAc,CAAC,IAAI,EAAE,qBAAqB,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,sBAAsB,GAAG,IAAI,CAAC;CAClH;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,eAAe,CACjC,KAAK,EAAE,aAAa,EACpB,CAAC,EAAE,MAAM,EACT,QAAQ,EAAE,MAAM,EAChB,YAAY,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,eAAe,CAAC,CAuC1B"}

package/dist/src/primitives/frontier.js

@@ -0,0 +1,259 @@
+/**
+ * The `Frontier` of design 6 row 7 and the device-side dispatch selector of design 5.4 (P8-T4; the P8 plan's PD-1,
+ * PD-3, PD-8, PD-23, DEP-P8-A, DEP-P8-C). A traversal's per-level state is two n-slot vertex queues, ONE 24-word
+ * counters block (every counter of the phase is a word of it: a four-byte word is never a legal storage-binding
+ * offset, and the selector must reach every count it acts on through one binding), the indirect args buffer of
+ * `MAX_LEVELS_PER_SUBMIT x FRONTIER_CANDIDATES` 16-byte slots, and the edge queue. The host never reads a counter
+ * inside a submit: `frontier-finalize`, one lane, runs at the START of every level (role 0: rotates
+ * `nextFrontierCount` into `frontierCount`, advances `level`, decides `done`, writes this level's slots) and again once
+ * the edge queue is filled (role 1: clamps `edgeCount`, sizes the contract slot, or on an overflow --
+ * `edgeCountUnclamped > edgeCapacity` -- sizes the fused-retry slot instead, PD-23), and the kernels that follow
+ * dispatch indirectly from those slots. The host records up to `MAX_LEVELS_PER_SUBMIT` levels per submit and reads
+ * `done` (four bytes) once per submit; a boundary that finds `done` set zeroes its slots and moves no counter, so the
+ * recorded levels past the end are no-ops and the counters freeze at the finishing boundary's values.
+ *
+ * The seed: `frontierCount` is NEVER seeded, because the first boundary rotates it out unread. A BFS driver calls
+ * `reset(queue, source, { nextFrontierCount: 1, level: U32_MAX })`: the first boundary rotates the 1 in, adds it into
+ * `visitedCount`, and wraps `level` to 0, so the level-0 expansion claims the source's neighbours at `level + 1 == 1`.
+ * `reset` is a queue write, ordered before the submit that follows, and it puts the source on side 0.
+ *
+ * Every buffer comes from the caller's ONE lease (`scope.scratch`, `scope.indirect`) so the algorithm's dispose()
+ * releases them together (design 4.4). The two vertex queues are two BUFFERS, never two ranges of one: `Kernel.bind`
+ * rejects one buffer bound read-only and read-write in one dispatch even for disjoint ranges. `src/primitives/**`
+ * never imports `src/context.ts`.
+ */
+import { FRONTIER_CANDIDATES, MAX_LEVELS_PER_SUBMIT, U32_MAX } from "../constants.js";
+import { WebGpuGraphError } from "../errors.js";
+import { plan1d } from "../kernel/dispatch.js";
+import { INDIRECT_ARGS_STRIDE } from "../kernel/kernel.js";
+import { FRONTIER_COUNTERS, FRONTIER_PARAMS, kernelSpec } from "../kernels.js";
+/** The seven indirect slots of one level (`FRONTIER_CANDIDATES`), by the kernel that dispatches from each. */
+export const SLOT = Object.freeze({ expand: 0, contract: 1, fused: 2, fillBits: 3, bitset: 4, bottomUp: 5, fusedRetry: 6 });
+/** The words of the counters block (`FRONTIER_COUNTERS`), by index: byte offset 4 x word; no driver types a number. */
+export const W = Object.freeze({
+    frontierCount: 0,
+    nextFrontierCount: 1,
+    frontierDegreeSum: 2,
+    prevFrontierCount: 3,
+    prevDegreeSum: 4,
+    unvisitedCount: 5,
+    unvisitedDegreeSum: 6,
+    unvisitedListLen: 7,
+    edgeCount: 8,
+    edgeCountUnclamped: 9,
+    overflowLevels: 10,
+    level: 11,
+    visitedCount: 12,
+    switches: 13,
+    direction: 14,
+    done: 15,
+    arcsScanned: 16,
+    fusedLevels: 17,
+    twoPhaseLevels: 18,
+    bottomUpLevels: 19,
+    farCount: 20,
+    nextFarCount: 21,
+    thresholdBits: 22,
+    deltaBits: 23,
+    path: 24,
+});
+/**
+ * The given words of a partial record (a key spelled with an undefined value is dropped, so the block writer sees
+ * only numbers).
+ * @param words - the partial record
+ * @returns the defined entries
+ */
+function definedWords(words) {
+    const out = {};
+    for (const [name, value] of Object.entries(words)) {
+        if (value !== undefined) {
+            out[name] = value;
+        }
+    }
+    return out;
+}
+/** The largest role `frontier-finalize` knows: 0 and 1 land here (P8-T4), 2 and 3 are the SSSP piles' (P8-T9). */
+const MAX_ROLE = 3;
+/**
+ * The E_INVALID_ARGUMENT of a value that is not a non-negative integer.
+ * @param argument - the argument name
+ * @param value - the value
+ */
+function assertCount(argument, value) {
+    if (!Number.isSafeInteger(value) || value < 0) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", `frontier: ${argument} must be a non-negative integer`, {
+            argument,
+            value,
+            expected: "a non-negative integer",
+        });
+    }
+}
+/** The frontier queue of design 6 row 7: two vertex queues, the counters block, the args buffer and the edge queue, all leased by the caller's scope. */
+export class Frontier {
+    /**
+     * Wraps the leased buffers; use prepareFrontier().
+     * @param vertices - the two vertex queues
+     * @param counters - the counters block
+     * @param args - the args buffer
+     * @param edgeQueue - the edge queue
+     * @param edgeCapacity - the edge queue's entry count
+     * @param n - the vertex count
+     */
+    constructor(vertices, counters, args, edgeQueue, edgeCapacity, n) {
+        this.sideIndex = 0;
+        this.vertices = vertices;
+        this.counters = counters;
+        this.args = args;
+        this.edgeQueue = edgeQueue;
+        this.edgeCapacity = edgeCapacity;
+        this.n = n;
+    }
+    /**
+     * Which vertex queue is the input of the current level (a host-side index between two cached bind-group sets).
+     * @returns 0 or 1
+     */
+    get side() {
+        return this.sideIndex;
+    }
+    /**
+     * The vertex queue the current level expands from.
+     * @returns `vertices[side]`
+     */
+    get input() {
+        return this.sideIndex === 0 ? this.vertices[0] : this.vertices[1];
+    }
+    /**
+     * The vertex queue the current level's claims append to.
+     * @returns `vertices[1 - side]`
+     */
+    get output() {
+        return this.sideIndex === 0 ? this.vertices[1] : this.vertices[0];
+    }
+    /** Flips the two vertex queues; the counts rotate inside the block, so nothing else moves. */
+    swap() {
+        this.sideIndex = this.sideIndex === 0 ? 1 : 0;
+    }
+    /**
+     * Seeds a traversal: one `queue.writeBuffer` of the whole 96-byte block (zero except the caller's words) and one of
+     * `vertices[0][0] = source`, both ordered before the submit that follows; the source is on side 0 afterwards.
+     * `frontierCount` is not a word to seed: the first boundary rotates word 1 into it (the BFS seed is
+     * `{ nextFrontierCount: 1, level: U32_MAX }`). A source outside `[0, n)`, an unknown word or a value that is not a
+     * u32 is E_INVALID_ARGUMENT before anything is written.
+     * @param queue - the device queue
+     * @param source - the source vertex
+     * @param seed - the words to seed
+     */
+    reset(queue, source, seed) {
+        if (!Number.isInteger(source) || source < 0 || source >= this.n) {
+            throw new WebGpuGraphError("E_INVALID_ARGUMENT", `frontier: source ${source} is outside [0, ${this.n})`, {
+                argument: "source",
+                value: source,
+                expected: `an integer in [0, ${this.n})`,
+            });
+        }
+        const bytes = new ArrayBuffer(FRONTIER_COUNTERS.byteLength);
+        FRONTIER_COUNTERS.write(new DataView(bytes), definedWords(seed));
+        this.sideIndex = 0;
+        queue.writeBuffer(this.counters.buffer, this.counters.offset, bytes);
+        queue.writeBuffer(this.vertices[0].buffer, this.vertices[0].offset, Uint32Array.of(source));
+    }
+}
+/**
+ * Leases the frontier's buffers from the scope and compiles the selector so `recordFinalize` is synchronous. The
+ * edge capacity defaults to `max(1, min(arcCount, floor(maxStorageBufferBindingSize / 4)))` (never a zero-length
+ * buffer: the one-node graph has no arcs); a test passes a small one to force the overflow path. The planner lives
+ * exactly as long as the scope: never use it after the scope's dispose().
+ * @param scope - the caller's scope (device, caps, cache, scratch, indirect, params)
+ * @param n - the vertex count
+ * @param arcCount - the arc count (the natural edge-queue size)
+ * @param edgeCapacity - the edge queue's entry count, when the caller chooses it (an integer >= 1)
+ * @returns the planner
+ */
+export async function prepareFrontier(scope, n, arcCount, edgeCapacity) {
+    assertCount("n", n);
+    assertCount("arcCount", arcCount);
+    const capacity = edgeCapacity ?? Math.max(1, Math.min(arcCount, Math.floor(scope.caps.limits.maxStorageBufferBindingSize / 4)));
+    if (!Number.isSafeInteger(capacity) || capacity < 1 || capacity > U32_MAX) {
+        throw new WebGpuGraphError("E_INVALID_ARGUMENT", "frontier: edgeCapacity must be an integer >= 1", {
+            argument: "edgeCapacity",
+            value: capacity,
+            expected: "an integer in [1, 2^32)",
+        });
+    }
+    const kernel = await scope.pipelines.kernel(kernelSpec("frontier-finalize"));
+    const queueBytes = 4 * Math.max(1, n);
+    const argsBytes = MAX_LEVELS_PER_SUBMIT * FRONTIER_CANDIDATES * INDIRECT_ARGS_STRIDE;
+    const vertices = [
+        { buffer: scope.scratch(queueBytes, "frontier/vertices-0"), offset: 0, size: queueBytes, window: null },
+        { buffer: scope.scratch(queueBytes, "frontier/vertices-1"), offset: 0, size: queueBytes, window: null },
+    ];
+    const counters = {
+        buffer: scope.scratch(FRONTIER_COUNTERS.byteLength, "frontier/counters"),
+        offset: 0,
+        size: FRONTIER_COUNTERS.byteLength,
+        window: null,
+    };
+    const args = {
+        buffer: scope.indirect(argsBytes, "frontier/args"),
+        offset: 0,
+        size: argsBytes,
+        window: null,
+    };
+    const edgeQueue = {
+        buffer: scope.scratch(4 * capacity, "frontier/edge-queue"),
+        offset: 0,
+        size: 4 * capacity,
+        window: null,
+    };
+    const frontier = new Frontier(vertices, counters, args, edgeQueue, capacity, n);
+    return new FrontierPlannerImpl(scope, kernel, frontier);
+}
+/** The planner: the selector kernel bound once to the frontier's block and args. */
+class FrontierPlannerImpl {
+    /**
+     * Wraps the resolved kernel; use prepareFrontier().
+     * @param scope - the caller's scope
+     * @param kernel - the `frontier-finalize` kernel
+     * @param frontier - the leased queue
+     */
+    constructor(scope, kernel, frontier) {
+        this.scope = scope;
+        this.kernel = kernel;
+        this.frontier = frontier;
+    }
+    /**
+     * Records one selector dispatch (see the interface).
+     * @param pass - the compute pass
+     * @param role - the role
+     * @param level - the level inside the submit
+     * @param fields - the caller's fields
+     */
+    recordFinalize(pass, role, level, fields) {
+        if (!Number.isInteger(level) || level < 0 || level >= MAX_LEVELS_PER_SUBMIT) {
+            throw new WebGpuGraphError("E_INVALID_ARGUMENT", `frontier: level ${level} is outside the submit`, {
+                argument: "level",
+                value: level,
+                expected: `an integer in [0, ${MAX_LEVELS_PER_SUBMIT})`,
+            });
+        }
+        if (!Number.isInteger(role) || role < 0 || role > MAX_ROLE) {
+            throw new WebGpuGraphError("E_INVALID_ARGUMENT", `frontier: role ${role} is not a finalize role`, {
+                argument: "role",
+                value: role,
+                expected: `an integer in [0, ${MAX_ROLE}]`,
+            });
+        }
+        const { scope, frontier } = this;
+        const params = scope.params(FRONTIER_PARAMS, {
+            ...definedWords(fields),
+            role,
+            slotBase: level * FRONTIER_CANDIDATES,
+            wg: scope.workgroupSize,
+            edgeCapacity: frontier.edgeCapacity,
+            n: frontier.n,
+        });
+        const bound = this.kernel.bind({ counters: frontier.counters, args: frontier.args, P: params.binding });
+        this.kernel.dispatch(pass, bound, plan1d(1, scope.workgroupSize, scope.caps), [params.offset]);
+    }
+}
+//# sourceMappingURL=frontier.js.map

package/dist/src/primitives/frontier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"frontier.js","sourceRoot":"","sources":["../../../src/primitives/frontier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AACtF,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAC/C,OAAO,EAAE,oBAAoB,EAAe,MAAM,qBAAqB,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAI/E,8GAA8G;AAC9G,MAAM,CAAC,MAAM,IAAI,GAQZ,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;AAE7G,uHAAuH;AACvH,MAAM,CAAC,MAAM,CAAC,GA0BT,MAAM,CAAC,MAAM,CAAC;IACf,aAAa,EAAE,CAAC;IAChB,iBAAiB,EAAE,CAAC;IACpB,iBAAiB,EAAE,CAAC;IACpB,iBAAiB,EAAE,CAAC;IACpB,aAAa,EAAE,CAAC;IAChB,cAAc,EAAE,CAAC;IACjB,kBAAkB,EAAE,CAAC;IACrB,gBAAgB,EAAE,CAAC;IACnB,SAAS,EAAE,CAAC;IACZ,kBAAkB,EAAE,CAAC;IACrB,cAAc,EAAE,EAAE;IAClB,KAAK,EAAE,EAAE;IACT,YAAY,EAAE,EAAE;IAChB,QAAQ,EAAE,EAAE;IACZ,SAAS,EAAE,EAAE;IACb,IAAI,EAAE,EAAE;IACR,WAAW,EAAE,EAAE;IACf,WAAW,EAAE,EAAE;IACf,cAAc,EAAE,EAAE;IAClB,cAAc,EAAE,EAAE;IAClB,QAAQ,EAAE,EAAE;IACZ,YAAY,EAAE,EAAE;IAChB,aAAa,EAAE,EAAE;IACjB,SAAS,EAAE,EAAE;IACb,IAAI,EAAE,EAAE;CACX,CAAC,CAAC;AAkCH;;;;;GAKG;AACH,SAAS,YAAY,CAAC,KAAgD;IAClE,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED,kHAAkH;AAClH,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB;;;;GAIG;AACH,SAAS,WAAW,CAAC,QAAgB,EAAE,KAAa;IAChD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,aAAa,QAAQ,iCAAiC,EAAE;YACrG,QAAQ;YACR,KAAK;YACL,QAAQ,EAAE,wBAAwB;SACrC,CAAC,CAAC;IACP,CAAC;AACL,CAAC;AAED,yJAAyJ;AACzJ,MAAM,OAAO,QAAQ;IAejB;;;;;;;;OAQG;IACH,YACI,QAAqC,EACrC,QAAiB,EACjB,IAAa,EACb,SAAkB,EAClB,YAAoB,EACpB,CAAS;QAjBL,cAAS,GAAU,CAAC,CAAC;QAmBzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAI,KAAK;QACL,OAAO,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACN,OAAO,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,8FAA8F;IAC9F,IAAI;QACA,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,KAAe,EAAE,MAAc,EAAE,IAAkB;QACrD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;YAC9D,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,oBAAoB,MAAM,mBAAmB,IAAI,CAAC,CAAC,GAAG,EAAE;gBACrG,QAAQ,EAAE,QAAQ;gBAClB,KAAK,EAAE,MAAM;gBACb,QAAQ,EAAE,qBAAqB,IAAI,CAAC,CAAC,GAAG;aAC3C,CAAC,CAAC;QACP,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAC5D,iBAAiB,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACrE,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IAChG,CAAC;CACJ;AAmBD;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACjC,KAAoB,EACpB,CAAS,EACT,QAAgB,EAChB,YAAqB;IAErB,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,WAAW,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAClC,MAAM,QAAQ,GACV,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,2BAA2B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnH,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,OAAO,EAAE,CAAC;QACxE,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,gDAAgD,EAAE;YAC/F,QAAQ,EAAE,cAAc;YACxB,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,yBAAyB;SACtC,CAAC,CAAC;IACP,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAC7E,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,qBAAqB,GAAG,mBAAmB,GAAG,oBAAoB,CAAC;IACrF,MAAM,QAAQ,GAAgC;QAC1C,EAAE,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;QACvG,EAAE,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;KAC1G,CAAC;IACF,MAAM,QAAQ,GAAY;QACtB,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,UAAU,EAAE,mBAAmB,CAAC;QACxE,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,iBAAiB,CAAC,UAAU;QAClC,MAAM,EAAE,IAAI;KACf,CAAC;IACF,MAAM,IAAI,GAAY;QAClB,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,eAAe,CAAC;QAClD,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,SAAS;QACf,MAAM,EAAE,IAAI;KACf,CAAC;IACF,MAAM,SAAS,GAAY;QACvB,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,QAAQ,EAAE,qBAAqB,CAAC;QAC1D,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC,GAAG,QAAQ;QAClB,MAAM,EAAE,IAAI;KACf,CAAC;IACF,MAAM,QAAQ,GAAG,IAAI,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAChF,OAAO,IAAI,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AAC5D,CAAC;AAED,oFAAoF;AACpF,MAAM,mBAAmB;IAKrB;;;;;OAKG;IACH,YAAY,KAAoB,EAAE,MAAc,EAAE,QAAkB;QAChE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,IAA2B,EAAE,IAAY,EAAE,KAAa,EAAE,MAA8B;QACnG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,qBAAqB,EAAE,CAAC;YAC1E,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,mBAAmB,KAAK,wBAAwB,EAAE;gBAC/F,QAAQ,EAAE,OAAO;gBACjB,KAAK,EAAE,KAAK;gBACZ,QAAQ,EAAE,qBAAqB,qBAAqB,GAAG;aAC1D,CAAC,CAAC;QACP,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YACzD,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,kBAAkB,IAAI,yBAAyB,EAAE;gBAC9F,QAAQ,EAAE,MAAM;gBAChB,KAAK,EAAE,IAAI;gBACX,QAAQ,EAAE,qBAAqB,QAAQ,GAAG;aAC7C,CAAC,CAAC;QACP,CAAC;QACD,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,eAAe,EAAE;YACzC,GAAG,YAAY,CAAC,MAAM,CAAC;YACvB,IAAI;YACJ,QAAQ,EAAE,KAAK,GAAG,mBAAmB;YACrC,EAAE,EAAE,KAAK,CAAC,aAAa;YACvB,YAAY,EAAE,QAAQ,CAAC,YAAY;YACnC,CAAC,EAAE,QAAQ,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACxG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACnG,CAAC;CACJ"}

package/dist/src/types/accelerator.d.ts

@@ -4,15 +4,16 @@
  * this package's public surface is unchanged; `test/types/conformance.test-d.ts` is the cross-compile that holds
  * them honest. Types only.
  */
-import type { AlgorithmAccelerator, ApspResultLike, BellmanFordResultLike, BetweennessAcceleratorOptions, BfsResultLike, CommunityResultLike, CorenessResultLike, EdgeScoresResultLike, HitsOptionsLike, HitsResultLike, LabelResultLike, MstResultLike, PageRankResultLike, ScoresResultLike, SsspResultLike } from "@graphty/algorithms";
+import type { AlgorithmAccelerator, ApspResultLike, BellmanFordResultLike, BetweennessAcceleratorOptions, BfsOptions, BfsResultLike, CommunityResultLike, CorenessResultLike, EdgeScoresResultLike, HitsOptionsLike, HitsResultLike, LabelResultLike, MstResultLike, PageRankResultLike, ScoresResultLike, SsspOptions, SsspResultLike } from "@graphty/algorithms";
 import type { F32, F64, GraphSnapshot } from "@graphty/graph-format";
 import type { LayoutAccelerator, LayoutSimulation } from "@graphty/layout";
 import type { GpuContext } from "../context.js";
 import type { ComponentsOptions, EigenvectorOptions, GpuHitsResult, GpuLabelResult, GpuPageRankResult, GpuScoresResult, HitsOptions, KatzOptions, PageRankOptions } from "./algorithms.js";
 import type { ForceAtlas2Stats, FruchtermanReingoldStats, GpuLayoutSimulation, GpuLayoutTuning, SpringElectricalStats } from "./layout.js";
 import type { ForceAtlas2Options, FruchtermanReingoldOptions, SpringElectricalOptions } from "./options.js";
+import type { GpuBellmanFordResult, GpuBfsResult, GpuSsspResult } from "./traversal.js";
 export type { LayoutAccelerator, LayoutSimulation };
-export type { AlgorithmAccelerator, ApspResultLike, BellmanFordResultLike, BetweennessAcceleratorOptions, BfsResultLike, CommunityResultLike, CorenessResultLike, EdgeScoresResultLike, HitsOptionsLike, HitsResultLike, LabelResultLike, MstResultLike, PageRankResultLike, ScoresResultLike, SsspResultLike, };
+export type { AlgorithmAccelerator, ApspResultLike, BellmanFordResultLike, BetweennessAcceleratorOptions, BfsOptions, BfsResultLike, CommunityResultLike, CorenessResultLike, EdgeScoresResultLike, HitsOptionsLike, HitsResultLike, LabelResultLike, MstResultLike, PageRankResultLike, ScoresResultLike, SsspOptions, SsspResultLike, };
 /**
  * Spec 3.3 AcceleratorOptions, verbatim.
  * Exported: consumed by src/accelerator.ts (P3-T3); re-exported from src/index.ts at P3-T3.
@@ -31,11 +32,15 @@ export interface AcceleratorOptions {
  * The injectable object (spec 3.3): P3's forceAtlas2, release and dispose, P5's fruchtermanReingold and
  * springElectrical (the two other optional members of the real LayoutAccelerator, spec 9.3; the CPU option types in,
  * the GPU simulations out), plus P7's seven algorithm members
- * (spec 8.2, 8.3; M8b-T8), non-optional here and returning the `Gpu*Result` shapes, which satisfy the `*ResultLike`
- * mirrors (spec 9.7: `precision` is an extra field, `F32` is a `NumericVector`). `connectedComponents` and
- * `weaklyConnectedComponents` are the same algorithm (spec 3.3: WCC semantics on directed input) under both names
- * the mirror declares; their options parameter stays OPTIONAL, because the mirror declares none and an extra
- * REQUIRED parameter would stop the member satisfying it. Later phases add one member per shipped algorithm.
+ * (spec 8.2, 8.3; M8b-T8) and P8's four traversal members (spec 8.4; P8-T13 PD-16), non-optional here and returning
+ * the `Gpu*Result` shapes, which satisfy the `*ResultLike` mirrors (spec 9.7: `precision` is an extra field, `F32` is
+ * a `NumericVector`). `connectedComponents` and `weaklyConnectedComponents` are the same algorithm (spec 3.3: WCC
+ * semantics on directed input) under both names the mirror declares; their options parameter stays OPTIONAL, because
+ * the mirror declares none and an extra REQUIRED parameter would stop the member satisfying it. The four traversals
+ * take the seam's OWN option types (PD-19: `BfsOptions`, `SsspOptions` for both `sssp` and `bellmanFord`,
+ * `HitsOptionsLike` for `closenessCentrality`), so a key the CPU dispatcher forwards is exactly a key the GPU reads;
+ * `test/types/conformance.test-d.ts` holds each parameter EQUAL to the seam's, not merely assignable. Later phases add
+ * one member per shipped algorithm.
  * Exported: implemented by src/accelerator.ts (P3-T3); re-exported from src/index.ts at P3-T3.
  * @public
  */
@@ -53,6 +58,10 @@ export interface GpuAccelerator extends AlgorithmAccelerator, LayoutAccelerator
     katzCentrality(s: GraphSnapshot, options?: KatzOptions): Promise<GpuScoresResult>;
     connectedComponents(s: GraphSnapshot, options?: ComponentsOptions): Promise<GpuLabelResult>;
     weaklyConnectedComponents(s: GraphSnapshot, options?: ComponentsOptions): Promise<GpuLabelResult>;
+    breadthFirstSearch(s: GraphSnapshot, source: number, options?: BfsOptions): Promise<GpuBfsResult>;
+    sssp(s: GraphSnapshot, source: number, options?: SsspOptions): Promise<GpuSsspResult>;
+    bellmanFord(s: GraphSnapshot, source: number, options?: SsspOptions): Promise<GpuBellmanFordResult>;
+    closenessCentrality(s: GraphSnapshot, options?: HitsOptionsLike): Promise<GpuScoresResult>;
     release(s: GraphSnapshot): void;
     dispose(): void;
 }

package/dist/src/types/accelerator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"accelerator.d.ts","sourceRoot":"","sources":["../../../src/types/accelerator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACR,oBAAoB,EACpB,cAAc,EACd,qBAAqB,EACrB,6BAA6B,EAC7B,aAAa,EACb,mBAAmB,EACnB,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACd,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,gBAAgB,EAChB,cAAc,EACjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACrE,OAAO,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAE3E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,KAAK,EACR,iBAAiB,EACjB,kBAAkB,EAClB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,EACf,WAAW,EACX,WAAW,EACX,eAAe,EAClB,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,EACR,gBAAgB,EAChB,wBAAwB,EACxB,mBAAmB,EACnB,eAAe,EACf,qBAAqB,EACxB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,kBAAkB,EAAE,0BAA0B,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAM5G,YAAY,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;AAMpD,YAAY,EACR,oBAAoB,EACpB,cAAc,EACd,qBAAqB,EACrB,6BAA6B,EAC7B,aAAa,EACb,mBAAmB,EACnB,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACd,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,gBAAgB,EAChB,cAAc,GACjB,CAAC;AAIF;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IAC/B,QAAQ,CAAC,MAAM,CAAC,EAAE,eAAe,GAAG,SAAS,CAAC;IAC9C,QAAQ,CAAC,UAAU,CAAC,EACd;QACI,QAAQ,CAAC,WAAW,CAAC,EACjB;YAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;YAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,CAAA;SAAE,GAAG,SAAS,CAAC;KACzG,GACD,SAAS,CAAC;CACnB;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,cAAe,SAAQ,oBAAoB,EAAE,iBAAiB;IAC3E,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,kBAAkB,CAAC,CAAC;IAC/C,WAAW,CAAC,OAAO,CAAC,EAAE,kBAAkB,GAAG,mBAAmB,CAAC,kBAAkB,EAAE,gBAAgB,CAAC,CAAC;IACrG,mBAAmB,CACf,OAAO,CAAC,EAAE,0BAA0B,GACrC,mBAAmB,CAAC,0BAA0B,EAAE,wBAAwB,CAAC,CAAC;IAC7E,gBAAgB,CAAC,OAAO,CAAC,EAAE,uBAAuB,GAAG,mBAAmB,CAAC,uBAAuB,EAAE,qBAAqB,CAAC,CAAC;IACzH,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAClF,oBAAoB,CAChB,CAAC,EAAE,aAAa,EAChB,eAAe,EAAE,GAAG,GAAG,GAAG,EAC1B,OAAO,CAAC,EAAE,eAAe,GAC1B,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAC9B,IAAI,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;IACtE,qBAAqB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,kBAAkB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAChG,cAAc,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAClF,mBAAmB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAC5F,yBAAyB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAClG,OAAO,CAAC,CAAC,EAAE,aAAa,GAAG,IAAI,CAAC;IAChC,OAAO,IAAI,IAAI,CAAC;CACnB"}
+{"version":3,"file":"accelerator.d.ts","sourceRoot":"","sources":["../../../src/types/accelerator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACR,oBAAoB,EACpB,cAAc,EACd,qBAAqB,EACrB,6BAA6B,EAC7B,UAAU,EACV,aAAa,EACb,mBAAmB,EACnB,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACd,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,gBAAgB,EAChB,WAAW,EACX,cAAc,EACjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACrE,OAAO,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAE3E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,KAAK,EACR,iBAAiB,EACjB,kBAAkB,EAClB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,EACf,WAAW,EACX,WAAW,EACX,eAAe,EAClB,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,EACR,gBAAgB,EAChB,wBAAwB,EACxB,mBAAmB,EACnB,eAAe,EACf,qBAAqB,EACxB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,kBAAkB,EAAE,0BAA0B,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAC5G,OAAO,KAAK,EAAE,oBAAoB,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAMxF,YAAY,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;AAMpD,YAAY,EACR,oBAAoB,EACpB,cAAc,EACd,qBAAqB,EACrB,6BAA6B,EAC7B,UAAU,EACV,aAAa,EACb,mBAAmB,EACnB,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACd,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,gBAAgB,EAChB,WAAW,EACX,cAAc,GACjB,CAAC;AAIF;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IAC/B,QAAQ,CAAC,MAAM,CAAC,EAAE,eAAe,GAAG,SAAS,CAAC;IAC9C,QAAQ,CAAC,UAAU,CAAC,EACd;QACI,QAAQ,CAAC,WAAW,CAAC,EACjB;YAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;YAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,CAAA;SAAE,GAAG,SAAS,CAAC;KACzG,GACD,SAAS,CAAC;CACnB;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,cAAe,SAAQ,oBAAoB,EAAE,iBAAiB;IAC3E,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,kBAAkB,CAAC,CAAC;IAC/C,WAAW,CAAC,OAAO,CAAC,EAAE,kBAAkB,GAAG,mBAAmB,CAAC,kBAAkB,EAAE,gBAAgB,CAAC,CAAC;IACrG,mBAAmB,CACf,OAAO,CAAC,EAAE,0BAA0B,GACrC,mBAAmB,CAAC,0BAA0B,EAAE,wBAAwB,CAAC,CAAC;IAC7E,gBAAgB,CAAC,OAAO,CAAC,EAAE,uBAAuB,GAAG,mBAAmB,CAAC,uBAAuB,EAAE,qBAAqB,CAAC,CAAC;IACzH,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAClF,oBAAoB,CAChB,CAAC,EAAE,aAAa,EAChB,eAAe,EAAE,GAAG,GAAG,GAAG,EAC1B,OAAO,CAAC,EAAE,eAAe,GAC1B,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAC9B,IAAI,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;IACtE,qBAAqB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,kBAAkB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAChG,cAAc,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAClF,mBAAmB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAC5F,yBAAyB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAClG,kBAAkB,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;IAClG,IAAI,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;IACtF,WAAW,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAC;IACpG,mBAAmB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAC3F,OAAO,CAAC,CAAC,EAAE,aAAa,GAAG,IAAI,CAAC;IAChC,OAAO,IAAI,IAAI,CAAC;CACnB"}

package/dist/src/types/traversal.d.ts

@@ -0,0 +1,53 @@
+/**
+ * The result records of the P8 frontier family (design 3.3 lines 830-832, 9.7), verbatim. The OPTION types are the
+ * seam's own -- `BfsOptions` and `SsspOptions` from `@graphty/algorithms`, re-exported through
+ * `src/types/accelerator.ts` beside `HitsOptionsLike` -- and are deliberately NOT redeclared here (P8 PD-19): a
+ * member the CPU dispatcher forwards options into must read exactly the keys the CPU port reads. Every sentinel is
+ * spelled on its field, because a consumer who reads `parent[root] === 4294967295` and guesses is the failure this
+ * file prevents. Types only: this file imports nothing at runtime.
+ */
+import type { F32, U32 } from "@graphty/graph-format";
+/**
+ * Design 3.3 line 830: what `breadthFirstSearch` returns. Satisfies the seam's `BfsResultLike` (`depth`, `parent`,
+ * `order`, `visitedCount`) with `levels` and `switches` on top. Every array is bitwise reproducible (PD-14).
+ */
+export interface GpuBfsResult {
+    /** Per node: its hop count from the source; `INVALID_INDEX` (4294967295) = unreached. */
+    readonly depth: U32;
+    /**
+     * Per node: the SMALLEST node index `u` with `depth[u] + 1 == depth[v]` and an arc `u -> v` (PD-24: a post-pass over
+     * the settled depths, so the chain to the source strictly decreases `depth`); `INVALID_INDEX` for the source and
+     * for an unreached node.
+     */
+    readonly parent: U32;
+    /** Length `visitedCount`: the reached nodes grouped by depth, ascending by node index within a depth (PD-14). */
+    readonly order: U32;
+    /** How many nodes were reached, the source included. */
+    readonly visitedCount: number;
+    /** `max depth + 1`; 1 for a source with no out-arcs. */
+    readonly levels: number;
+    /** Direction changes of the direction-optimizing search (a device counter, design 8.4); 0 on a top-down-only run. */
+    readonly switches: number;
+}
+/**
+ * Design 3.3 line 831: what `sssp` returns. Satisfies the seam's `SsspResultLike` (`dist: NumericVector` admits `F32`;
+ * `predArc: U32`). `dist` is bitwise reproducible (PD-9) and `predArc` is a function of it alone (PD-27).
+ */
+export interface GpuSsspResult {
+    /** Per node: its shortest distance from the source in f32; `+Infinity` = unreached, which includes beyond `cutoff`. */
+    readonly dist: F32;
+    /**
+     * Per node `v`: a TIGHT arc `a` into `v` (`fround(dist[src(a)] + w(a)) == dist[v]`) whose source sits one PD-27 key
+     * step below `v`, the smallest such arc index; the chain `v -> src(a) -> ...` always ends at the source.
+     * `INVALID_INDEX` (4294967295) for the source and for an unreached node.
+     */
+    readonly predArc: U32;
+    /** How many nodes have a finite `dist`, the source included. */
+    readonly reachedCount: number;
+}
+/** Design 3.3 line 832: what `bellmanFord` returns. Satisfies the seam's `BellmanFordResultLike`. */
+export interface GpuBellmanFordResult extends GpuSsspResult {
+    /** When true, `dist` and `predArc` are the values of the last round, not shortest paths. */
+    readonly hasNegativeCycle: boolean;
+}
+//# sourceMappingURL=traversal.d.ts.map

package/dist/src/types/traversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.d.ts","sourceRoot":"","sources":["../../../src/types/traversal.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEtD;;;GAGG;AACH,MAAM,WAAW,YAAY;IACzB,yFAAyF;IACzF,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,iHAAiH;IACjH,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,wDAAwD;IACxD,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,wDAAwD;IACxD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,qHAAqH;IACrH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC1B,uHAAuH;IACvH,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;IACtB,gEAAgE;IAChE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CACjC;AAED,qGAAqG;AACrG,MAAM,WAAW,oBAAqB,SAAQ,aAAa;IACvD,4FAA4F;IAC5F,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACtC"}

package/dist/src/types/traversal.js

@@ -0,0 +1,10 @@
+/**
+ * The result records of the P8 frontier family (design 3.3 lines 830-832, 9.7), verbatim. The OPTION types are the
+ * seam's own -- `BfsOptions` and `SsspOptions` from `@graphty/algorithms`, re-exported through
+ * `src/types/accelerator.ts` beside `HitsOptionsLike` -- and are deliberately NOT redeclared here (P8 PD-19): a
+ * member the CPU dispatcher forwards options into must read exactly the keys the CPU port reads. Every sentinel is
+ * spelled on its field, because a consumer who reads `parent[root] === 4294967295` and guesses is the failure this
+ * file prevents. Types only: this file imports nothing at runtime.
+ */
+export {};
+//# sourceMappingURL=traversal.js.map

package/dist/src/types/traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.js","sourceRoot":"","sources":["../../../src/types/traversal.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/src/wgsl/advance-expand.wgsl.d.ts

@@ -0,0 +1,19 @@
+/**
+ * The `advance-expand` kernel body (design 6 row 8, 8.10 "BFS expand"; P8-T5, the P8 plan's PD-23): Gunrock's
+ * block-mapped expansion of a vertex frontier into the edge queue. Each workgroup loads up to `WG` frontier entries,
+ * reads their degrees clipped to the bound arc window `[P.arcBase, P.arcEnd)` (so the window-aware form of P8-T12
+ * changes nothing here), runs the prelude's INCLUSIVE workgroup scan `wg_scan_u32` over those degrees -- the subgroup
+ * form when the device has the feature, the Hillis-Steele form otherwise, which is the ONLY text that differs between
+ * the twin's two compilations -- and then every invocation strips the range `[0, aggregate)` with a binary search
+ * (`upper_bound`) over the scanned degrees to find which entry its arc belongs to. One `atomicAdd` per WORKGROUP
+ * reserves the block's span in the queue (`edgeCount`), the same aggregate lands in `edgeCountUnclamped` (the overflow
+ * detector, never clamped) and in `frontierDegreeSum` (Beamer's m_f); a lane whose queue position is at or past
+ * `P.edgeCapacity` writes nothing (the clamp). The queue holds the TARGET vertex of each arc only (PD-24: `parent`
+ * comes from the post-pass). Uniformity (spec 3.5 rule 1): the guarded loads write locals, the scan call and the
+ * `workgroupUniformLoad` sit unconditionally after the guard, and the strip loop is bounded by a uniform value.
+ * There is no `TIER` override: a hub row is balanced over all `WG` lanes inside its block, and the small-frontier
+ * workgroup-per-row structure is `bfs-fused` (P8-T7). Body only (spec 3.5, D9); the text is normative: the
+ * sabotage rows of test/helpers/sabotage.ts are textual edits of it.
+ */
+export declare const advanceExpandWgsl = "\nvar<workgroup> sh: array<u32, WG>;          // the block's degrees, then their inclusive scan\nvar<workgroup> rowStart: array<u32, WG>;    // the first bound arc of each entry's row\nvar<workgroup> base: u32;                   // the block's reserved span in the edge queue\nvar<workgroup> wcount: u32;                 // the frontier's length on a two-phase level, 0 on any other\n\n@compute @workgroup_size(WG)\nfn advance_expand(@builtin(workgroup_id) wid: vec3<u32>, @builtin(local_invocation_id) lid: vec3<u32>) {\n    if (lid.x == 0u) { wcount = select(0u, atomicLoad(&counters[0]), atomicLoad(&counters[24]) == 1u); }   // frontierCount, on the two-phase path only (the path word)\n    let count = workgroupUniformLoad(&wcount);                       // uniform: the block loop below holds barriers\n    for (var b0 = group_id(wid) * WG; b0 < count; b0 = b0 + P.stride) {   // grid-stride over blocks of WG entries (a direct dispatch of the plan's groups)\n        let i = b0 + lid.x;                                          // this lane's frontier entry\n        var deg = 0u;\n        var start = 0u;\n        if (i < count) {                                                 // guarded loads into locals (3.5 rule 1)\n            let v = frontierIn[i];\n            let lo = max(rowPtr[v], P.arcBase);                          // the row clipped to the bound window (P8-T12)\n            let hi = min(rowPtr[v + 1u], P.arcEnd);\n            start = lo;\n            deg = select(0u, hi - lo, hi > lo);\n        }\n        let inclusive = wg_scan_u32(deg, lid.x);                         // the prelude's inclusive scan in LANE order (P8-T1 Step 5); the twin\n        sh[lid.x] = inclusive;                                           // sh is monotone in lid.x, the index the binary search walks\n        rowStart[lid.x] = start;\n        workgroupBarrier();\n        let aggregate = workgroupUniformLoad(&sh[WG - 1u]);              // uniform; includes a barrier\n        if (lid.x == 0u) {\n            base = atomicAdd(&counters[8], aggregate);                   // edgeCount: ONE reservation per workgroup, not one per arc\n            atomicAdd(&counters[9], aggregate);                          // edgeCountUnclamped: the overflow detector (PD-23)\n            atomicAdd(&counters[2], aggregate);                          // frontierDegreeSum: Beamer's m_f (P8-T8)\n        }\n        workgroupBarrier();\n        for (var p = lid.x; p < aggregate; p = p + WG) {                 // strip [0, aggregate): lane j takes j, j + WG, ...\n            var lo = 0u;                                                 // upper_bound: the first k with sh[k] > p owns arc p\n            var hi = WG;\n            loop {\n                if (lo >= hi) { break; }\n                let mid = (lo + hi) / 2u;\n                if (sh[mid] > p) { hi = mid; } else { lo = mid + 1u; }\n            }\n            let k = lo;\n            var exclusive = 0u;\n            if (k > 0u) { exclusive = sh[k - 1u]; }\n            let arc = rowStart[k] + (p - exclusive);\n            let q = base + p;\n            if (q < P.edgeCapacity) { edgeQueue[q] = colIdx[arc - P.arcBase]; }   // the clamp of PD-23; the queue holds the target vertex only (PD-24)\n        }\n        workgroupBarrier();                                              // sh, rowStart and base are reused by the next block\n    }\n}\n";
+//# sourceMappingURL=advance-expand.wgsl.d.ts.map

package/dist/src/wgsl/advance-expand.wgsl.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"advance-expand.wgsl.d.ts","sourceRoot":"","sources":["../../../src/wgsl/advance-expand.wgsl.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,iBAAiB,s0GAkD7B,CAAC"}