@scrolled/nav-graph 0.1.1-dev.7c21e18 → 0.1.1-dev.df34916

package/dist/path/findPath.js

@@ -1,37 +1,79 @@
-// MVP pathfinding: fewest-hops BFS over the compiled adjacency.
+// Weighted pathfinding: least-time Dijkstra over the compiled adjacency.
+//
+// Two methods cost time — `walk` and `transport` (boats/trains/carpets). Each
+// costs its declared `seconds`, or its method default when untimed, so a graph
+// with no times set still routes sensibly. Every other method (portal, npc,
+// item, skill) is a teleport-like transition, treated as instant.
+//
+// `transport` time is *conditional*: with fast travel enabled (the player holds
+// a fast-travel ticket), every transport hop is instant, so routes prefer boats
+// over long walks; without it, transports cost their ride time and the router
+// may route around them.
+//
+// `scroll` edges (return-to-nearest-town) are *availability*-conditional: they
+// are traversable only when `nearestTownScroll` is set (the player carries
+// return scrolls). They are instant like other teleports when enabled.
 //
 // When an eligibility predicate is supplied:
-//   1. Run BFS with the predicate pruning candidate edges.
+//   1. Run Dijkstra with the predicate pruning candidate edges.
 //   2. If the destination is reachable that way, return `status: 'found'`.
-//   3. Otherwise run BFS again *without* the filter. If a path exists, return
-//      `status: 'unreachable-when-filtered'` with the unfiltered path as
+//   3. Otherwise run Dijkstra again *without* the filter. If a path exists,
+//      return `status: 'unreachable-when-filtered'` with the unfiltered path as
 //      `fallback` and the step indices the filter blocked. This is FR7 — the
 //      app never has to surface a blank "no path" state when the graph itself
 //      is connected.
-//   4. If the unfiltered BFS also fails, return `status: 'unreachable'`.
+//   4. If the unfiltered search also fails, return `status: 'unreachable'`.
+/** Assumed travel time, in seconds, for a walk edge that declares no `seconds`. */
+export const DEFAULT_WALK_SECONDS = 60;
+/**
+ * Assumed ride time, in seconds, for a transport edge that declares no
+ * `seconds`. Longer than a walk hop: boarding a boat/train means waiting for it.
+ */
+export const DEFAULT_TRANSPORT_SECONDS = 300;
+/**
+ * Travel time an edge contributes to a route. `walk` always costs time;
+ * `transport` costs its ride time unless `fastTravel` waives it; portal / npc /
+ * item / skill transitions teleport the player instantly.
+ */
+export function edgeSeconds(edge, opts = {}) {
+    switch (edge.method) {
+        case 'walk':
+            return edge.seconds ?? DEFAULT_WALK_SECONDS;
+        case 'transport':
+            return opts.fastTravel ? 0 : (edge.seconds ?? DEFAULT_TRANSPORT_SECONDS);
+        default:
+            return 0;
+    }
+}
 export function findPath(graph, from, to, opts = {}) {
     assertNodeKnown(graph, from, 'from');
     assertNodeKnown(graph, to, 'to');
     if (from === to)
-        return { status: 'found', steps: [] };
-    const filtered = opts.eligible ? bfs(graph, from, to, opts.eligible) : null;
-    if (filtered)
-        return { status: 'found', steps: filtered };
-    const unfiltered = bfs(graph, from, to);
+        return { status: 'found', steps: [], totalSeconds: 0 };
+    const cost = { fastTravel: opts.fastTravel };
+    const allowScroll = opts.nearestTownScroll ?? false;
+    const filtered = opts.eligible
+        ? dijkstra(graph, from, to, cost, allowScroll, opts.eligible)
+        : null;
+    if (filtered) {
+        return { status: 'found', steps: filtered.steps, totalSeconds: filtered.totalSeconds };
+    }
+    const unfiltered = dijkstra(graph, from, to, cost, allowScroll);
     if (!unfiltered)
-        return { status: 'unreachable', steps: [] };
+        return { status: 'unreachable', steps: [], totalSeconds: 0 };
     if (!opts.eligible) {
-        return { status: 'found', steps: unfiltered };
+        return { status: 'found', steps: unfiltered.steps, totalSeconds: unfiltered.totalSeconds };
     }
     const blocked = [];
-    unfiltered.forEach((edge, i) => {
+    unfiltered.steps.forEach((edge, i) => {
         if (!opts.eligible(edge))
             blocked.push(i);
     });
     return {
         status: 'unreachable-when-filtered',
         steps: [],
-        fallback: { steps: unfiltered, blocked },
+        totalSeconds: 0,
+        fallback: { steps: unfiltered.steps, totalSeconds: unfiltered.totalSeconds, blocked },
     };
 }
 function assertNodeKnown(graph, id, label) {
@@ -39,23 +81,33 @@ function assertNodeKnown(graph, id, label) {
         throw new Error(`findPath ${label} references undeclared node "${id}".`);
     }
 }
-function bfs(graph, from, to, eligible) {
+function dijkstra(graph, from, to, cost, allowScroll, eligible) {
+    const dist = new Map([[from, 0]]);
     const cameFrom = new Map();
-    const visited = new Set([from]);
-    const queue = [from];
-    while (queue.length > 0) {
-        const node = queue.shift();
+    const settled = new Set();
+    const frontier = new MinHeap();
+    frontier.push(from, 0);
+    while (!frontier.isEmpty()) {
+        const node = frontier.pop();
+        if (settled.has(node))
+            continue; // stale heap entry — already finalized
         if (node === to)
-            return reconstruct(cameFrom, from, to);
-        const out = graph.adjacency.get(node) ?? [];
-        for (const edge of out) {
+            return { steps: reconstruct(cameFrom, from, to), totalSeconds: dist.get(to) };
+        settled.add(node);
+        const base = dist.get(node);
+        for (const edge of graph.adjacency.get(node) ?? []) {
+            if (edge.method === 'scroll' && !allowScroll)
+                continue;
             if (eligible && !eligible(edge))
                 continue;
-            if (visited.has(edge.to))
+            if (settled.has(edge.to))
                 continue;
-            visited.add(edge.to);
-            cameFrom.set(edge.to, edge);
-            queue.push(edge.to);
+            const next = base + edgeSeconds(edge, cost);
+            if (next < (dist.get(edge.to) ?? Infinity)) {
+                dist.set(edge.to, next);
+                cameFrom.set(edge.to, edge);
+                frontier.push(edge.to, next);
+            }
         }
     }
     return null;
@@ -66,7 +118,7 @@ function reconstruct(cameFrom, from, to) {
     while (cursor !== from) {
         const edge = cameFrom.get(cursor);
         if (!edge) {
-            // Defensive: BFS only stores cameFrom for reachable nodes, so this
+            // Defensive: Dijkstra only stores cameFrom for reachable nodes, so this
             // branch is unreachable in practice — but typing the lookup demands it.
             throw new Error(`Path reconstruction broke at "${cursor}".`);
         }
@@ -75,4 +127,60 @@ function reconstruct(cameFrom, from, to) {
     }
     return steps.reverse();
 }
+// Binary min-heap keyed by tentative distance. Uses lazy deletion — a node can
+// appear more than once and settled entries are skipped on pop.
+class MinHeap {
+    nodes = [];
+    keys = [];
+    isEmpty() {
+        return this.nodes.length === 0;
+    }
+    push(node, key) {
+        this.nodes.push(node);
+        this.keys.push(key);
+        this.bubbleUp(this.nodes.length - 1);
+    }
+    pop() {
+        if (this.nodes.length === 0)
+            return undefined;
+        const top = this.nodes[0];
+        const lastNode = this.nodes.pop();
+        const lastKey = this.keys.pop();
+        if (this.nodes.length > 0) {
+            this.nodes[0] = lastNode;
+            this.keys[0] = lastKey;
+            this.bubbleDown(0);
+        }
+        return top;
+    }
+    bubbleUp(i) {
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (this.keys[parent] <= this.keys[i])
+                break;
+            this.swap(i, parent);
+            i = parent;
+        }
+    }
+    bubbleDown(i) {
+        const n = this.nodes.length;
+        for (;;) {
+            const left = 2 * i + 1;
+            const right = left + 1;
+            let smallest = i;
+            if (left < n && this.keys[left] < this.keys[smallest])
+                smallest = left;
+            if (right < n && this.keys[right] < this.keys[smallest])
+                smallest = right;
+            if (smallest === i)
+                break;
+            this.swap(i, smallest);
+            i = smallest;
+        }
+    }
+    swap(a, b) {
+        [this.nodes[a], this.nodes[b]] = [this.nodes[b], this.nodes[a]];
+        [this.keys[a], this.keys[b]] = [this.keys[b], this.keys[a]];
+    }
+}
 //# sourceMappingURL=findPath.js.map

package/dist/path/findPath.js.map

@@ -1 +1 @@
-{"version":3,"file":"findPath.js","sourceRoot":"","sources":["../../src/path/findPath.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,EAAE;AACF,6CAA6C;AAC7C,2DAA2D;AAC3D,2EAA2E;AAC3E,8EAA8E;AAC9E,yEAAyE;AACzE,6EAA6E;AAC7E,8EAA8E;AAC9E,qBAAqB;AACrB,yEAAyE;AAmBzE,MAAM,UAAU,QAAQ,CACtB,KAAe,EACf,IAAY,EACZ,EAAU,EACV,OAAwB,EAAE;IAE1B,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAEjC,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAEvD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5E,IAAI,QAAQ;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAE1D,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IACxC,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAE7D,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAChD,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,CAAC,IAAI,CAAC,QAAS,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IACH,OAAO;QACL,MAAM,EAAE,2BAA2B;QACnC,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE;KACzC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAAe,EAAE,EAAU,EAAE,KAAoB;IACxE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,YAAY,KAAK,gCAAgC,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED,SAAS,GAAG,CACV,KAAe,EACf,IAAY,EACZ,EAAU,EACV,QAAwC;IAExC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,CAAC;IAE/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,IAAI,IAAI,KAAK,EAAE;YAAE,OAAO,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAExD,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,QAAiC,EACjC,IAAY,EACZ,EAAU;IAEV,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,MAAM,GAAW,EAAE,CAAC;IACxB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,mEAAmE;YACnE,wEAAwE;YACxE,MAAM,IAAI,KAAK,CAAC,iCAAiC,MAAM,IAAI,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC"}
+{"version":3,"file":"findPath.js","sourceRoot":"","sources":["../../src/path/findPath.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,EAAE;AACF,8EAA8E;AAC9E,+EAA+E;AAC/E,4EAA4E;AAC5E,kEAAkE;AAClE,EAAE;AACF,gFAAgF;AAChF,gFAAgF;AAChF,8EAA8E;AAC9E,yBAAyB;AACzB,EAAE;AACF,+EAA+E;AAC/E,2EAA2E;AAC3E,uEAAuE;AACvE,EAAE;AACF,6CAA6C;AAC7C,gEAAgE;AAChE,2EAA2E;AAC3E,4EAA4E;AAC5E,gFAAgF;AAChF,6EAA6E;AAC7E,8EAA8E;AAC9E,qBAAqB;AACrB,4EAA4E;AAK5E,mFAAmF;AACnF,MAAM,CAAC,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAEvC;;;GAGG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAG,CAAC;AAQ7C;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAgB,EAAE,OAAwB,EAAE;IACtE,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,MAAM;YACT,OAAO,IAAI,CAAC,OAAO,IAAI,oBAAoB,CAAC;QAC9C,KAAK,WAAW;YACd,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,yBAAyB,CAAC,CAAC;QAC3E;YACE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AA+BD,MAAM,UAAU,QAAQ,CACtB,KAAe,EACf,IAAY,EACZ,EAAU,EACV,OAAwB,EAAE;IAE1B,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAEjC,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAExE,MAAM,IAAI,GAAoB,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC;IAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,IAAI,KAAK,CAAC;IACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ;QAC5B,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC;QAC7D,CAAC,CAAC,IAAI,CAAC;IACT,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,CAAC,YAAY,EAAE,CAAC;IACzF,CAAC;IAED,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;IAChE,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAE9E,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,YAAY,EAAE,UAAU,CAAC,YAAY,EAAE,CAAC;IAC7F,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACnC,IAAI,CAAC,IAAI,CAAC,QAAS,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IACH,OAAO;QACL,MAAM,EAAE,2BAA2B;QACnC,KAAK,EAAE,EAAE;QACT,YAAY,EAAE,CAAC;QACf,QAAQ,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,YAAY,EAAE,UAAU,CAAC,YAAY,EAAE,OAAO,EAAE;KACtF,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAAe,EAAE,EAAU,EAAE,KAAoB;IACxE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,YAAY,KAAK,gCAAgC,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAOD,SAAS,QAAQ,CACf,KAAe,EACf,IAAY,EACZ,EAAU,EACV,IAAqB,EACrB,WAAoB,EACpB,QAAwC;IAExC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAE,CAAC;IAC/B,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEvB,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;QAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS,CAAC,uCAAuC;QACxE,IAAI,IAAI,KAAK,EAAE;YAAE,OAAO,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;QAChG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAElB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACnD,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,WAAW;gBAAE,SAAS;YACvD,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,MAAM,IAAI,GAAG,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5C,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;gBAC3C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBACxB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,QAAiC,EACjC,IAAY,EACZ,EAAU;IAEV,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,MAAM,GAAW,EAAE,CAAC;IACxB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,wEAAwE;YACxE,wEAAwE;YACxE,MAAM,IAAI,KAAK,CAAC,iCAAiC,MAAM,IAAI,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC;AAED,+EAA+E;AAC/E,gEAAgE;AAChE,MAAM,OAAO;IACM,KAAK,GAAa,EAAE,CAAC;IACrB,IAAI,GAAa,EAAE,CAAC;IAErC,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,IAAY,EAAE,GAAW;QAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QACjC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,MAAM;YAC7C,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACrB,CAAC,GAAG,MAAM,CAAC;QACb,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,CAAS;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,SAAS,CAAC;YACR,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;YACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAAE,QAAQ,GAAG,IAAI,CAAC;YACvE,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAAE,QAAQ,GAAG,KAAK,CAAC;YAC1E,IAAI,QAAQ,KAAK,CAAC;gBAAE,MAAM;YAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YACvB,CAAC,GAAG,QAAQ,CAAC;QACf,CAAC;IACH,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;CACF"}

package/dist/path/index.d.ts

@@ -1,5 +1,7 @@
 export { eligibilityFilter } from './eligibility';
 export type { UserCapability } from './eligibility';
-export { findPath } from './findPath';
-export type { FindPathOptions, PathResult } from './findPath';
+export { collectUnlockables, isUnlockable, lockedRequirementsFilter, requirementEntityId, requirementKey, } from './unlockables';
+export type { UnlockableEntry, UnlockableKind, UnlockableRequirement } from './unlockables';
+export { DEFAULT_TRANSPORT_SECONDS, DEFAULT_WALK_SECONDS, edgeSeconds, findPath } from './findPath';
+export type { EdgeCostOptions, FindPathOptions, PathResult } from './findPath';
 //# sourceMappingURL=index.d.ts.map

package/dist/path/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/path/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,YAAY,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/path/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,YAAY,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACpD,OAAO,EACL,kBAAkB,EAClB,YAAY,EACZ,wBAAwB,EACxB,mBAAmB,EACnB,cAAc,GACf,MAAM,eAAe,CAAC;AACvB,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC;AAC5F,OAAO,EAAE,yBAAyB,EAAE,oBAAoB,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACpG,YAAY,EAAE,eAAe,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/path/index.js

@@ -1,3 +1,4 @@
 export { eligibilityFilter } from './eligibility';
-export { findPath } from './findPath';
+export { collectUnlockables, isUnlockable, lockedRequirementsFilter, requirementEntityId, requirementKey, } from './unlockables';
+export { DEFAULT_TRANSPORT_SECONDS, DEFAULT_WALK_SECONDS, edgeSeconds, findPath } from './findPath';
 //# sourceMappingURL=index.js.map

package/dist/path/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/path/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/path/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EACL,kBAAkB,EAClB,YAAY,EACZ,wBAAwB,EACxB,mBAAmB,EACnB,cAAc,GACf,MAAM,eAAe,CAAC;AAEvB,OAAO,EAAE,yBAAyB,EAAE,oBAAoB,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC"}

package/dist/path/unlockables.d.ts

@@ -0,0 +1,36 @@
+import type { NavGraphSource, Requirement, TravelEdge } from '../ir/types';
+export type UnlockableKind = 'item' | 'quest';
+export type UnlockableRequirement = Extract<Requirement, {
+    kind: UnlockableKind;
+}>;
+export declare function isUnlockable(req: Requirement): req is UnlockableRequirement;
+/** The opaque entity id a requirement gates on. */
+export declare function requirementEntityId(req: UnlockableRequirement): number;
+/**
+ * Stable `${kind}:${id}` key identifying a requirement's unlockable subject.
+ * Two edges that require the same item (or quest) share a key, so one toggle
+ * governs both.
+ */
+export declare function requirementKey(req: UnlockableRequirement): string;
+/** One distinct unlockable subject referenced somewhere in the graph. */
+export interface UnlockableEntry {
+    key: string;
+    kind: UnlockableKind;
+    id: number;
+    /** Author-supplied display name, when any edge naming this subject provides one. */
+    name?: string;
+}
+/**
+ * Every distinct item/quest requirement referenced by the graph's edges, one
+ * entry per `${kind}:${id}` in first-seen order. A named occurrence wins over
+ * an anonymous one, so a subject named on any edge surfaces its name.
+ */
+export declare function collectUnlockables(source: NavGraphSource): UnlockableEntry[];
+/**
+ * An eligibility predicate for `findPath` that blocks any edge requiring a
+ * *locked* item or quest — a subject whose `${kind}:${id}` key is in `locked`.
+ * Non-unlockable requirements (meso, level) never block. An empty set passes
+ * every edge, matching "all requirements unlocked by default".
+ */
+export declare function lockedRequirementsFilter(locked: ReadonlySet<string>): (edge: TravelEdge) => boolean;
+//# sourceMappingURL=unlockables.d.ts.map

package/dist/path/unlockables.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unlockables.d.ts","sourceRoot":"","sources":["../../src/path/unlockables.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAE3E,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,OAAO,CAAC;AAE9C,MAAM,MAAM,qBAAqB,GAAG,OAAO,CAAC,WAAW,EAAE;IAAE,IAAI,EAAE,cAAc,CAAA;CAAE,CAAC,CAAC;AAEnF,wBAAgB,YAAY,CAAC,GAAG,EAAE,WAAW,GAAG,GAAG,IAAI,qBAAqB,CAE3E;AAED,mDAAmD;AACnD,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,qBAAqB,GAAG,MAAM,CAEtE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,qBAAqB,GAAG,MAAM,CAEjE;AAED,yEAAyE;AACzE,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,cAAc,CAAC;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,oFAAoF;IACpF,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,cAAc,GAAG,eAAe,EAAE,CAoB5E;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAC1B,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAM/B"}

package/dist/path/unlockables.js

@@ -0,0 +1,62 @@
+// The "requirements you've unlocked" model.
+//
+// Two requirement kinds gate on an opaque game entity id — `item` and `quest`.
+// Those are things a traveller either has unlocked or hasn't, so the navigator
+// lets them declare which ones they hold and routes around the rest. `meso` and
+// `level` are scalar thresholds rather than opaque ids, so they're never gated
+// here and always pass.
+export function isUnlockable(req) {
+    return req.kind === 'item' || req.kind === 'quest';
+}
+/** The opaque entity id a requirement gates on. */
+export function requirementEntityId(req) {
+    return req.kind === 'item' ? req.itemId : req.questId;
+}
+/**
+ * Stable `${kind}:${id}` key identifying a requirement's unlockable subject.
+ * Two edges that require the same item (or quest) share a key, so one toggle
+ * governs both.
+ */
+export function requirementKey(req) {
+    return `${req.kind}:${requirementEntityId(req)}`;
+}
+/**
+ * Every distinct item/quest requirement referenced by the graph's edges, one
+ * entry per `${kind}:${id}` in first-seen order. A named occurrence wins over
+ * an anonymous one, so a subject named on any edge surfaces its name.
+ */
+export function collectUnlockables(source) {
+    const byKey = new Map();
+    for (const edge of source.edges) {
+        for (const req of edge.requirements ?? []) {
+            if (!isUnlockable(req))
+                continue;
+            const key = requirementKey(req);
+            const existing = byKey.get(key);
+            if (!existing) {
+                byKey.set(key, {
+                    key,
+                    kind: req.kind,
+                    id: requirementEntityId(req),
+                    ...(req.name ? { name: req.name } : {}),
+                });
+            }
+            else if (!existing.name && req.name) {
+                existing.name = req.name;
+            }
+        }
+    }
+    return [...byKey.values()];
+}
+/**
+ * An eligibility predicate for `findPath` that blocks any edge requiring a
+ * *locked* item or quest — a subject whose `${kind}:${id}` key is in `locked`.
+ * Non-unlockable requirements (meso, level) never block. An empty set passes
+ * every edge, matching "all requirements unlocked by default".
+ */
+export function lockedRequirementsFilter(locked) {
+    if (locked.size === 0)
+        return () => true;
+    return (edge) => (edge.requirements ?? []).every((req) => !isUnlockable(req) || !locked.has(requirementKey(req)));
+}
+//# sourceMappingURL=unlockables.js.map

package/dist/path/unlockables.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unlockables.js","sourceRoot":"","sources":["../../src/path/unlockables.ts"],"names":[],"mappings":"AAAA,4CAA4C;AAC5C,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,gFAAgF;AAChF,+EAA+E;AAC/E,wBAAwB;AAQxB,MAAM,UAAU,YAAY,CAAC,GAAgB;IAC3C,OAAO,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,CAAC;AACrD,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,mBAAmB,CAAC,GAA0B;IAC5D,OAAO,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;AACxD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,GAA0B;IACvD,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC;AACnD,CAAC;AAWD;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAsB;IACvD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;oBACb,GAAG;oBACH,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,EAAE,EAAE,mBAAmB,CAAC,GAAG,CAAC;oBAC5B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACxC,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;gBACtC,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAA2B;IAE3B,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC;IACzC,OAAO,CAAC,IAAI,EAAE,EAAE,CACd,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,KAAK,CAC7B,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAChE,CAAC;AACN,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@scrolled/nav-graph",
-  "version": "0.1.1-dev.7c21e18",
+  "version": "0.1.1-dev.df34916",
   "type": "module",
   "description": "Framework-agnostic graph core: IR types + Zod schema, an authoring DSL, a compiler (IR → runtime adjacency), and pathfinding (BFS + eligibility). The engine behind Scrolled Navigator; usable standalone in Node and the browser.",
   "license": "Apache-2.0",
@@ -29,42 +29,25 @@
     "README.md",
     "LICENSE"
   ],
-  "main": "./src/index.ts",
-  "module": "./src/index.ts",
-  "types": "./src/index.ts",
+  "main": "./dist/index.js",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
   "exports": {
-    ".": "./src/index.ts",
-    "./ir": "./src/ir/index.ts",
-    "./dsl": "./src/dsl/index.ts"
-  },
-  "publishConfig": {
-    "access": "public",
-    "main": "./dist/index.js",
-    "module": "./dist/index.js",
-    "types": "./dist/index.d.ts",
-    "exports": {
-      ".": {
-        "types": "./dist/index.d.ts",
-        "import": "./dist/index.js"
-      },
-      "./ir": {
-        "types": "./dist/ir/index.d.ts",
-        "import": "./dist/ir/index.js"
-      },
-      "./dsl": {
-        "types": "./dist/dsl/index.d.ts",
-        "import": "./dist/dsl/index.js"
-      }
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    },
+    "./ir": {
+      "types": "./dist/ir/index.d.ts",
+      "import": "./dist/ir/index.js"
+    },
+    "./dsl": {
+      "types": "./dist/dsl/index.d.ts",
+      "import": "./dist/dsl/index.js"
     }
   },
-  "scripts": {
-    "build": "tsc -p tsconfig.build.json",
-    "clean": "rm -rf dist LICENSE",
-    "export": "vite-node src/cli/export.ts",
-    "test": "vitest run --passWithNoTests",
-    "typecheck": "tsc --noEmit",
-    "lint": "eslint .",
-    "prepublishOnly": "pnpm run typecheck && pnpm run test && pnpm run clean && pnpm run build && cp ../../LICENSE LICENSE"
+  "publishConfig": {
+    "access": "public"
   },
   "dependencies": {
     "zod": "^3.23.8"
@@ -74,5 +57,13 @@
     "vite": "^5.4.8",
     "vite-node": "^2.1.2",
     "vitest": "^2.1.2"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "clean": "rm -rf dist LICENSE",
+    "export": "vite-node src/cli/export.ts",
+    "test": "vitest run --passWithNoTests",
+    "typecheck": "tsc --noEmit",
+    "lint": "eslint ."
   }
-}
+}