@osmix/router 0.0.4 → 0.0.6

package/dist/graph.d.ts

@@ -0,0 +1,135 @@
+/**
+ * Routing graph construction from OSM data.
+ *
+ * Builds a directed graph from OSM ways suitable for pathfinding. Edges are
+ * created between consecutive nodes in each way, with pre-computed distance
+ * and time costs. Respects one-way restrictions.
+ *
+ * Uses CSR (Compressed Sparse Row) format for efficient storage and
+ * zero-copy transfer between workers via SharedArrayBuffer.
+ *
+ * @module
+ */
+import { type Osm } from "@osmix/core";
+import type { LonLat } from "@osmix/shared/types";
+import type { DefaultSpeeds, GraphEdge, HighwayFilter, RoutingGraphTransferables } from "./types";
+/**
+ * Routing graph built from OSM ways and nodes.
+ *
+ * Uses CSR (Compressed Sparse Row) format internally for memory efficiency
+ * and zero-copy transfer between workers.
+ *
+ * @example Build from OSM data
+ * ```ts
+ * const graph = new RoutingGraph(osm)
+ * const route = router.route(graph, startNode, endNode)
+ * ```
+ *
+ * @example Transfer between workers
+ * ```ts
+ * // In source worker
+ * const buffers = graph.transferables()
+ * Comlink.transfer(buffers, getTransferableBuffers(buffers))
+ *
+ * // In target worker
+ * const graph = new RoutingGraph(buffers)
+ * ```
+ */
+export declare class RoutingGraph {
+    /** Total number of nodes in the source OSM data. */
+    private nodeCount;
+    /** Total number of edges in the graph. */
+    private edgeCount;
+    private edgeOffsets;
+    private edgeTargets;
+    private edgeWayIndexes;
+    private edgeDistances;
+    private edgeTimes;
+    private routableBits;
+    private intersectionBits;
+    readonly filter: HighwayFilter;
+    readonly defaultSpeeds: DefaultSpeeds;
+    /**
+     * Create a RoutingGraph.
+     *
+     * @param source - Either an Osm instance to build from, or RoutingGraphTransferables to reconstruct.
+     * @param filter - Function to determine which ways are routable (only used when building from Osm).
+     * @param defaultSpeeds - Speed limits by highway type (only used when building from Osm).
+     */
+    constructor(source: Osm | RoutingGraphTransferables, filter?: HighwayFilter, defaultSpeeds?: DefaultSpeeds);
+    /**
+     * Reconstruct from transferables (worker transfer).
+     */
+    private fromTransferables;
+    /**
+     * Build the graph from OSM data.
+     */
+    private buildFromOsm;
+    /**
+     * Check if a node is part of the routable network.
+     */
+    isRoutable(nodeIndex: number): boolean;
+    /**
+     * Check if a node is an intersection (multiple ways meet).
+     */
+    isIntersection(nodeIndex: number): boolean;
+    /**
+     * Get outgoing edges from a node.
+     */
+    getEdges(nodeIndex: number): GraphEdge[];
+    /**
+     * Get transferable buffers for passing to another thread.
+     */
+    transferables(): RoutingGraphTransferables;
+    /**
+     * Get the number of nodes in the graph.
+     */
+    get size(): number;
+    /**
+     * Get the number of edges in the graph.
+     */
+    get edges(): number;
+    /**
+     * Find the nearest routable OSM node from a geographic point.
+     *
+     * Searches for nodes within the given radius that are part of the routing
+     * graph (i.e., lie on a routable way). Returns the closest match with its
+     * coordinates and distance.
+     *
+     * @param osm - The OSM dataset.
+     * @param point - The [lon, lat] coordinates to search from.
+     * @param maxDistanceM - Maximum search radius in meters.
+     * @returns The nearest routable node, or null if none found.
+     *
+     * @example
+     * ```ts
+     * const nearest = graph.findNearestNodeOnGraph(osm, [-73.989, 40.733], 0.5)
+     * if (nearest) {
+     *   console.log(`Found node ${nearest.nodeIndex} at ${nearest.distance}m`)
+     * }
+     * ```
+     */
+    findNearestRoutableNode(osm: Osm, point: LonLat, maxDistanceM: number): {
+        nodeIndex: number;
+        coordinates: LonLat;
+        distance: number;
+    } | null;
+}
+/**
+ * Build a routing graph from OSM ways.
+ *
+ * Convenience function that creates a RoutingGraph.
+ *
+ * @param osm - The OSM dataset to build from.
+ * @param filter - Function to determine which ways are routable.
+ * @param defaultSpeeds - Speed limits (km/h) by highway type.
+ * @returns A RoutingGraph ready for pathfinding.
+ */
+export declare function buildGraph(osm: Osm, filter?: HighwayFilter, defaultSpeeds?: DefaultSpeeds): RoutingGraph;
+/**
+ * Get an array of buffers suitable for Comlink.transfer() or postMessage transfer list.
+ * Note: SharedArrayBuffers don't need to be transferred (they're shared automatically),
+ * but ArrayBuffers do. This returns only the ArrayBuffers that need explicit transfer.
+ */
+export declare function getTransferableBuffers(t: RoutingGraphTransferables): ArrayBuffer[];
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAsC,KAAK,GAAG,EAAE,MAAM,aAAa,CAAA;AAE1E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AACjD,OAAO,KAAK,EACX,aAAa,EACb,SAAS,EACT,aAAa,EACb,yBAAyB,EACzB,MAAM,SAAS,CAAA;AAGhB;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,YAAY;IACxB,oDAAoD;IACpD,OAAO,CAAC,SAAS,CAAI;IACrB,0CAA0C;IAC1C,OAAO,CAAC,SAAS,CAAI;IAGrB,OAAO,CAAC,WAAW,CAA2B;IAC9C,OAAO,CAAC,WAAW,CAA2B;IAC9C,OAAO,CAAC,cAAc,CAA2B;IACjD,OAAO,CAAC,aAAa,CAA4B;IACjD,OAAO,CAAC,SAAS,CAA4B;IAC7C,OAAO,CAAC,YAAY,CAA0B;IAC9C,OAAO,CAAC,gBAAgB,CAA0B;IAGlD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;IAC9B,QAAQ,CAAC,aAAa,EAAE,aAAa,CAAA;IAErC;;;;;;OAMG;gBAEF,MAAM,EAAE,GAAG,GAAG,yBAAyB,EACvC,MAAM,GAAE,aAAoC,EAC5C,aAAa,GAAE,aAA8B;IAa9C;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;OAEG;IACH,OAAO,CAAC,YAAY;IA0IpB;;OAEG;IACH,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO;IAOtC;;OAEG;IACH,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO;IAO1C;;OAEG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,EAAE;IA0BxC;;OAEG;IACH,aAAa,IAAI,yBAAyB;IAc1C;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,uBAAuB,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;mBAQxD,MAAM;qBACJ,MAAM;kBACT,MAAM;;CAiBlB;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CACzB,GAAG,EAAE,GAAG,EACR,MAAM,GAAE,aAAoC,EAC5C,aAAa,GAAE,aAA8B,GAC3C,YAAY,CAEd;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CACrC,CAAC,EAAE,yBAAyB,GAC1B,WAAW,EAAE,CAef"}

package/dist/graph.js

@@ -0,0 +1,339 @@
+/**
+ * Routing graph construction from OSM data.
+ *
+ * Builds a directed graph from OSM ways suitable for pathfinding. Edges are
+ * created between consecutive nodes in each way, with pre-computed distance
+ * and time costs. Respects one-way restrictions.
+ *
+ * Uses CSR (Compressed Sparse Row) format for efficient storage and
+ * zero-copy transfer between workers via SharedArrayBuffer.
+ *
+ * @module
+ */
+import { BufferConstructor } from "@osmix/core";
+import { haversineDistance } from "@osmix/shared/haversine-distance";
+import { DEFAULT_SPEEDS, defaultHighwayFilter, getSpeedLimit } from "./utils";
+/**
+ * Routing graph built from OSM ways and nodes.
+ *
+ * Uses CSR (Compressed Sparse Row) format internally for memory efficiency
+ * and zero-copy transfer between workers.
+ *
+ * @example Build from OSM data
+ * ```ts
+ * const graph = new RoutingGraph(osm)
+ * const route = router.route(graph, startNode, endNode)
+ * ```
+ *
+ * @example Transfer between workers
+ * ```ts
+ * // In source worker
+ * const buffers = graph.transferables()
+ * Comlink.transfer(buffers, getTransferableBuffers(buffers))
+ *
+ * // In target worker
+ * const graph = new RoutingGraph(buffers)
+ * ```
+ */
+export class RoutingGraph {
+    /** Total number of nodes in the source OSM data. */
+    nodeCount = 0;
+    /** Total number of edges in the graph. */
+    edgeCount = 0;
+    // CSR format arrays (populated after compact())
+    edgeOffsets = null;
+    edgeTargets = null;
+    edgeWayIndexes = null;
+    edgeDistances = null;
+    edgeTimes = null;
+    routableBits = null;
+    intersectionBits = null;
+    // Expose highway filter and default speeds
+    filter;
+    defaultSpeeds;
+    /**
+     * Create a RoutingGraph.
+     *
+     * @param source - Either an Osm instance to build from, or RoutingGraphTransferables to reconstruct.
+     * @param filter - Function to determine which ways are routable (only used when building from Osm).
+     * @param defaultSpeeds - Speed limits by highway type (only used when building from Osm).
+     */
+    constructor(source, filter = defaultHighwayFilter, defaultSpeeds = DEFAULT_SPEEDS) {
+        this.filter = filter;
+        this.defaultSpeeds = defaultSpeeds;
+        if ("nodeCount" in source) {
+            // Reconstruct from transferables
+            this.fromTransferables(source);
+        }
+        else {
+            // Build from OSM data
+            this.buildFromOsm(source, filter, defaultSpeeds);
+        }
+    }
+    /**
+     * Reconstruct from transferables (worker transfer).
+     */
+    fromTransferables(t) {
+        this.nodeCount = t.nodeCount;
+        this.edgeCount = t.edgeCount;
+        this.edgeOffsets = new Uint32Array(t.edgeOffsets);
+        this.edgeTargets = new Uint32Array(t.edgeTargets);
+        this.edgeWayIndexes = new Uint32Array(t.edgeWayIndexes);
+        this.edgeDistances = new Float32Array(t.edgeDistances);
+        this.edgeTimes = new Float32Array(t.edgeTimes);
+        this.routableBits = new Uint8Array(t.routableBits);
+        this.intersectionBits = new Uint8Array(t.intersectionBits);
+    }
+    /**
+     * Build the graph from OSM data.
+     */
+    buildFromOsm(osm, filter, defaultSpeeds) {
+        this.nodeCount = osm.nodes.size;
+        const tempEdges = new Map();
+        const tempRoutable = new Set();
+        const tempIntersections = new Set();
+        const addEdgeToNode = (from, edge) => {
+            let nodeEdges = tempEdges.get(from);
+            if (!nodeEdges) {
+                nodeEdges = [];
+                tempEdges.set(from, nodeEdges);
+            }
+            nodeEdges.push(edge);
+        };
+        for (let wayIndex = 0; wayIndex < osm.ways.size; wayIndex++) {
+            const tags = osm.ways.tags.getTags(wayIndex);
+            if (!filter(tags))
+                continue;
+            const refs = osm.ways.getRefIds(wayIndex);
+            if (refs.length < 2)
+                continue;
+            // Create bidirectional edges between consecutive nodes (respecting one-way)
+            const oneway = tags?.["oneway"] === "yes" || tags?.["oneway"] === "1";
+            const speedKph = getSpeedLimit(tags, defaultSpeeds);
+            const speedMps = (speedKph * 1_000) / 60 / 60;
+            const nodes = refs.map((ref) => osm.nodes.ids.getIndexFromId(ref));
+            for (let i = 0; i < nodes.length - 1; i++) {
+                const nodeIndex = nodes[i];
+                const targetNodeIndex = nodes[i + 1];
+                const fromCoord = osm.nodes.getNodeLonLat({ index: nodeIndex });
+                const targetCoord = osm.nodes.getNodeLonLat({ index: targetNodeIndex });
+                const distanceM = haversineDistance(fromCoord, targetCoord);
+                const time = distanceM / speedMps;
+                // Forward edge
+                addEdgeToNode(nodeIndex, {
+                    targetNodeIndex: targetNodeIndex,
+                    wayIndex,
+                    distance: distanceM,
+                    time,
+                });
+                this.edgeCount++;
+                // Reverse edge (unless one-way)
+                if (!oneway) {
+                    addEdgeToNode(targetNodeIndex, {
+                        targetNodeIndex: nodeIndex,
+                        wayIndex,
+                        distance: distanceM,
+                        time,
+                    });
+                    this.edgeCount++;
+                }
+                // Track routable nodes and intersections (nodes appearing in multiple ways)
+                if (tempRoutable.has(nodeIndex)) {
+                    tempIntersections.add(nodeIndex);
+                }
+                else {
+                    tempRoutable.add(nodeIndex);
+                }
+                if (tempRoutable.has(targetNodeIndex)) {
+                    tempIntersections.add(targetNodeIndex);
+                }
+                else {
+                    tempRoutable.add(targetNodeIndex);
+                }
+            }
+        }
+        // Convert to CSR format and free temporary structures
+        // Allocate CSR arrays
+        const offsetsBuffer = new BufferConstructor((this.nodeCount + 1) * Uint32Array.BYTES_PER_ELEMENT);
+        const targetsBuffer = new BufferConstructor(this.edgeCount * Uint32Array.BYTES_PER_ELEMENT);
+        const wayIndexesBuffer = new BufferConstructor(this.edgeCount * Uint32Array.BYTES_PER_ELEMENT);
+        const distancesBuffer = new BufferConstructor(this.edgeCount * Float32Array.BYTES_PER_ELEMENT);
+        const timesBuffer = new BufferConstructor(this.edgeCount * Float32Array.BYTES_PER_ELEMENT);
+        this.edgeOffsets = new Uint32Array(offsetsBuffer);
+        this.edgeTargets = new Uint32Array(targetsBuffer);
+        this.edgeWayIndexes = new Uint32Array(wayIndexesBuffer);
+        this.edgeDistances = new Float32Array(distancesBuffer);
+        this.edgeTimes = new Float32Array(timesBuffer);
+        // Build CSR format: iterate through all nodes in order
+        let edgeIndex = 0;
+        for (let nodeIndex = 0; nodeIndex < this.nodeCount; nodeIndex++) {
+            this.edgeOffsets[nodeIndex] = edgeIndex;
+            const edges = tempEdges.get(nodeIndex);
+            if (edges) {
+                for (const edge of edges) {
+                    this.edgeTargets[edgeIndex] = edge.targetNodeIndex;
+                    this.edgeWayIndexes[edgeIndex] = edge.wayIndex;
+                    this.edgeDistances[edgeIndex] = edge.distance;
+                    this.edgeTimes[edgeIndex] = edge.time;
+                    edgeIndex++;
+                }
+            }
+        }
+        this.edgeOffsets[this.nodeCount] = edgeIndex;
+        // Build bitsets for routable and intersection flags
+        const bitsetLength = Math.ceil(this.nodeCount / 8);
+        const routableBuffer = new BufferConstructor(bitsetLength);
+        const intersectionBuffer = new BufferConstructor(bitsetLength);
+        this.routableBits = new Uint8Array(routableBuffer);
+        this.intersectionBits = new Uint8Array(intersectionBuffer);
+        for (const nodeIndex of tempRoutable) {
+            const byteIndex = nodeIndex >> 3;
+            const bitMask = 1 << (nodeIndex & 7);
+            this.routableBits[byteIndex] |= bitMask;
+        }
+        for (const nodeIndex of tempIntersections) {
+            const byteIndex = nodeIndex >> 3;
+            const bitMask = 1 << (nodeIndex & 7);
+            this.intersectionBits[byteIndex] |= bitMask;
+        }
+    }
+    /**
+     * Check if a node is part of the routable network.
+     */
+    isRoutable(nodeIndex) {
+        if (nodeIndex < 0 || nodeIndex >= this.nodeCount)
+            return false;
+        const byteIndex = nodeIndex >> 3;
+        const bitMask = 1 << (nodeIndex & 7);
+        return (this.routableBits[byteIndex] & bitMask) !== 0;
+    }
+    /**
+     * Check if a node is an intersection (multiple ways meet).
+     */
+    isIntersection(nodeIndex) {
+        if (nodeIndex < 0 || nodeIndex >= this.nodeCount)
+            return false;
+        const byteIndex = nodeIndex >> 3;
+        const bitMask = 1 << (nodeIndex & 7);
+        return (this.intersectionBits[byteIndex] & bitMask) !== 0;
+    }
+    /**
+     * Get outgoing edges from a node.
+     */
+    getEdges(nodeIndex) {
+        if (nodeIndex < 0 ||
+            nodeIndex >= this.nodeCount ||
+            !this.edgeOffsets ||
+            !this.edgeTargets) {
+            return [];
+        }
+        const start = this.edgeOffsets[nodeIndex];
+        const end = this.edgeOffsets[nodeIndex + 1];
+        const edges = [];
+        for (let i = start; i < end; i++) {
+            edges.push({
+                targetNodeIndex: this.edgeTargets[i],
+                wayIndex: this.edgeWayIndexes[i],
+                distance: this.edgeDistances[i],
+                time: this.edgeTimes[i],
+            });
+        }
+        return edges;
+    }
+    /**
+     * Get transferable buffers for passing to another thread.
+     */
+    transferables() {
+        return {
+            nodeCount: this.nodeCount,
+            edgeCount: this.edgeCount,
+            edgeOffsets: this.edgeOffsets.buffer,
+            edgeTargets: this.edgeTargets.buffer,
+            edgeWayIndexes: this.edgeWayIndexes.buffer,
+            edgeDistances: this.edgeDistances.buffer,
+            edgeTimes: this.edgeTimes.buffer,
+            routableBits: this.routableBits.buffer,
+            intersectionBits: this.intersectionBits.buffer,
+        };
+    }
+    /**
+     * Get the number of nodes in the graph.
+     */
+    get size() {
+        return this.nodeCount;
+    }
+    /**
+     * Get the number of edges in the graph.
+     */
+    get edges() {
+        return this.edgeCount;
+    }
+    /**
+     * Find the nearest routable OSM node from a geographic point.
+     *
+     * Searches for nodes within the given radius that are part of the routing
+     * graph (i.e., lie on a routable way). Returns the closest match with its
+     * coordinates and distance.
+     *
+     * @param osm - The OSM dataset.
+     * @param point - The [lon, lat] coordinates to search from.
+     * @param maxDistanceM - Maximum search radius in meters.
+     * @returns The nearest routable node, or null if none found.
+     *
+     * @example
+     * ```ts
+     * const nearest = graph.findNearestNodeOnGraph(osm, [-73.989, 40.733], 0.5)
+     * if (nearest) {
+     *   console.log(`Found node ${nearest.nodeIndex} at ${nearest.distance}m`)
+     * }
+     * ```
+     */
+    findNearestRoutableNode(osm, point, maxDistanceM) {
+        const nearby = osm.nodes.findIndexesWithinRadius(point[0], point[1], maxDistanceM / 1_000);
+        let best = null;
+        let bestDistM = Number.POSITIVE_INFINITY;
+        for (const nodeIndex of nearby) {
+            if (!this.isRoutable(nodeIndex))
+                continue;
+            const nodeCoord = osm.nodes.getNodeLonLat({ index: nodeIndex });
+            const distance = haversineDistance(point, nodeCoord);
+            if (distance < bestDistM && distance <= maxDistanceM) {
+                bestDistM = distance;
+                best = { nodeIndex, coordinates: nodeCoord, distance };
+            }
+        }
+        return best;
+    }
+}
+/**
+ * Build a routing graph from OSM ways.
+ *
+ * Convenience function that creates a RoutingGraph.
+ *
+ * @param osm - The OSM dataset to build from.
+ * @param filter - Function to determine which ways are routable.
+ * @param defaultSpeeds - Speed limits (km/h) by highway type.
+ * @returns A RoutingGraph ready for pathfinding.
+ */
+export function buildGraph(osm, filter = defaultHighwayFilter, defaultSpeeds = DEFAULT_SPEEDS) {
+    return new RoutingGraph(osm, filter, defaultSpeeds);
+}
+/**
+ * Get an array of buffers suitable for Comlink.transfer() or postMessage transfer list.
+ * Note: SharedArrayBuffers don't need to be transferred (they're shared automatically),
+ * but ArrayBuffers do. This returns only the ArrayBuffers that need explicit transfer.
+ */
+export function getTransferableBuffers(t) {
+    const buffers = [
+        t.edgeOffsets,
+        t.edgeTargets,
+        t.edgeWayIndexes,
+        t.edgeDistances,
+        t.edgeTimes,
+        t.routableBits,
+        t.intersectionBits,
+    ];
+    // Only ArrayBuffers need to be transferred; SharedArrayBuffers are shared automatically
+    return buffers.filter((b) => b instanceof ArrayBuffer && !(b instanceof SharedArrayBuffer));
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,iBAAiB,EAA6B,MAAM,aAAa,CAAA;AAC1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,kCAAkC,CAAA;AAQpE,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAE7E;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,YAAY;IACxB,oDAAoD;IAC5C,SAAS,GAAG,CAAC,CAAA;IACrB,0CAA0C;IAClC,SAAS,GAAG,CAAC,CAAA;IAErB,gDAAgD;IACxC,WAAW,GAAuB,IAAI,CAAA;IACtC,WAAW,GAAuB,IAAI,CAAA;IACtC,cAAc,GAAuB,IAAI,CAAA;IACzC,aAAa,GAAwB,IAAI,CAAA;IACzC,SAAS,GAAwB,IAAI,CAAA;IACrC,YAAY,GAAsB,IAAI,CAAA;IACtC,gBAAgB,GAAsB,IAAI,CAAA;IAElD,2CAA2C;IAClC,MAAM,CAAe;IACrB,aAAa,CAAe;IAErC;;;;;;OAMG;IACH,YACC,MAAuC,EACvC,SAAwB,oBAAoB,EAC5C,gBAA+B,cAAc;QAE7C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QACpB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAA;QAClC,IAAI,WAAW,IAAI,MAAM,EAAE,CAAC;YAC3B,iCAAiC;YACjC,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAA;QAC/B,CAAC;aAAM,CAAC;YACP,sBAAsB;YACtB,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,aAAa,CAAC,CAAA;QACjD,CAAC;IACF,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAA4B;QACrD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAA;QAC5B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAA;QAC5B,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;QACjD,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;QACjD,IAAI,CAAC,cAAc,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,cAAc,CAAC,CAAA;QACvD,IAAI,CAAC,aAAa,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,aAAa,CAAC,CAAA;QACtD,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC9C,IAAI,CAAC,YAAY,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAA;QAClD,IAAI,CAAC,gBAAgB,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAA;IAC3D,CAAC;IAED;;OAEG;IACK,YAAY,CACnB,GAAQ,EACR,MAAqB,EACrB,aAA4B;QAE5B,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAA;QAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAA;QAChD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA;QACtC,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAA;QAE3C,MAAM,aAAa,GAAG,CAAC,IAAY,EAAE,IAAe,EAAE,EAAE;YACvD,IAAI,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACnC,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChB,SAAS,GAAG,EAAE,CAAA;gBACd,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;YAC/B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACrB,CAAC,CAAA;QAED,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC;YAC7D,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;YAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,SAAQ;YAE3B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA;YACzC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAQ;YAE7B,4EAA4E;YAC5E,MAAM,MAAM,GAAG,IAAI,EAAE,CAAC,QAAQ,CAAC,KAAK,KAAK,IAAI,IAAI,EAAE,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAA;YACrE,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,CAAA;YACnD,MAAM,QAAQ,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAA;YAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;gBAC3B,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAA;gBACrC,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAA;gBAC/D,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC,CAAA;gBAEvE,MAAM,SAAS,GAAG,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAA;gBAC3D,MAAM,IAAI,GAAG,SAAS,GAAG,QAAQ,CAAA;gBAEjC,eAAe;gBACf,aAAa,CAAC,SAAS,EAAE;oBACxB,eAAe,EAAE,eAAe;oBAChC,QAAQ;oBACR,QAAQ,EAAE,SAAS;oBACnB,IAAI;iBACJ,CAAC,CAAA;gBACF,IAAI,CAAC,SAAS,EAAE,CAAA;gBAEhB,gCAAgC;gBAChC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACb,aAAa,CAAC,eAAe,EAAE;wBAC9B,eAAe,EAAE,SAAS;wBAC1B,QAAQ;wBACR,QAAQ,EAAE,SAAS;wBACnB,IAAI;qBACJ,CAAC,CAAA;oBACF,IAAI,CAAC,SAAS,EAAE,CAAA;gBACjB,CAAC;gBAED,4EAA4E;gBAC5E,IAAI,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACjC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBACjC,CAAC;qBAAM,CAAC;oBACP,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBAC5B,CAAC;gBAED,IAAI,YAAa,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;oBACxC,iBAAiB,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;gBACvC,CAAC;qBAAM,CAAC;oBACP,YAAa,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;gBACnC,CAAC;YACF,CAAC;QACF,CAAC;QAED,sDAAsD;QAEtD,sBAAsB;QACtB,MAAM,aAAa,GAAG,IAAI,iBAAiB,CAC1C,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,iBAAiB,CACpD,CAAA;QACD,MAAM,aAAa,GAAG,IAAI,iBAAiB,CAC1C,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,iBAAiB,CAC9C,CAAA;QACD,MAAM,gBAAgB,GAAG,IAAI,iBAAiB,CAC7C,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,iBAAiB,CAC9C,CAAA;QACD,MAAM,eAAe,GAAG,IAAI,iBAAiB,CAC5C,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC,iBAAiB,CAC/C,CAAA;QACD,MAAM,WAAW,GAAG,IAAI,iBAAiB,CACxC,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC,iBAAiB,CAC/C,CAAA;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAA;QACjD,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAA;QACjD,IAAI,CAAC,cAAc,GAAG,IAAI,WAAW,CAAC,gBAAgB,CAAC,CAAA;QACvD,IAAI,CAAC,aAAa,GAAG,IAAI,YAAY,CAAC,eAAe,CAAC,CAAA;QACtD,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAA;QAE9C,uDAAuD;QACvD,IAAI,SAAS,GAAG,CAAC,CAAA;QACjB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC;YACjE,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,SAAS,CAAA;YACvC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YACtC,IAAI,KAAK,EAAE,CAAC;gBACX,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBAC1B,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,eAAe,CAAA;oBAClD,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;oBAC9C,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAA;oBAC7C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAA;oBACrC,SAAS,EAAE,CAAA;gBACZ,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,SAAS,CAAA;QAE5C,oDAAoD;QACpD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;QAClD,MAAM,cAAc,GAAG,IAAI,iBAAiB,CAAC,YAAY,CAAC,CAAA;QAC1D,MAAM,kBAAkB,GAAG,IAAI,iBAAiB,CAAC,YAAY,CAAC,CAAA;QAC9D,IAAI,CAAC,YAAY,GAAG,IAAI,UAAU,CAAC,cAAc,CAAC,CAAA;QAClD,IAAI,CAAC,gBAAgB,GAAG,IAAI,UAAU,CAAC,kBAAkB,CAAC,CAAA;QAE1D,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAA;YAChC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;YACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAE,IAAI,OAAO,CAAA;QACzC,CAAC;QAED,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAA;YAChC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;YACpC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAE,IAAI,OAAO,CAAA;QAC7C,CAAC;IACF,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,SAAiB;QAC3B,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,KAAK,CAAA;QAC9D,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAA;QAChC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;QACpC,OAAO,CAAC,IAAI,CAAC,YAAa,CAAC,SAAS,CAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;IACxD,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,SAAiB;QAC/B,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,KAAK,CAAA;QAC9D,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAA;QAChC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA;QACpC,OAAO,CAAC,IAAI,CAAC,gBAAiB,CAAC,SAAS,CAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;IAC5D,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,SAAiB;QACzB,IACC,SAAS,GAAG,CAAC;YACb,SAAS,IAAI,IAAI,CAAC,SAAS;YAC3B,CAAC,IAAI,CAAC,WAAW;YACjB,CAAC,IAAI,CAAC,WAAW,EAChB,CAAC;YACF,OAAO,EAAE,CAAA;QACV,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAE,CAAA;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,GAAG,CAAC,CAAE,CAAA;QAC5C,MAAM,KAAK,GAAgB,EAAE,CAAA;QAE7B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC;gBACV,eAAe,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE;gBACrC,QAAQ,EAAE,IAAI,CAAC,cAAe,CAAC,CAAC,CAAE;gBAClC,QAAQ,EAAE,IAAI,CAAC,aAAc,CAAC,CAAC,CAAE;gBACjC,IAAI,EAAE,IAAI,CAAC,SAAU,CAAC,CAAC,CAAE;aACzB,CAAC,CAAA;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACb,CAAC;IAED;;OAEG;IACH,aAAa;QACZ,OAAO;YACN,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,WAAW,EAAE,IAAI,CAAC,WAAY,CAAC,MAAoB;YACnD,WAAW,EAAE,IAAI,CAAC,WAAY,CAAC,MAAoB;YACnD,cAAc,EAAE,IAAI,CAAC,cAAe,CAAC,MAAoB;YACzD,aAAa,EAAE,IAAI,CAAC,aAAc,CAAC,MAAoB;YACvD,SAAS,EAAE,IAAI,CAAC,SAAU,CAAC,MAAoB;YAC/C,YAAY,EAAE,IAAI,CAAC,YAAa,CAAC,MAAoB;YACrD,gBAAgB,EAAE,IAAI,CAAC,gBAAiB,CAAC,MAAoB;SAC7D,CAAA;IACF,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,SAAS,CAAA;IACtB,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,SAAS,CAAA;IACtB,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,uBAAuB,CAAC,GAAQ,EAAE,KAAa,EAAE,YAAoB;QACpE,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,uBAAuB,CAC/C,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,EACR,YAAY,GAAG,KAAK,CACpB,CAAA;QAED,IAAI,IAAI,GAIG,IAAI,CAAA;QACf,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAA;QAExC,KAAK,MAAM,SAAS,IAAI,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;gBAAE,SAAQ;YAEzC,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAA;YAC/D,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;YACpD,IAAI,QAAQ,GAAG,SAAS,IAAI,QAAQ,IAAI,YAAY,EAAE,CAAC;gBACtD,SAAS,GAAG,QAAQ,CAAA;gBACpB,IAAI,GAAG,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAA;YACvD,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAA;IACZ,CAAC;CACD;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CACzB,GAAQ,EACR,SAAwB,oBAAoB,EAC5C,gBAA+B,cAAc;IAE7C,OAAO,IAAI,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,CAAC,CAAA;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACrC,CAA4B;IAE5B,MAAM,OAAO,GAAG;QACf,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,cAAc;QAChB,CAAC,CAAC,aAAa;QACf,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,gBAAgB;KAClB,CAAA;IACD,wFAAwF;IACxF,OAAO,OAAO,CAAC,MAAM,CACpB,CAAC,CAAC,EAAoB,EAAE,CACvB,CAAC,YAAY,WAAW,IAAI,CAAC,CAAC,CAAC,YAAY,iBAAiB,CAAC,CAC9D,CAAA;AACF,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,41 @@
+/**
+ * @osmix/router - Pathfinding on OSM road networks.
+ *
+ * Builds a routeable graph from OSM ways and provides pathfinding algorithms
+ * (Dijkstra, A*, bidirectional) for finding routes between nodes. Supports
+ * both distance and time-based routing.
+ *
+ * Key features:
+ * - **Graph construction**: Build routing graphs from OSM ways with highway filtering.
+ * - **Multiple algorithms**: Dijkstra, A*, and bidirectional search.
+ * - **Time-based routing**: Uses maxspeed tags and default speeds by highway type.
+ * - **One-way support**: Respects oneway=yes/1 tags.
+ * - **Snapping**: Find nearest routable node from arbitrary coordinates.
+ *
+ * @example
+ * ```ts
+ * import { buildGraph, Router, findNearestNodeOnGraph } from "@osmix/router"
+ *
+ * const graph = buildGraph(osm)
+ * const router = new Router(osm, graph)
+ *
+ * const start = findNearestNodeOnGraph(osm, graph, [-73.989, 40.733], 1)
+ * const end = findNearestNodeOnGraph(osm, graph, [-73.988, 40.734], 1)
+ *
+ * if (start && end) {
+ *   const path = router.route(start.nodeIndex, end.nodeIndex)
+ *   if (path) {
+ *     const result = router.buildResult(path)
+ *     console.log(result.coordinates)
+ *   }
+ * }
+ * ```
+ *
+ * @module @osmix/router
+ */
+export * from "./algorithms";
+export * from "./graph";
+export * from "./router";
+export * from "./types";
+export * from "./utils";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,cAAc,cAAc,CAAA;AAC5B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,SAAS,CAAA;AACvB,cAAc,SAAS,CAAA"}

package/dist/index.js

@@ -0,0 +1,41 @@
+/**
+ * @osmix/router - Pathfinding on OSM road networks.
+ *
+ * Builds a routeable graph from OSM ways and provides pathfinding algorithms
+ * (Dijkstra, A*, bidirectional) for finding routes between nodes. Supports
+ * both distance and time-based routing.
+ *
+ * Key features:
+ * - **Graph construction**: Build routing graphs from OSM ways with highway filtering.
+ * - **Multiple algorithms**: Dijkstra, A*, and bidirectional search.
+ * - **Time-based routing**: Uses maxspeed tags and default speeds by highway type.
+ * - **One-way support**: Respects oneway=yes/1 tags.
+ * - **Snapping**: Find nearest routable node from arbitrary coordinates.
+ *
+ * @example
+ * ```ts
+ * import { buildGraph, Router, findNearestNodeOnGraph } from "@osmix/router"
+ *
+ * const graph = buildGraph(osm)
+ * const router = new Router(osm, graph)
+ *
+ * const start = findNearestNodeOnGraph(osm, graph, [-73.989, 40.733], 1)
+ * const end = findNearestNodeOnGraph(osm, graph, [-73.988, 40.734], 1)
+ *
+ * if (start && end) {
+ *   const path = router.route(start.nodeIndex, end.nodeIndex)
+ *   if (path) {
+ *     const result = router.buildResult(path)
+ *     console.log(result.coordinates)
+ *   }
+ * }
+ * ```
+ *
+ * @module @osmix/router
+ */
+export * from "./algorithms";
+export * from "./graph";
+export * from "./router";
+export * from "./types";
+export * from "./utils";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,cAAc,cAAc,CAAA;AAC5B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,SAAS,CAAA;AACvB,cAAc,SAAS,CAAA"}

package/dist/router.d.ts

@@ -0,0 +1,55 @@
+/**
+ * High-level router API.
+ *
+ * Wraps the routing graph and algorithms to provide a convenient interface
+ * for finding routes and building result objects with coordinates.
+ *
+ * @module
+ */
+import type { Osm } from "@osmix/core";
+import type { RoutingGraph } from "./graph";
+import type { PathSegment, RouteOptions, RoutePathInfo, RouteResult, RouteStatistics } from "./types";
+/**
+ * Router for finding paths through OSM road networks.
+ *
+ * Uses pathfinding algorithms (Dijkstra, A*, or bidirectional) to find
+ * routes between node indexes. Use `findNearestNodeOnGraph()` to snap
+ * arbitrary coordinates to routable nodes before calling `route()`.
+ *
+ * @example
+ * ```ts
+ * const router = new Router(osm, graph, { algorithm: "astar" })
+ * const path = router.route(startNodeIndex, endNodeIndex)
+ * if (path) {
+ *   const result = router.buildResult(path)
+ *   console.log(result.coordinates)
+ * }
+ * ```
+ */
+export declare class Router {
+    readonly graph: RoutingGraph;
+    readonly osm: Osm;
+    private readonly defaults;
+    constructor(osm: Osm, graph: RoutingGraph, options?: Partial<RouteOptions>);
+    /**
+     * Find a route between two node indexes.
+     * Returns path segments or null if no path exists.
+     */
+    route(fromNodeIndex: number, toNodeIndex: number, options?: Partial<RouteOptions>): PathSegment[] | null;
+    /** Build route result with coordinates from path segments. */
+    buildResult(path: PathSegment[], options?: Partial<RouteOptions>): RouteResult;
+    /**
+     * Calculate route statistics (distance and time) from path segments.
+     * @param path - Path segments from route().
+     * @returns Total distance in meters and time in seconds.
+     */
+    getRouteStatistics(path: PathSegment[]): RouteStatistics;
+    /**
+     * Build route path info (segments and turn points) from path segments.
+     * Consecutive ways with the same name are merged into a single segment.
+     * @param path - Path segments from route().
+     * @returns Segments with per-way breakdown and turn point coordinates.
+     */
+    getRoutePathInfo(path: PathSegment[]): RoutePathInfo;
+}
+//# sourceMappingURL=router.d.ts.map

package/dist/router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../src/router.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAA;AAGtC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AAC3C,OAAO,KAAK,EACX,WAAW,EACX,YAAY,EACZ,aAAa,EACb,WAAW,EACX,eAAe,EAEf,MAAM,SAAS,CAAA;AAEhB;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,MAAM;IAClB,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAA;IAC5B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAA;IACjB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAwB;gBAGhD,GAAG,EAAE,GAAG,EACR,KAAK,EAAE,YAAY,EACnB,OAAO,GAAE,OAAO,CAAC,YAAY,CAAM;IAYpC;;;OAGG;IACH,KAAK,CACJ,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,OAAO,CAAC,YAAY,CAAM,GACjC,WAAW,EAAE,GAAG,IAAI;IAmBvB,8DAA8D;IAC9D,WAAW,CACV,IAAI,EAAE,WAAW,EAAE,EACnB,OAAO,GAAE,OAAO,CAAC,YAAY,CAAM,GACjC,WAAW;IAsDd;;;;OAIG;IACH,kBAAkB,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,eAAe;IAqBxD;;;;;OAKG;IACH,gBAAgB,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,aAAa;CAqFpD"}