@osmix/router 0.0.13 → 0.1.0

package/dist/topology-stats.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topology-stats.d.ts","sourceRoot":"","sources":["../src/topology-stats.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAG5C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,sDAAsD;AACtD,MAAM,WAAW,oBAAoB;IACnC,iDAAiD;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,aAAa,EAAE,MAAM,CAAC;IACtB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,wDAAwD;IACxD,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,uFAAuF;AACvF,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,IAAI,QAAQ,CAAC;QAAE,IAAI,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;QAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;CAC3E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,EAC5D,MAAM,EAAE,aAAa,GACpB,MAAM,GAAG,IAAI,CAUf;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,qBAAqB,EAC7B,MAAM,EAAE,aAAa,GACpB,oBAAoB,CAgCtB"}

package/dist/topology-stats.js

@@ -0,0 +1,62 @@
+import { normalizedWayDirection } from "@osmix/types/way-direction";
+/**
+ * Directed edges one way adds for `filter` (two per segment, one when one-way), or null when
+ * the filter does not route it. Direction follows the router: an unsupported one-way value
+ * counts as forward on a roundabout and as two-way elsewhere.
+ */
+export function routingWayEdges(way, filter) {
+    if (!filter(way.tags) || way.refs.length < 2)
+        return null;
+    const normalized = normalizedWayDirection(way.tags);
+    const direction = normalized === "unsupported"
+        ? way.tags?.["junction"] === "roundabout"
+            ? "forward"
+            : "both"
+        : normalized;
+    return (direction === "both" ? 2 : 1) * (way.refs.length - 1);
+}
+/**
+ * The same counts `RoutingGraph` would give for `filter`, computed from ways alone, without
+ * building the graph (no coordinates, speeds or CSR arrays). Direction follows the router: an
+ * unsupported one-way value counts as forward on a roundabout and as two-way elsewhere.
+ */
+export function routingTopologyStats(source, filter) {
+    const parent = new Map();
+    const find = (id) => {
+        let root = id;
+        while (parent.get(root) !== root)
+            root = parent.get(root);
+        let cursor = id;
+        while (parent.get(cursor) !== cursor) {
+            const next = parent.get(cursor);
+            parent.set(cursor, root);
+            cursor = next;
+        }
+        return root;
+    };
+    const union = (a, b) => {
+        if (!parent.has(a))
+            parent.set(a, a);
+        if (!parent.has(b))
+            parent.set(b, b);
+        const left = find(a);
+        const right = find(b);
+        if (left !== right)
+            parent.set(right, left);
+    };
+    let edges = 0;
+    for (const way of source.ways()) {
+        const wayEdges = routingWayEdges(way, filter);
+        if (wayEdges == null)
+            continue;
+        for (let index = 0; index < way.refs.length - 1; index++) {
+            union(way.refs[index], way.refs[index + 1]);
+        }
+        edges += wayEdges;
+    }
+    const roots = new Set();
+    for (const id of parent.keys())
+        roots.add(find(id));
+    return { nodes: source.nodeCount, routableNodes: parent.size, edges, components: roots.size };
+}
+//# sourceMappingURL=topology-stats.js.map

package/dist/topology-stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topology-stats.js","sourceRoot":"","sources":["../src/topology-stats.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAsBpE;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC7B,GAA4D,EAC5D,MAAqB;IAErB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,MAAM,UAAU,GAAG,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpD,MAAM,SAAS,GACb,UAAU,KAAK,aAAa;QAC1B,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,KAAK,YAAY;YACvC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,MAAM;QACV,CAAC,CAAC,UAAU,CAAC;IACjB,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAA6B,EAC7B,MAAqB;IAErB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,EAAU,EAAU,EAAE;QAClC,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAC3D,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,MAAM,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC;IACF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC9C,IAAI,QAAQ,IAAI,IAAI;YAAE,SAAS;QAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACzD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAE,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,IAAI,QAAQ,CAAC;IACpB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,aAAa,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;AAChG,CAAC"}

package/dist/types.d.ts

@@ -3,7 +3,7 @@
  * @module
  */
 import type { BufferType } from "@osmix/core";
-import type { LonLat, OsmTags } from "@osmix/shared/types";
+import type { LonLat, OsmTags } from "@osmix/types";
 /** Per-way segment with distance and time (consecutive same-name ways merged). */
 export interface WaySegment {
     /** OSM way IDs included in this segment (multiple if merged). */
@@ -113,6 +113,19 @@ export interface PathSegment {
     /** Cost to reach this node. */
     cost: number;
 }
+/** Extra graph data that some routing algorithms need. */
+export interface RoutingAlgorithmContext {
+    /**
+     * Incoming edges of a node. In each returned edge, `targetNodeIndex` is the
+     * edge's source node. Required by `bidirectional`.
+     */
+    reverseGraph?: (nodeIndex: number) => GraphEdge[];
+    /**
+     * Fastest edge speed in the graph, in meters per second. Bounds the A* time
+     * heuristic so it never overestimates. Default: 130 km/h.
+     */
+    maxSpeedMps?: number;
+}
 /** Function signature for routing algorithms. */
-export type RoutingAlgorithmFn = (graph: (nodeIndex: number) => GraphEdge[], startNodeIndex: number, endNodeIndex: number, getEdgeWeight: (edge: GraphEdge) => number, getNodeCoord?: (nodeIndex: number) => LonLat | undefined, metric?: RoutingMetric) => PathSegment[] | null;
+export type RoutingAlgorithmFn = (graph: (nodeIndex: number) => GraphEdge[], startNodeIndex: number, endNodeIndex: number, getEdgeWeight: (edge: GraphEdge) => number, getNodeCoord?: (nodeIndex: number) => LonLat | undefined, metric?: RoutingMetric, context?: RoutingAlgorithmContext) => PathSegment[] | null;
 //# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAE1D,kFAAkF;AAClF,MAAM,WAAW,UAAU;IAC1B,iEAAiE;IACjE,MAAM,EAAE,MAAM,EAAE,CAAA;IAChB,yCAAyC;IACzC,IAAI,EAAE,MAAM,CAAA;IACZ,8BAA8B;IAC9B,OAAO,EAAE,MAAM,CAAA;IACf,oDAAoD;IACpD,QAAQ,EAAE,MAAM,CAAA;IAChB,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAA;CACZ;AAED,4CAA4C;AAC5C,MAAM,WAAW,eAAe;IAC/B,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAA;IAChB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAA;CACZ;AAED,kDAAkD;AAClD,MAAM,WAAW,aAAa;IAC7B,6DAA6D;IAC7D,QAAQ,EAAE,UAAU,EAAE,CAAA;IACtB,wDAAwD;IACxD,UAAU,EAAE,MAAM,EAAE,CAAA;CACpB;AAED,8DAA8D;AAC9D,MAAM,WAAW,WAAW;IAC3B,mCAAmC;IACnC,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,uCAAuC;IACvC,UAAU,EAAE,MAAM,EAAE,CAAA;IACpB,+CAA+C;IAC/C,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,kEAAkE;IAClE,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,wDAAwD;IACxD,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAA;IACvB,yEAAyE;IACzE,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CACrB;AAED,kGAAkG;AAClG,MAAM,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,KAAK,OAAO,CAAA;AAEvD,oCAAoC;AACpC,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,OAAO,GAAG,eAAe,CAAA;AAErE,kCAAkC;AAClC,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,MAAM,CAAA;AAE/C,2CAA2C;AAC3C,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAElD,oCAAoC;AACpC,MAAM,WAAW,YAAY;IAC5B,2CAA2C;IAC3C,SAAS,EAAE,gBAAgB,CAAA;IAC3B,gDAAgD;IAChD,MAAM,EAAE,aAAa,CAAA;IACrB,2DAA2D;IAC3D,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,iEAAiE;IACjE,eAAe,CAAC,EAAE,OAAO,CAAA;CACzB;AAED,iCAAiC;AACjC,MAAM,WAAW,SAAS;IACzB,yBAAyB;IACzB,eAAe,EAAE,MAAM,CAAA;IACvB,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAA;IAChB,0BAA0B;IAC1B,QAAQ,EAAE,MAAM,CAAA;IAChB,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAA;CACZ;AAED;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACzC,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAA;IACjB,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAA;IACjB,sFAAsF;IACtF,WAAW,EAAE,UAAU,CAAA;IACvB,uCAAuC;IACvC,WAAW,EAAE,UAAU,CAAA;IACvB,+BAA+B;IAC/B,cAAc,EAAE,UAAU,CAAA;IAC1B,wCAAwC;IACxC,aAAa,EAAE,UAAU,CAAA;IACzB,4CAA4C;IAC5C,SAAS,EAAE,UAAU,CAAA;IACrB,qDAAqD;IACrD,YAAY,EAAE,UAAU,CAAA;IACxB,yDAAyD;IACzD,gBAAgB,EAAE,UAAU,CAAA;CAC5B;AAED,mDAAmD;AACnD,MAAM,WAAW,WAAW;IAC3B,kBAAkB;IAClB,SAAS,EAAE,MAAM,CAAA;IACjB,yCAAyC;IACzC,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,6BAA6B;IAC7B,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAA;CACZ;AAED,iDAAiD;AACjD,MAAM,MAAM,kBAAkB,GAAG,CAChC,KAAK,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,SAAS,EAAE,EACzC,cAAc,EAAE,MAAM,EACtB,YAAY,EAAE,MAAM,EACpB,aAAa,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,MAAM,EAC1C,YAAY,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EACxD,MAAM,CAAC,EAAE,aAAa,KAClB,WAAW,EAAE,GAAG,IAAI,CAAA"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEpD,kFAAkF;AAClF,MAAM,WAAW,UAAU;IACzB,iEAAiE;IACjE,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,yCAAyC;IACzC,IAAI,EAAE,MAAM,CAAC;IACb,8BAA8B;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,oDAAoD;IACpD,QAAQ,EAAE,MAAM,CAAC;IACjB,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;CACd;AAED,4CAA4C;AAC5C,MAAM,WAAW,eAAe;IAC9B,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAC;IACjB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;CACd;AAED,kDAAkD;AAClD,MAAM,WAAW,aAAa;IAC5B,6DAA6D;IAC7D,QAAQ,EAAE,UAAU,EAAE,CAAC;IACvB,wDAAwD;IACxD,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,8DAA8D;AAC9D,MAAM,WAAW,WAAW;IAC1B,mCAAmC;IACnC,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,uCAAuC;IACvC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,+CAA+C;IAC/C,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,kEAAkE;IAClE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,wDAAwD;IACxD,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAC;IACxB,yEAAyE;IACzE,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,kGAAkG;AAClG,MAAM,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,KAAK,OAAO,CAAC;AAExD,oCAAoC;AACpC,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,OAAO,GAAG,eAAe,CAAC;AAEtE,kCAAkC;AAClC,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,MAAM,CAAC;AAEhD,2CAA2C;AAC3C,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEnD,oCAAoC;AACpC,MAAM,WAAW,YAAY;IAC3B,2CAA2C;IAC3C,SAAS,EAAE,gBAAgB,CAAC;IAC5B,gDAAgD;IAChD,MAAM,EAAE,aAAa,CAAC;IACtB,2DAA2D;IAC3D,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,iEAAiE;IACjE,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,iCAAiC;AACjC,MAAM,WAAW,SAAS;IACxB,yBAAyB;IACzB,eAAe,EAAE,MAAM,CAAC;IACxB,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAC;IACjB,0BAA0B;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACxC,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAC;IAClB,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAC;IAClB,sFAAsF;IACtF,WAAW,EAAE,UAAU,CAAC;IACxB,uCAAuC;IACvC,WAAW,EAAE,UAAU,CAAC;IACxB,+BAA+B;IAC/B,cAAc,EAAE,UAAU,CAAC;IAC3B,wCAAwC;IACxC,aAAa,EAAE,UAAU,CAAC;IAC1B,4CAA4C;IAC5C,SAAS,EAAE,UAAU,CAAC;IACtB,qDAAqD;IACrD,YAAY,EAAE,UAAU,CAAC;IACzB,yDAAyD;IACzD,gBAAgB,EAAE,UAAU,CAAC;CAC9B;AAED,mDAAmD;AACnD,MAAM,WAAW,WAAW;IAC1B,kBAAkB;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,yCAAyC;IACzC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,6BAA6B;IAC7B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAC;CACd;AAED,0DAA0D;AAC1D,MAAM,WAAW,uBAAuB;IACtC;;;OAGG;IACH,YAAY,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;IAClD;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,iDAAiD;AACjD,MAAM,MAAM,kBAAkB,GAAG,CAC/B,KAAK,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,SAAS,EAAE,EACzC,cAAc,EAAE,MAAM,EACtB,YAAY,EAAE,MAAM,EACpB,aAAa,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,MAAM,EAC1C,YAAY,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EACxD,MAAM,CAAC,EAAE,aAAa,EACtB,OAAO,CAAC,EAAE,uBAAuB,KAC9B,WAAW,EAAE,GAAG,IAAI,CAAC"}

package/dist/utils.d.ts

@@ -5,7 +5,7 @@
  *
  * @module
  */
-import type { OsmTags } from "@osmix/shared/types";
+import type { OsmTags } from "@osmix/types";
 import type { DefaultSpeeds } from "./types.ts";
 /** Default speeds (km/h) by highway type. */
 export declare const DEFAULT_SPEEDS: DefaultSpeeds;

package/dist/utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAClD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAE/C,6CAA6C;AAC7C,eAAO,MAAM,cAAc,EAAE,aAoB5B,CAAA;AA6BD,qEAAqE;AACrE,wBAAgB,aAAa,CAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAChC,MAAM,GAAG,IAAI,CAqBf;AAED,wCAAwC;AACxC,wBAAgB,aAAa,CAC5B,IAAI,EAAE,OAAO,GAAG,SAAS,EACzB,aAAa,GAAE,aAA8B,GAC3C,MAAM,CAUR;AAED,+CAA+C;AAC/C,wBAAgB,oBAAoB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAG5D;AAED,gCAAgC;AAChC,wBAAgB,uBAAuB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAG/D"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAE5C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,6CAA6C;AAC7C,eAAO,MAAM,cAAc,EAAE,aAoB5B,CAAC;AAuBF,qEAAqE;AACrE,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,IAAI,CAqB/E;AAED,wCAAwC;AACxC,wBAAgB,aAAa,CAC3B,IAAI,EAAE,OAAO,GAAG,SAAS,EACzB,aAAa,GAAE,aAA8B,GAC5C,MAAM,CAUR;AAED,+CAA+C;AAC/C,wBAAgB,oBAAoB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAG5D;AAED,gCAAgC;AAChC,wBAAgB,uBAAuB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAG/D"}

package/dist/utils.js

@@ -45,13 +45,7 @@ const VEHICLE_HIGHWAYS = new Set([
     "service",
 ]);
 /** Footways included in default pedestrian routing. */
-const FOOT_HIGHWAYS = new Set([
-    "footway",
-    "path",
-    "cycleway",
-    "bridleway",
-    "steps",
-]);
+const FOOT_HIGHWAYS = new Set(["footway", "path", "cycleway", "bridleway", "steps"]);
 /** Parse maxspeed tag to km/h. Handles "50", "50 km/h", "30 mph". */
 export function parseMaxSpeed(value) {
     if (!value)

package/dist/utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAKH,6CAA6C;AAC7C,MAAM,CAAC,MAAM,cAAc,GAAkB;IAC5C,QAAQ,EAAE,GAAG;IACb,aAAa,EAAE,EAAE;IACjB,KAAK,EAAE,GAAG;IACV,UAAU,EAAE,EAAE;IACd,OAAO,EAAE,EAAE;IACX,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE,EAAE;IAClB,QAAQ,EAAE,EAAE;IACZ,aAAa,EAAE,EAAE;IACjB,YAAY,EAAE,EAAE;IAChB,WAAW,EAAE,EAAE;IACf,aAAa,EAAE,EAAE;IACjB,OAAO,EAAE,EAAE;IACX,OAAO,EAAE,CAAC;IACV,IAAI,EAAE,CAAC;IACP,QAAQ,EAAE,EAAE;IACZ,SAAS,EAAE,EAAE;IACb,KAAK,EAAE,CAAC;CACR,CAAA;AAED,oDAAoD;AACpD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAChC,UAAU;IACV,eAAe;IACf,OAAO;IACP,YAAY;IACZ,SAAS;IACT,cAAc;IACd,WAAW;IACX,gBAAgB;IAChB,UAAU;IACV,eAAe;IACf,cAAc;IACd,aAAa;IACb,eAAe;IACf,SAAS;CACT,CAAC,CAAA;AAEF,uDAAuD;AACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC7B,SAAS;IACT,MAAM;IACN,UAAU;IACV,WAAW;IACX,OAAO;CACP,CAAC,CAAA;AAEF,qEAAqE;AACrE,MAAM,UAAU,aAAa,CAC5B,KAAkC;IAElC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAA;IAEvB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;IAE9C,uBAAuB;IACvB,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACpC,IAAI,OAAO;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAA;IAEpD,gBAAgB;IAChB,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAA;IAClD,IAAI,GAAG;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAA;IAE5C,cAAc;IACd,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,CAAA;IACtC,IAAI,GAAG;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAA;IAElE,iBAAiB;IACjB,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;QAAE,OAAO,CAAC,CAAA;IAE9C,OAAO,IAAI,CAAA;AACZ,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,aAAa,CAC5B,IAAyB,EACzB,aAAa,GAAkB,cAAc;IAE7C,IAAI,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAA;QAC9C,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,MAAM,CAAA;IACnC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACvE,IAAI,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC;QAAE,OAAO,aAAa,CAAC,OAAO,CAAE,CAAA;IAErE,OAAO,EAAE,CAAA;AACV,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,oBAAoB,CAAC,IAAc;IAClD,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,OAAO,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;AACrD,CAAC;AAED,gCAAgC;AAChC,MAAM,UAAU,uBAAuB,CAAC,IAAc;IACrD,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,OAAO,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;AAClD,CAAC"}
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAMH,6CAA6C;AAC7C,MAAM,CAAC,MAAM,cAAc,GAAkB;IAC3C,QAAQ,EAAE,GAAG;IACb,aAAa,EAAE,EAAE;IACjB,KAAK,EAAE,GAAG;IACV,UAAU,EAAE,EAAE;IACd,OAAO,EAAE,EAAE;IACX,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE,EAAE;IAClB,QAAQ,EAAE,EAAE;IACZ,aAAa,EAAE,EAAE;IACjB,YAAY,EAAE,EAAE;IAChB,WAAW,EAAE,EAAE;IACf,aAAa,EAAE,EAAE;IACjB,OAAO,EAAE,EAAE;IACX,OAAO,EAAE,CAAC;IACV,IAAI,EAAE,CAAC;IACP,QAAQ,EAAE,EAAE;IACZ,SAAS,EAAE,EAAE;IACb,KAAK,EAAE,CAAC;CACT,CAAC;AAEF,oDAAoD;AACpD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,UAAU;IACV,eAAe;IACf,OAAO;IACP,YAAY;IACZ,SAAS;IACT,cAAc;IACd,WAAW;IACX,gBAAgB;IAChB,UAAU;IACV,eAAe;IACf,cAAc;IACd,aAAa;IACb,eAAe;IACf,SAAS;CACV,CAAC,CAAC;AAEH,uDAAuD;AACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC;AAErF,qEAAqE;AACrE,MAAM,UAAU,aAAa,CAAC,KAAkC;IAC9D,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAExB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE/C,uBAAuB;IACvB,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACrC,IAAI,OAAO;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAC;IAErD,gBAAgB;IAChB,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;IACnD,IAAI,GAAG;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAC;IAE7C,cAAc;IACd,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACvC,IAAI,GAAG;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC;IAEnE,iBAAiB;IACjB,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC;IAE/C,OAAO,IAAI,CAAC;AACd,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,aAAa,CAC3B,IAAyB,EACzB,aAAa,GAAkB,cAAc;IAE7C,IAAI,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/C,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,MAAM,CAAC;IACrC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxE,IAAI,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC;QAAE,OAAO,aAAa,CAAC,OAAO,CAAE,CAAC;IAEtE,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,oBAAoB,CAAC,IAAc;IACjD,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,OAAO,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,gCAAgC;AAChC,MAAM,UAAU,uBAAuB,CAAC,IAAc;IACpD,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,OAAO,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC"}

package/package.json

@@ -1,30 +1,33 @@
 {
-	"$schema": "https://json.schemastore.org/package.json",
-	"name": "@osmix/router",
-	"type": "module",
-	"version": "0.0.13",
-	"description": "A routing engine for OSM data built on top of @osmix/core",
-	"license": "MIT",
-	"repository": {
-		"type": "git",
-		"url": "git+https://github.com/conveyal/osmix.git"
-	},
-	"main": "./dist/index.js",
-	"scripts": {
-		"build": "tsc -p tsconfig.build.json",
-		"bench": "bun run test/router.bench.ts",
-		"test": "bun test",
-		"typecheck": "tsc --noEmit"
-	},
-	"devDependencies": {
-		"@types/bun": "^1.3.14",
-		"mitata": "^1.0.34",
-		"osmix": "0.2.2",
-		"typescript": "npm:typescript@rc"
-	},
-	"dependencies": {
-		"@osmix/core": "0.1.10",
-		"@osmix/shared": "0.0.13"
-	},
-	"types": "./dist/index.d.ts"
-}
+  "$schema": "https://json.schemastore.org/package.json",
+  "name": "@osmix/router",
+  "version": "0.1.0",
+  "description": "A routing engine for OSM data built on top of @osmix/core",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/conveyal/osmix.git"
+  },
+  "type": "module",
+  "main": "./dist/index.js",
+  "dependencies": {
+    "@osmix/core": "0.3.0",
+    "@osmix/geo": "0.1.1",
+    "@osmix/shared": "0.2.0",
+    "@osmix/types": "0.2.0"
+  },
+  "devDependencies": {
+    "@osmix/load": "0.1.0",
+    "@osmix/test-utils": "0.1.0",
+    "mitata": "^1.0.34",
+    "typescript": "^7.0.2"
+  },
+  "engines": {
+    "node": ">=24"
+  },
+  "types": "./dist/index.d.ts",
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "bench": "node test/router.bench.ts"
+  }
+}

package/src/algorithms/bidirectional.ts

@@ -1,147 +1,135 @@
 /**
- * Bidirectional breadth-first search algorithm.
+ * Bidirectional Dijkstra.
  *
- * Searches from both start and end simultaneously, terminating when the
- * frontiers meet. Very fast for finding any path, but does not guarantee
- * the shortest path. Use Dijkstra or A* when optimality is required.
+ * Runs Dijkstra forward from the start over outgoing edges and backward from
+ * the end over incoming edges, and stops when neither search can improve the
+ * best meeting point. Returns an optimal path and respects one-way edges.
  *
  * @module
  */
 
-import type { PathSegment, RoutingAlgorithmFn } from "../types.ts"
+import { BinaryHeap } from "../binary-heap.ts";
+import type { GraphEdge, PathSegment, RoutingAlgorithmFn } from "../types.ts";
+
+/** How the backward search reached a node: the next node toward the end. */
+interface BackwardStep {
+  nextNodeIndex: number;
+  wayIndex: number;
+}
 
 /**
- * Bidirectional BFS - fast path finding from both ends.
- *
- * Uses breadth-first search from both start and end, terminating when
- * the frontiers meet. Very fast for finding any path, though not always
- * the optimal shortest path. Use Dijkstra or A* if optimality is required.
+ * Bidirectional Dijkstra. Requires `context.reverseGraph`, which `Router`
+ * supplies from `RoutingGraph.getIncomingEdges`.
  */
 export const bidirectional: RoutingAlgorithmFn = (
-	graph,
-	start,
-	end,
-	getWeight,
+  graph,
+  start,
+  end,
+  getWeight,
+  _getCoord,
+  _metric,
+  context,
 ) => {
-	if (start === end) return [{ nodeIndex: start, cost: 0 }]
-
-	// Forward search state
-	const fDist = new Map<number, number>()
-	const fPrev = new Map<number, PathSegment>()
-	const fQueue: number[] = [start]
-
-	// Backward search state
-	const bDist = new Map<number, number>()
-	const bPrev = new Map<number, PathSegment>()
-	const bQueue: number[] = [end]
-
-	fDist.set(start, 0)
-	bDist.set(end, 0)
-
-	let meetNode: number | null = null
-
-	while (fQueue.length > 0 && bQueue.length > 0) {
-		// Expand forward
-		if (fQueue.length > 0) {
-			const current = fQueue.shift()!
-			const currentD = fDist.get(current)!
-
-			// Check if backward search reached this node
-			if (bDist.has(current)) {
-				meetNode = current
-				break
-			}
-
-			for (const edge of graph(current)) {
-				const neighbor = edge.targetNodeIndex
-				if (fDist.has(neighbor)) continue
-
-				const newD = currentD + getWeight(edge)
-				fDist.set(neighbor, newD)
-				fPrev.set(neighbor, {
-					nodeIndex: neighbor,
-					wayIndex: edge.wayIndex,
-					previousNodeIndex: current,
-					cost: newD,
-				})
-				fQueue.push(neighbor)
-
-				if (bDist.has(neighbor)) {
-					meetNode = neighbor
-					break
-				}
-			}
-
-			if (meetNode !== null) break
-		}
-
-		// Expand backward
-		if (bQueue.length > 0) {
-			const current = bQueue.shift()!
-			const currentD = bDist.get(current)!
-
-			// Check if forward search reached this node
-			if (fDist.has(current)) {
-				meetNode = current
-				break
-			}
-
-			for (const edge of graph(current)) {
-				const neighbor = edge.targetNodeIndex
-				if (bDist.has(neighbor)) continue
-
-				const newD = currentD + getWeight(edge)
-				bDist.set(neighbor, newD)
-				bPrev.set(neighbor, {
-					nodeIndex: neighbor,
-					wayIndex: edge.wayIndex,
-					previousNodeIndex: current,
-					cost: newD,
-				})
-				bQueue.push(neighbor)
-
-				if (fDist.has(neighbor)) {
-					meetNode = neighbor
-					break
-				}
-			}
-
-			if (meetNode !== null) break
-		}
-	}
-
-	if (meetNode === null) return null
-
-	// Build forward path: start -> meet
-	const forward: PathSegment[] = []
-	let curr: number | undefined = meetNode
-	while (curr !== undefined && curr !== start) {
-		const seg = fPrev.get(curr)
-		if (!seg) break
-		forward.unshift(seg)
-		curr = seg.previousNodeIndex
-	}
-	forward.unshift({ nodeIndex: start, cost: 0 })
-
-	// Build backward path: meet -> end (reverse direction)
-	// bDist represents distance FROM end TO node, so it decreases as we approach end.
-	// Correct cost = forward cost to meet + (backward dist at meet - backward dist at curr)
-	const meetForwardCost = fDist.get(meetNode)!
-	const meetBackwardCost = bDist.get(meetNode)!
-	curr = meetNode
-	while (curr !== undefined && curr !== end) {
-		const seg = bPrev.get(curr)
-		if (!seg) break
-		curr = seg.previousNodeIndex
-		if (curr !== undefined) {
-			forward.push({
-				nodeIndex: curr,
-				wayIndex: seg.wayIndex,
-				previousNodeIndex: seg.nodeIndex,
-				cost: meetForwardCost + meetBackwardCost - (bDist.get(curr) ?? 0),
-			})
-		}
-	}
-
-	return forward
-}
+  if (start === end) return [{ nodeIndex: start, cost: 0 }];
+  const reverseGraph = context?.reverseGraph;
+  if (!reverseGraph) {
+    throw Error(
+      "Bidirectional routing needs context.reverseGraph (incoming edges). " +
+        "Router passes RoutingGraph.getIncomingEdges.",
+    );
+  }
+
+  const fDist = new Map<number, number>([[start, 0]]);
+  const bDist = new Map<number, number>([[end, 0]]);
+  const fPrev = new Map<number, PathSegment>();
+  const bNext = new Map<number, BackwardStep>();
+  const fHeap = new BinaryHeap();
+  const bHeap = new BinaryHeap();
+  const fClosed = new Set<number>();
+  const bClosed = new Set<number>();
+  fHeap.push(start, 0);
+  bHeap.push(end, 0);
+
+  let best = Number.POSITIVE_INFINITY;
+  let meet = -1;
+
+  const relax = (
+    current: number,
+    edges: GraphEdge[],
+    dist: Map<number, number>,
+    otherDist: Map<number, number>,
+    closed: Set<number>,
+    heap: BinaryHeap,
+    record: (neighbor: number, edge: GraphEdge, cost: number) => void,
+  ) => {
+    const currentD = dist.get(current)!;
+    for (const edge of edges) {
+      const neighbor = edge.targetNodeIndex;
+      if (closed.has(neighbor)) continue;
+      const cost = currentD + getWeight(edge);
+      const existing = dist.get(neighbor);
+      if (existing !== undefined && cost >= existing) continue;
+      dist.set(neighbor, cost);
+      record(neighbor, edge, cost);
+      heap.push(neighbor, cost);
+      const other = otherDist.get(neighbor);
+      if (other !== undefined && cost + other < best) {
+        best = cost + other;
+        meet = neighbor;
+      }
+    }
+  };
+
+  while (fHeap.size > 0 && bHeap.size > 0) {
+    // Stop once no unsettled node can lie on a path shorter than `best`.
+    if (fHeap.peekPriority() + bHeap.peekPriority() >= best) break;
+
+    if (fHeap.peekPriority() <= bHeap.peekPriority()) {
+      const current = fHeap.pop()!;
+      if (fClosed.has(current)) continue;
+      fClosed.add(current);
+      relax(current, graph(current), fDist, bDist, fClosed, fHeap, (neighbor, edge, cost) => {
+        fPrev.set(neighbor, {
+          nodeIndex: neighbor,
+          wayIndex: edge.wayIndex,
+          previousNodeIndex: current,
+          cost,
+        });
+      });
+    } else {
+      const current = bHeap.pop()!;
+      if (bClosed.has(current)) continue;
+      bClosed.add(current);
+      relax(current, reverseGraph(current), bDist, fDist, bClosed, bHeap, (neighbor, edge) => {
+        bNext.set(neighbor, { nextNodeIndex: current, wayIndex: edge.wayIndex });
+      });
+    }
+  }
+
+  if (meet === -1) return null;
+
+  // Forward half: start → meet.
+  const path: PathSegment[] = [];
+  let node = meet;
+  while (node !== start) {
+    const segment = fPrev.get(node)!;
+    path.unshift(segment);
+    node = segment.previousNodeIndex!;
+  }
+  path.unshift({ nodeIndex: start, cost: 0 });
+
+  // Backward half: meet → end, with costs measured from the start.
+  node = meet;
+  while (node !== end) {
+    const step = bNext.get(node)!;
+    path.push({
+      nodeIndex: step.nextNodeIndex,
+      wayIndex: step.wayIndex,
+      previousNodeIndex: node,
+      cost: best - bDist.get(step.nextNodeIndex)!,
+    });
+    node = step.nextNodeIndex;
+  }
+
+  return path;
+};

package/src/algorithms/index.ts

@@ -4,20 +4,20 @@
  * Provides three algorithms:
  * - `dijkstra`: Optimal shortest path, explores all directions equally.
  * - `astar`: Optimal with heuristic guidance, faster for point-to-point.
- * - `bidirectional`: Fast BFS from both ends, finds *a* path (not always optimal).
+ * - `bidirectional`: Optimal Dijkstra from both ends; needs `context.reverseGraph`.
  *
  * @module
  */
 
-import type { RoutingAlgorithm, RoutingAlgorithmFn } from "../types.ts"
-import { bidirectional } from "./bidirectional.ts"
-import { astar, dijkstra } from "./shortest-path.ts"
+import type { RoutingAlgorithm, RoutingAlgorithmFn } from "../types.ts";
+import { bidirectional } from "./bidirectional.ts";
+import { astar, dijkstra } from "./shortest-path.ts";
 
-export type { RoutingAlgorithmFn }
-export { astar, bidirectional, dijkstra }
+export type { RoutingAlgorithmFn };
+export { astar, bidirectional, dijkstra };
 
 export const routingAlgorithms: Record<RoutingAlgorithm, RoutingAlgorithmFn> = {
-	dijkstra,
-	astar,
-	bidirectional,
-}
+  dijkstra,
+  astar,
+  bidirectional,
+};