terra-route 0.0.5 → 0.0.6

package/README.md

@@ -83,13 +83,22 @@ console.log("Shortest route:", JSON.stringify(route, null, 2));
 
 ## Benchmarks
 
-You can run the benchmarks yourself using:
+The benchmarks make use of a series out route example route networks from OSM in a moderate sized section of East London. It runs against the GeoJSON Path Finder library and also the ngraph.graph library. You can run the benchmarks yourself using:
 
 ```
 npm run benchmark
 ```
 
-Using default Haversine distance, Terra Route is approximately 3x faster than GeoJSON Path Finder with Haversine distance. If you pass in the CheapRuler distance metric (you can use the exposed `createCheapRuler` function), it is about 5x faster. 
+Here is an example output of a benchmark run for routing:
+
+TerraRoute with CheapRuler | █ 26ms
+TerraRoute                 | ██ 42ms
+GeoJSON Path Finder        | █████████████████████████ 609ms
+ngraph.graph               | ██████████████████████████████████████████████████ 1227ms
+
+Using default Haversine distance, Terra Route is approximately 13x faster than GeoJSON Path Finder with Haversine distance for A -> B path finding. If you pass in the CheapRuler distance metric (you can use the exposed `createCheapRuler` function), it is about 22x faster. 
+
+For initialisation of the network, Terra Route is about 9x faster with Haversine and 14x faster with CheapRuler than GeoJSON Path Finder. Terra Draw splits out instantiating the Class of the library from the actual graph building, which is done via `buildRouteGraph`. This allows you to defer graph creation to an appropriate time.
 
 ## Limitations
 

package/dist/fibonacci-heap.d.ts

@@ -0,0 +1,11 @@
+export declare class FibonacciHeap {
+    private nodeCount;
+    private minNode;
+    insert(key: number, value: number): void;
+    extractMin(): number | null;
+    size(): number;
+    private consolidate;
+    private link;
+    private mergeLists;
+    private removeFromList;
+}

package/dist/terra-route.cjs

@@ -1,2 +1,2 @@
-function t(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=Array(e);r<e;r++)n[r]=t[r];return n}function e(e,r){var n="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(n)return(n=n.call(e)).next.bind(n);if(Array.isArray(e)||(n=function(e,r){if(e){if("string"==typeof e)return t(e,r);var n={}.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?t(e,r):void 0}}(e))||r&&e&&"number"==typeof e.length){n&&(e=n);var a=0;return function(){return a>=e.length?{done:!0}:{done:!1,value:e[a++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var r=/*#__PURE__*/function(){function t(){this.heap=[],this.insertCounter=0}var e=t.prototype;return e.insert=function(t,e){var r={key:t,value:e,index:this.insertCounter++},n=this.heap.length;for(this.heap.push(r);n>0;){var a=n-1>>>1,i=this.heap[a];if(r.key>i.key||r.key===i.key&&r.index>i.index)break;this.heap[n]=i,n=a}this.heap[n]=r},e.extractMin=function(){var t=this.heap.length;if(0===t)return null;var e=this.heap[0],r=this.heap.pop();return t>1&&(this.heap[0]=r,this.bubbleDown(0)),e.value},e.size=function(){return this.heap.length},e.bubbleDown=function(t){for(var e=this.heap,r=e.length,n=e[t],a=n.key,i=n.index;;){var o=1+(t<<1);if(o>=r)break;var s=o,h=e[o].key,c=e[o].index,u=o+1;if(u<r){var d=e[u].key,f=e[u].index;(d<h||d===h&&f<c)&&(s=u,h=d,c=f)}if(!(h<a||h===a&&c<i))break;e[t]=e[s],t=s}e[t]=n},t}(),n=function(t,e){var r=function(t){return t*Math.PI/180},n=r(t[1]),a=r(t[0]),i=r(e[1]),o=i-n,s=r(e[0])-a,h=Math.sin(o/2)*Math.sin(o/2)+Math.cos(n)*Math.cos(i)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};exports.TerraRoute=/*#__PURE__*/function(){function t(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||n}var a=t.prototype;return a.coordinateIndex=function(t){var e=t[0],r=t[1];this.coordMap.has(e)||this.coordMap.set(e,new Map);var n=this.coordMap.get(e);if(n.has(r))return n.get(r);var a=this.coords.length;return this.coords.push(t),n.set(r,a),a},a.buildRouteGraph=function(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(var r,n=e(this.network.features);!(r=n()).done;)for(var a=r.value.geometry.coordinates,i=0;i<a.length-1;i++){var o=this.coordinateIndex(a[i]),s=this.coordinateIndex(a[i+1]),h=this.distanceMeasurement(a[i],a[i+1]);this.adjacencyList.has(o)||this.adjacencyList.set(o,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(o).push({node:s,distance:h}),this.adjacencyList.get(s).push({node:o,distance:h})}},a.getRoute=function(t,n){if(!this.network)throw new Error("Network not built. Please call buildNetworkGraph(network) first.");var a=this.coordinateIndex(t.geometry.coordinates),i=this.coordinateIndex(n.geometry.coordinates);if(a===i)return null;var o=new r;o.insert(0,a);for(var s=new Map,h=new Map([[a,0]]);o.size()>0;){var c=o.extractMin();if(c===i){for(var u=[],d=c;void 0!==d;)u.unshift(this.coords[d]),d=s.get(d);return{type:"Feature",geometry:{type:"LineString",coordinates:u},properties:{}}}for(var f,p=e(this.adjacencyList.get(c)||[]);!(f=p()).done;){var l,v,y=f.value,M=(null!=(l=h.get(c))?l:Infinity)+y.distance;if(M<(null!=(v=h.get(y.node))?v:Infinity)){s.set(y.node,c),h.set(y.node,M);var g=M+this.distanceMeasurement(this.coords[y.node],this.coords[i]);o.insert(g,y.node)}}}return null},t}(),exports.createCheapRuler=function(t){var e=1/298.257223563,r=e*(2-e),n=Math.PI/180,a=Math.cos(t*n),i=1/(1-r*(1-a*a)),o=Math.sqrt(i),s=6378.137*n,h=s*o*a,c=s*o*i*(1-r);return function(t,e){for(var r=t[0]-e[0];r<-180;)r+=360;for(;r>180;)r-=360;var n=r*h,a=(t[1]-e[1])*c;return Math.sqrt(n*n+a*a)}},exports.haversineDistance=n;
+function t(t,e){(null==e||e>t.length)&&(e=t.length);for(var n=0,r=Array(e);n<e;n++)r[n]=t[n];return r}function e(e,n){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(r)return(r=r.call(e)).next.bind(r);if(Array.isArray(e)||(r=function(e,n){if(e){if("string"==typeof e)return t(e,n);var r={}.toString.call(e).slice(8,-1);return"Object"===r&&e.constructor&&(r=e.constructor.name),"Map"===r||"Set"===r?Array.from(e):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?t(e,n):void 0}}(e))||n&&e&&"number"==typeof e.length){r&&(e=r);var i=0;return function(){return i>=e.length?{done:!0}:{done:!1,value:e[i++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var n=/*#__PURE__*/function(){function t(){this.nodeCount=0,this.minNode=null}var n=t.prototype;return n.insert=function(t,e){var n={key:t,value:e,degree:0,mark:!1,parent:null,child:null,left:null,right:null};n.left=n,n.right=n,this.minNode=this.mergeLists(this.minNode,n),this.nodeCount++},n.extractMin=function(){var t=this.minNode;if(!t)return null;if(t.child){var e=t.child;do{e.parent=null,e=e.right}while(e!==t.child);this.minNode=this.mergeLists(this.minNode,t.child)}return this.removeFromList(t),t===t.right?this.minNode=null:(this.minNode=t.right,this.consolidate()),this.nodeCount--,t.value},n.size=function(){return this.nodeCount},n.consolidate=function(){var t=Math.floor(Math.log2(this.nodeCount))+1,n=new Array(t).fill(null),r=[],i=this.minNode;do{r.push(i),i=i.right}while(i!==this.minNode);for(var o=0,a=r;o<a.length;o++){for(var s=a[o],h=s.degree;n[h];){var d=n[h];if(s.key>d.key){var c=s;s=d,d=c}this.link(d,s),n[h]=null,h++}n[h]=s}this.minNode=null;for(var u,l=e(n);!(u=l()).done;){var f=u.value;f&&(this.minNode=this.mergeLists(this.minNode,f))}},n.link=function(t,e){this.removeFromList(t),t.left=t.right=t,e.child=this.mergeLists(e.child,t),t.parent=e,e.degree++,t.mark=!1},n.mergeLists=function(t,e){if(!t)return e;if(!e)return t;var n=t.right,r=e.right;return t.right=r,r.left=t,e.right=n,n.left=e,t.key<e.key?t:e},n.removeFromList=function(t){t.left.right=t.right,t.right.left=t.left},t}(),r=function(t,e){var n=function(t){return t*Math.PI/180},r=n(t[1]),i=n(t[0]),o=n(e[1]),a=o-r,s=n(e[0])-i,h=Math.sin(a/2)*Math.sin(a/2)+Math.cos(r)*Math.cos(o)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};exports.TerraRoute=/*#__PURE__*/function(){function t(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||r}var i=t.prototype;return i.coordinateIndex=function(t){var e=t[0],n=t[1];this.coordMap.has(e)||this.coordMap.set(e,new Map);var r=this.coordMap.get(e);if(r.has(n))return r.get(n);var i=this.coords.length;return this.coords.push(t),r.set(n,i),i},i.buildRouteGraph=function(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(var n,r=e(this.network.features);!(n=r()).done;)for(var i=n.value.geometry.coordinates,o=0;o<i.length-1;o++){var a=this.coordinateIndex(i[o]),s=this.coordinateIndex(i[o+1]),h=this.distanceMeasurement(i[o],i[o+1]);this.adjacencyList.has(a)||this.adjacencyList.set(a,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(a).push({node:s,distance:h}),this.adjacencyList.get(s).push({node:a,distance:h})}},i.getRoute=function(t,r){if(!this.network)throw new Error("Network not built. Please call buildRouteGraph(network) first.");var i=this.coordinateIndex(t.geometry.coordinates),o=this.coordinateIndex(r.geometry.coordinates);if(i===o)return null;var a=new n,s=new n;a.insert(0,i),s.insert(0,o);for(var h=new Map,d=new Map,c=new Map([[i,0]]),u=new Map([[o,0]]),l=new Set,f=new Set,v=null;a.size()>0&&s.size()>0;){var g=a.extractMin();if(l.add(g),f.has(g)){v=g;break}for(var m,p=e(this.adjacencyList.get(g)||[]);!(m=p()).done;){var y,M,w=m.value,L=(null!=(y=c.get(g))?y:Infinity)+w.distance;if(L<(null!=(M=c.get(w.node))?M:Infinity)){h.set(w.node,g),c.set(w.node,L);var k=L+this.distanceMeasurement(this.coords[w.node],this.coords[o]);a.insert(k,w.node)}}var b=s.extractMin();if(f.add(b),l.has(b)){v=b;break}for(var I,N=e(this.adjacencyList.get(b)||[]);!(I=N()).done;){var j,x,S=I.value,A=(null!=(j=u.get(b))?j:Infinity)+S.distance;if(A<(null!=(x=u.get(S.node))?x:Infinity)){d.set(S.node,b),u.set(S.node,A);var C=A+this.distanceMeasurement(this.coords[S.node],this.coords[i]);s.insert(C,S.node)}}}if(null===v)return null;for(var R=[],q=v;void 0!==q;)R.unshift(this.coords[q]),q=h.get(q);var F=[];for(q=d.get(v);void 0!==q;)F.push(this.coords[q]),q=d.get(q);return{type:"Feature",geometry:{type:"LineString",coordinates:[].concat(R,F)},properties:{}}},t}(),exports.createCheapRuler=function(t){var e=1/298.257223563,n=e*(2-e),r=Math.PI/180,i=Math.cos(t*r),o=1/(1-n*(1-i*i)),a=Math.sqrt(o),s=6378.137*r,h=s*a*i,d=s*a*o*(1-n);return function(t,e){for(var n=t[0]-e[0];n<-180;)n+=360;for(;n>180;)n-=360;var r=n*h,i=(t[1]-e[1])*d;return Math.sqrt(r*r+i*i)}},exports.haversineDistance=r;
 //# sourceMappingURL=terra-route.cjs.map

package/dist/terra-route.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"terra-route.cjs","sources":["../src/min-heap.ts","../src/distance/haversine.ts","../src/terra-route.ts","../src/distance/cheap-ruler.ts"],"sourcesContent":["export class MinHeap {\n    private heap: Array<{ key: number; value: number; index: number }> = [];\n    private insertCounter = 0;\n\n    insert(key: number, value: number): void {\n        const node = { key, value, index: this.insertCounter++ };\n        let idx = this.heap.length;\n        this.heap.push(node);\n\n        // Optimized Bubble Up\n        while (idx > 0) {\n            const parentIdx = (idx - 1) >>> 1; // Fast Math.floor((idx - 1) / 2)\n            const parent = this.heap[parentIdx];\n            if (node.key > parent.key || (node.key === parent.key && node.index > parent.index)) break;\n            this.heap[idx] = parent;\n            idx = parentIdx;\n        }\n        this.heap[idx] = node;\n    }\n\n    extractMin(): number | null {\n        const length = this.heap.length;\n        if (length === 0) return null;\n\n        const minNode = this.heap[0];\n        const endNode = this.heap.pop()!;\n\n        if (length > 1) {\n            this.heap[0] = endNode;\n            this.bubbleDown(0);\n        }\n\n        return minNode.value;\n    }\n\n    size(): number {\n        return this.heap.length;\n    }\n\n    private bubbleDown(idx: number): void {\n        const { heap } = this;\n        const length = heap.length;\n        // Grab the parent node once, then move it down only if needed\n        const node = heap[idx];\n        const nodeKey = node.key;\n        const nodeIndex = node.index;\n\n        while (true) {\n            // Calculate left and right child indexes\n            const leftIdx = (idx << 1) + 1;\n            if (leftIdx >= length) {\n                // No children => we’re already in place\n                break;\n            }\n\n            // Assume left child is the smaller one by default\n            let smallestIdx = leftIdx;\n            let smallestKey = heap[leftIdx].key;\n            let smallestIndex = heap[leftIdx].index;\n\n            const rightIdx = leftIdx + 1;\n            if (rightIdx < length) {\n                // Compare left child vs. right child\n                const rightKey = heap[rightIdx].key;\n                const rightIndex = heap[rightIdx].index;\n                if (rightKey < smallestKey || (rightKey === smallestKey && rightIndex < smallestIndex)) {\n                    smallestIdx = rightIdx;\n                    smallestKey = rightKey;\n                    smallestIndex = rightIndex;\n                }\n            }\n\n            // Compare the smaller child with the parent\n            if (smallestKey < nodeKey || (smallestKey === nodeKey && smallestIndex < nodeIndex)) {\n                // Swap the smaller child up\n                heap[idx] = heap[smallestIdx];\n                idx = smallestIdx;\n            } else {\n                // We’re in the correct position now, so stop\n                break;\n            }\n        }\n\n        // Place the original node in its final position\n        heap[idx] = node;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { MinHeap } from \"./min-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const idx = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, idx);\n\n        return idx;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIdx = this.coordinateIndex(coords[i]);\n                const bIdx = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIdx)) this.adjacencyList.set(aIdx, []);\n                if (!this.adjacencyList.has(bIdx)) this.adjacencyList.set(bIdx, []);\n\n                this.adjacencyList.get(aIdx)!.push({ node: bIdx, distance });\n                this.adjacencyList.get(bIdx)!.push({ node: aIdx, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildNetworkGraph(network) first.\");\n        }\n\n        const startIdx = this.coordinateIndex(start.geometry.coordinates);\n        const endIdx = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIdx === endIdx) {\n            return null;\n        }\n\n        const openSet = new MinHeap();\n        openSet.insert(0, startIdx);\n        const cameFrom = new Map<number, number>();\n        const gScore = new Map<number, number>([[startIdx, 0]]);\n\n        while (openSet.size() > 0) {\n            const current = openSet.extractMin()!;\n\n            if (current === endIdx) {\n                const path: Position[] = [];\n                let currNode: number | undefined = current;\n                while (currNode !== undefined) {\n                    path.unshift(this.coords[currNode]);\n                    currNode = cameFrom.get(currNode);\n                }\n                return {\n                    type: \"Feature\",\n                    geometry: { type: \"LineString\", coordinates: path },\n                    properties: {},\n                };\n            }\n\n            const neighbors = this.adjacencyList.get(current) || [];\n\n            for (const neighbor of neighbors) {\n                const tentativeGScore = (gScore.get(current) ?? Infinity) + neighbor.distance;\n                if (tentativeGScore < (gScore.get(neighbor.node) ?? Infinity)) {\n                    cameFrom.set(neighbor.node, current);\n                    gScore.set(neighbor.node, tentativeGScore);\n                    const fScore = tentativeGScore + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIdx]);\n                    openSet.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        return null;\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}"],"names":["MinHeap","this","heap","insertCounter","_proto","prototype","insert","key","value","node","index","idx","length","push","parentIdx","parent","extractMin","minNode","endNode","pop","bubbleDown","size","nodeKey","nodeIndex","leftIdx","smallestIdx","smallestKey","smallestIndex","rightIdx","rightKey","rightIndex","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","Math","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","a","sin","cos","atan2","sqrt","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","lat","has","set","latMap","get","buildRouteGraph","_iterator","_step","_createForOfIteratorHelperLoose","features","done","geometry","coordinates","i","aIdx","bIdx","distance","getRoute","start","end","Error","startIdx","endIdx","openSet","cameFrom","gScore","current","path","currNode","undefined","unshift","type","properties","_step2","_iterator2","_gScore$get","_gScore$get2","neighbor","tentativeGScore","Infinity","fScore","FE","E2","RAD","cosLat","w2","w","m","kx","ky","b","deltaLng","dx","dy"],"mappings":"oyBAAa,IAAAA,eAAO,WAAA,SAAAA,IAAAC,KACRC,KAA6D,GAC7DC,KAAAA,cAAgB,CAAC,KAAAC,EAAAJ,EAAAK,UAmFxB,OAnFwBD,EAEzBE,OAAA,SAAOC,EAAaC,GAChB,IAAMC,EAAO,CAAEF,IAAAA,EAAKC,MAAAA,EAAOE,MAAOT,KAAKE,iBACnCQ,EAAMV,KAAKC,KAAKU,OAIpB,IAHAX,KAAKC,KAAKW,KAAKJ,GAGRE,EAAM,GAAG,CACZ,IAAMG,EAAaH,EAAM,IAAO,EAC1BI,EAASd,KAAKC,KAAKY,GACzB,GAAIL,EAAKF,IAAMQ,EAAOR,KAAQE,EAAKF,MAAQQ,EAAOR,KAAOE,EAAKC,MAAQK,EAAOL,MAAQ,MACrFT,KAAKC,KAAKS,GAAOI,EACjBJ,EAAMG,CACV,CACAb,KAAKC,KAAKS,GAAOF,CACrB,EAACL,EAEDY,WAAA,WACI,IAAMJ,EAASX,KAAKC,KAAKU,OACzB,GAAe,IAAXA,EAAc,OAAW,KAE7B,IAAMK,EAAUhB,KAAKC,KAAK,GACpBgB,EAAUjB,KAAKC,KAAKiB,MAO1B,OALIP,EAAS,IACTX,KAAKC,KAAK,GAAKgB,EACfjB,KAAKmB,WAAW,IAGbH,EAAQT,KACnB,EAACJ,EAEDiB,KAAA,WACI,OAAWpB,KAACC,KAAKU,MACrB,EAACR,EAEOgB,WAAA,SAAWT,GAQf,IAPA,IAAQT,EAASD,KAATC,KACFU,EAASV,EAAKU,OAEdH,EAAOP,EAAKS,GACZW,EAAUb,EAAKF,IACfgB,EAAYd,EAAKC,QAEV,CAET,IAAMc,EAAuB,GAAZb,GAAO,GACxB,GAAIa,GAAWZ,EAEX,MAIJ,IAAIa,EAAcD,EACdE,EAAcxB,EAAKsB,GAASjB,IAC5BoB,EAAgBzB,EAAKsB,GAASd,MAE5BkB,EAAWJ,EAAU,EAC3B,GAAII,EAAWhB,EAAQ,CAEnB,IAAMiB,EAAW3B,EAAK0B,GAAUrB,IAC1BuB,EAAa5B,EAAK0B,GAAUlB,OAC9BmB,EAAWH,GAAgBG,IAAaH,GAAeI,EAAaH,KACpEF,EAAcG,EACdF,EAAcG,EACdF,EAAgBG,EAExB,CAGA,KAAIJ,EAAcJ,GAAYI,IAAgBJ,GAAWK,EAAgBJ,GAMrE,MAJArB,EAAKS,GAAOT,EAAKuB,GACjBd,EAAMc,CAKd,CAGAvB,EAAKS,GAAOF,CAChB,EAACT,CAAA,CArFe,GCEP+B,EAAoB,SAACC,EAAoBC,GAClD,IAAMC,EAAY,SAACC,GAAgB,OAAMA,EAAWC,KAAKC,GAAM,GAAG,EAE5DC,EAASJ,EAAUF,EAAS,IAC5BO,EAAYL,EAAUF,EAAS,IAC/BQ,EAASN,EAAUD,EAAS,IAE5BQ,EAAWD,EAASF,EACpBI,EAFYR,EAAUD,EAAS,IAELM,EAE1BI,EACFP,KAAKQ,IAAIH,EAAW,GAAKL,KAAKQ,IAAIH,EAAW,GAC7CL,KAAKS,IAAIP,GACTF,KAAKS,IAAIL,GACTJ,KAAKQ,IAAIF,EAAc,GACvBN,KAAKQ,IAAIF,EAAc,GAM3B,OALU,EAAIN,KAAKU,MAAMV,KAAKW,KAAKJ,GAAIP,KAAKW,KAAK,EAAIJ,IAEtC,OAGG,GACtB,kCCZgB,WAYZ,SAAAK,EACIC,GAZIC,KAAAA,oBACAD,yBAAmB,EAAAhD,KACnBkD,cAAwE,IAAIC,IAAKnD,KACjFoD,OAAqB,QACrBC,SAA6C,IAAIF,IAUrDnD,KAAKgD,oBAAsBA,GAA4ClB,CAC3E,CAAC,IAAA3B,EAAA4C,EAAA3C,UAgHA,OAhHAD,EASOmD,gBAAA,SAAgBC,GACpB,IAAOC,EAAYD,KAAPE,EAAOF,EACnB,GAAKvD,KAAKqD,SAASK,IAAIF,IAAMxD,KAAKqD,SAASM,IAAIH,EAAK,IAAIL,KAExD,IAAMS,EAAS5D,KAAKqD,SAASQ,IAAIL,GACjC,GAAII,EAAOF,IAAID,GACX,OAAOG,EAAOC,IAAIJ,GAGtB,IAAM/C,EAAMV,KAAKoD,OAAOzC,OAIxB,OAHAX,KAAKoD,OAAOxC,KAAK2C,GACjBK,EAAOD,IAAIF,EAAK/C,GAETA,CACX,EAACP,EAUM2D,gBAAA,SAAgBb,GACnBjD,KAAKiD,QAAUA,EACfjD,KAAKkD,cAAgB,IAAIC,IACzBnD,KAAKoD,OAAS,GACdpD,KAAKqD,SAAW,IAAIF,IAEpB,IAAAY,IAA2CC,EAA3CD,EAAAE,EAAsBjE,KAAKiD,QAAQiB,YAAQF,EAAAD,KAAAI,MAEvC,IAFyC,IACnCf,EADQY,EAAAzD,MACS6D,SAASC,YACvBC,EAAI,EAAGA,EAAIlB,EAAOzC,OAAS,EAAG2D,IAAK,CACxC,IAAMC,EAAOvE,KAAKsD,gBAAgBF,EAAOkB,IACnCE,EAAOxE,KAAKsD,gBAAgBF,EAAOkB,EAAI,IACvCG,EAAWzE,KAAKgD,oBAAoBI,EAAOkB,GAAIlB,EAAOkB,EAAI,IAE3DtE,KAAKkD,cAAcQ,IAAIa,IAAOvE,KAAKkD,cAAcS,IAAIY,EAAM,IAC3DvE,KAAKkD,cAAcQ,IAAIc,IAAOxE,KAAKkD,cAAcS,IAAIa,EAAM,IAEhExE,KAAKkD,cAAcW,IAAIU,GAAO3D,KAAK,CAAEJ,KAAMgE,EAAMC,SAAAA,IACjDzE,KAAKkD,cAAcW,IAAIW,GAAO5D,KAAK,CAAEJ,KAAM+D,EAAME,SAAAA,GACrD,CAER,EAACtE,EAWMuE,SAAA,SAASC,EAAuBC,GACnC,IAAK5E,KAAKiD,QACN,MAAU,IAAA4B,MAAM,oEAGpB,IAAMC,EAAW9E,KAAKsD,gBAAgBqB,EAAMP,SAASC,aAC/CU,EAAS/E,KAAKsD,gBAAgBsB,EAAIR,SAASC,aAEjD,GAAIS,IAAaC,EACb,YAGJ,IAAMC,EAAU,IAAIjF,EACpBiF,EAAQ3E,OAAO,EAAGyE,GAIlB,IAHA,IAAMG,EAAW,IAAI9B,IACf+B,EAAS,IAAI/B,IAAoB,CAAC,CAAC2B,EAAU,KAE5CE,EAAQ5D,OAAS,GAAG,CACvB,IAAM+D,EAAUH,EAAQjE,aAExB,GAAIoE,IAAYJ,EAAQ,CAGpB,IAFA,IAAMK,EAAmB,GACrBC,EAA+BF,OACfG,IAAbD,GACHD,EAAKG,QAAQvF,KAAKoD,OAAOiC,IACzBA,EAAWJ,EAASpB,IAAIwB,GAE5B,MAAO,CACHG,KAAM,UACNpB,SAAU,CAAEoB,KAAM,aAAcnB,YAAae,GAC7CK,WAAY,CAAA,EAEpB,CAIA,IAFA,IAEgCC,EAAhCC,EAAA1B,EAFkBjE,KAAKkD,cAAcW,IAAIsB,IAAY,MAErBO,EAAAC,KAAAxB,MAAE,KAAAyB,EAAAC,EAAvBC,EAAQJ,EAAAnF,MACTwF,GAAsCH,OAApBA,EAACV,EAAOrB,IAAIsB,IAAQS,EAAII,UAAYF,EAASrB,SACrE,GAAIsB,GAA4C,OAA7BF,EAAIX,EAAOrB,IAAIiC,EAAStF,OAAKqF,EAAIG,UAAW,CAC3Df,EAAStB,IAAImC,EAAStF,KAAM2E,GAC5BD,EAAOvB,IAAImC,EAAStF,KAAMuF,GAC1B,IAAME,EAASF,EAAkB/F,KAAKgD,oBAAoBhD,KAAKoD,OAAO0C,EAAStF,MAAOR,KAAKoD,OAAO2B,IAClGC,EAAQ3E,OAAO4F,EAAQH,EAAStF,KACpC,CACJ,CACJ,CAEA,WACJ,EAACuC,CAAA,CAhIW,4BCoBV,SAA2BU,GAC7B,IACMyC,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMjE,KAAKC,GAAK,IAEhBiE,EAASlE,KAAKS,IAAIa,EAAM2C,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAIpE,KAAKW,KAAKwD,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAASzD,EAAaiE,GAGlC,IAFA,IAAIC,EAAWlE,EAAE,GAAKiE,EAAE,GAEjBC,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,IAAMC,EAAKD,EAAWH,EAChBK,GAAMpE,EAAE,GAAKiE,EAAE,IAAMD,EAE3B,OAAOvE,KAAKW,KAAK+D,EAAKA,EAAKC,EAAKA,EACpC,CACJ"}
+{"version":3,"file":"terra-route.cjs","sources":["../src/fibonacci-heap.ts","../src/distance/haversine.ts","../src/terra-route.ts","../src/distance/cheap-ruler.ts"],"sourcesContent":["type FibNode = {\n    key: number;\n    value: number;\n    degree: number;\n    mark: boolean;\n    parent: FibNode | null;\n    child: FibNode | null;\n    left: FibNode;\n    right: FibNode;\n};\n\nexport class FibonacciHeap {\n    private nodeCount = 0;\n    private minNode: FibNode | null = null;\n\n    insert(key: number, value: number): void {\n        const node: FibNode = {\n            key,\n            value,\n            degree: 0,\n            mark: false,\n            parent: null,\n            child: null,\n            left: null as any,\n            right: null as any,\n        };\n        node.left = node;\n        node.right = node;\n\n        this.minNode = this.mergeLists(this.minNode, node);\n        this.nodeCount++;\n    }\n\n    extractMin(): number | null {\n        const z = this.minNode;\n        if (!z) return null;\n\n        // Add children to root list\n        if (z.child) {\n            let child = z.child;\n            do {\n                child.parent = null;\n                child = child.right!;\n            } while (child !== z.child);\n            this.minNode = this.mergeLists(this.minNode, z.child);\n        }\n\n        this.removeFromList(z);\n\n        if (z === z.right) {\n            this.minNode = null;\n        } else {\n            this.minNode = z.right;\n            this.consolidate();\n        }\n\n        this.nodeCount--;\n        return z.value;\n    }\n\n    size(): number {\n        return this.nodeCount;\n    }\n\n    // ========== Internal Methods ==========\n\n    private consolidate(): void {\n        const maxDegree = Math.floor(Math.log2(this.nodeCount)) + 1;\n        const A = new Array<FibNode | null>(maxDegree).fill(null);\n\n        const rootList: FibNode[] = [];\n        let curr = this.minNode!;\n        do {\n            rootList.push(curr);\n            curr = curr.right!;\n        } while (curr !== this.minNode);\n\n        for (const w of rootList) {\n            let x = w;\n            let d = x.degree;\n            while (A[d]) {\n                let y = A[d]!;\n                if (x.key > y.key) {\n                    const temp = x;\n                    x = y;\n                    y = temp;\n                }\n                this.link(y, x);\n                A[d] = null;\n                d++;\n            }\n            A[d] = x;\n        }\n\n        this.minNode = null;\n        for (const node of A) {\n            if (node) {\n                this.minNode = this.mergeLists(this.minNode, node);\n            }\n        }\n    }\n\n    private link(y: FibNode, x: FibNode): void {\n        this.removeFromList(y);\n        y.left = y.right = y;\n        x.child = this.mergeLists(x.child, y);\n        y.parent = x;\n        x.degree++;\n        y.mark = false;\n    }\n\n    private mergeLists(a: FibNode | null, b: FibNode | null): FibNode {\n        if (!a) return b!;\n        if (!b) return a;\n\n        const aRight = a.right!;\n        const bRight = b.right!;\n\n        a.right = bRight;\n        bRight.left = a;\n        b.right = aRight;\n        aRight.left = b;\n\n        return a.key < b.key ? a : b;\n    }\n\n    private removeFromList(node: FibNode): void {\n        node.left.right = node.right;\n        node.right.left = node.left;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { FibonacciHeap } from \"./fibonacci-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const index = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, index);\n\n        return index;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIndex = this.coordinateIndex(coords[i]);\n                const bIndex = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIndex)) this.adjacencyList.set(aIndex, []);\n                if (!this.adjacencyList.has(bIndex)) this.adjacencyList.set(bIndex, []);\n\n                this.adjacencyList.get(aIndex)!.push({ node: bIndex, distance });\n                this.adjacencyList.get(bIndex)!.push({ node: aIndex, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using bidirectional A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildRouteGraph(network) first.\");\n        }\n\n        const startIndex = this.coordinateIndex(start.geometry.coordinates);\n        const endIndex = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIndex === endIndex) {\n            return null;\n        }\n\n        const openSetForward = new FibonacciHeap();\n        const openSetBackward = new FibonacciHeap();\n        openSetForward.insert(0, startIndex);\n        openSetBackward.insert(0, endIndex);\n\n        const cameFromForward = new Map<number, number>();\n        const cameFromBackward = new Map<number, number>();\n        const gScoreForward = new Map<number, number>([[startIndex, 0]]);\n        const gScoreBackward = new Map<number, number>([[endIndex, 0]]);\n\n        const visitedForward = new Set<number>();\n        const visitedBackward = new Set<number>();\n\n        let meetingNode: number | null = null;\n\n        while (openSetForward.size() > 0 && openSetBackward.size() > 0) {\n            const currentForward = openSetForward.extractMin()!;\n            visitedForward.add(currentForward);\n\n            if (visitedBackward.has(currentForward)) {\n                meetingNode = currentForward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentForward) || []) {\n                const tentativeG = (gScoreForward.get(currentForward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreForward.get(neighbor.node) ?? Infinity)) {\n                    cameFromForward.set(neighbor.node, currentForward);\n                    gScoreForward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIndex]);\n                    openSetForward.insert(fScore, neighbor.node);\n                }\n            }\n\n            const currentBackward = openSetBackward.extractMin()!;\n            visitedBackward.add(currentBackward);\n\n            if (visitedForward.has(currentBackward)) {\n                meetingNode = currentBackward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentBackward) || []) {\n                const tentativeG = (gScoreBackward.get(currentBackward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreBackward.get(neighbor.node) ?? Infinity)) {\n                    cameFromBackward.set(neighbor.node, currentBackward);\n                    gScoreBackward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[startIndex]);\n                    openSetBackward.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        if (meetingNode === null) {\n            return null;\n        }\n\n        // Reconstruct forward path\n        const pathForward: Position[] = [];\n        let node = meetingNode;\n        while (node !== undefined) {\n            pathForward.unshift(this.coords[node]);\n            node = cameFromForward.get(node)!;\n        }\n\n        // Reconstruct backward path (omit meeting node to avoid duplication)\n        const pathBackward: Position[] = [];\n        node = cameFromBackward.get(meetingNode)!;\n        while (node !== undefined) {\n            pathBackward.push(this.coords[node]);\n            node = cameFromBackward.get(node)!;\n        }\n\n        const fullPath = [...pathForward, ...pathBackward];\n\n        return {\n            type: \"Feature\",\n            geometry: { type: \"LineString\", coordinates: fullPath },\n            properties: {},\n        };\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}"],"names":["FibonacciHeap","this","nodeCount","minNode","_proto","prototype","insert","key","value","node","degree","mark","parent","child","left","right","mergeLists","extractMin","z","removeFromList","consolidate","size","maxDegree","Math","floor","log2","A","Array","fill","rootList","curr","push","_i","_rootList","length","x","d","y","temp","link","_step","_iterator","_createForOfIteratorHelperLoose","done","a","b","aRight","bRight","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","sin","cos","atan2","sqrt","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","lat","has","set","latMap","get","index","buildRouteGraph","features","geometry","coordinates","i","aIndex","bIndex","distance","getRoute","start","end","Error","startIndex","endIndex","openSetForward","openSetBackward","cameFromForward","cameFromBackward","gScoreForward","gScoreBackward","visitedForward","Set","visitedBackward","meetingNode","currentForward","add","_iterator2","_step2","_gScoreForward$get","_gScoreForward$get2","neighbor","tentativeG","Infinity","fScore","currentBackward","_step3","_iterator3","_gScoreBackward$get","_gScoreBackward$get2","pathForward","undefined","unshift","pathBackward","type","concat","properties","FE","E2","RAD","cosLat","w2","w","m","kx","ky","deltaLng","dx","dy"],"mappings":"oyBAWA,IAAaA,eAAa,WAAA,SAAAA,IAAAC,KACdC,UAAY,EACZC,KAAAA,QAA0B,IAAI,CAAA,IAAAC,EAAAJ,EAAAK,iBAAAD,EAEtCE,OAAA,SAAOC,EAAaC,GAChB,IAAMC,EAAgB,CAClBF,IAAAA,EACAC,MAAAA,EACAE,OAAQ,EACRC,MAAM,EACNC,OAAQ,KACRC,MAAO,KACPC,KAAM,KACNC,MAAO,MAEXN,EAAKK,KAAOL,EACZA,EAAKM,MAAQN,EAEbR,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASM,GAC7CR,KAAKC,WACT,EAACE,EAEDa,WAAA,WACI,IAAMC,EAAIjB,KAAKE,QACf,IAAKe,EAAG,OAAW,KAGnB,GAAIA,EAAEL,MAAO,CACT,IAAIA,EAAQK,EAAEL,MACd,GACIA,EAAMD,OAAS,KACfC,EAAQA,EAAME,YACTF,IAAUK,EAAEL,OACrBZ,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASe,EAAEL,MACnD,CAYA,OAVAZ,KAAKkB,eAAeD,GAEhBA,IAAMA,EAAEH,MACRd,KAAKE,QAAU,MAEfF,KAAKE,QAAUe,EAAEH,MACjBd,KAAKmB,eAGTnB,KAAKC,YACEgB,EAAEV,KACb,EAACJ,EAEDiB,KAAA,WACI,OAAOpB,KAAKC,SAChB,EAACE,EAIOgB,YAAA,WACJ,IAAME,EAAYC,KAAKC,MAAMD,KAAKE,KAAKxB,KAAKC,YAAc,EACpDwB,EAAI,IAAIC,MAAsBL,GAAWM,KAAK,MAE9CC,EAAsB,GACxBC,EAAO7B,KAAKE,QAChB,GACI0B,EAASE,KAAKD,GACdA,EAAOA,EAAKf,YACPe,IAAS7B,KAAKE,SAEvB,IAAA,IAAA6B,EAAAC,EAAAA,EAAgBJ,EAAQG,EAAAC,EAAAC,OAAAF,IAAE,CAGtB,IAHC,IACGG,EADIF,EAAAD,GAEJI,EAAID,EAAEzB,OACHgB,EAAEU,IAAI,CACT,IAAIC,EAAIX,EAAEU,GACV,GAAID,EAAE5B,IAAM8B,EAAE9B,IAAK,CACf,IAAM+B,EAAOH,EACbA,EAAIE,EACJA,EAAIC,CACR,CACArC,KAAKsC,KAAKF,EAAGF,GACbT,EAAEU,GAAK,KACPA,GACJ,CACAV,EAAEU,GAAKD,CACX,CAEAlC,KAAKE,QAAU,KACf,IAAA,IAAoBqC,EAApBC,EAAAC,EAAmBhB,KAACc,EAAAC,KAAAE,MAAE,CAAX,IAAAlC,EAAI+B,EAAAhC,MACPC,IACAR,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASM,GAErD,CACJ,EAACL,EAEOmC,KAAA,SAAKF,EAAYF,GACrBlC,KAAKkB,eAAekB,GACpBA,EAAEvB,KAAOuB,EAAEtB,MAAQsB,EACnBF,EAAEtB,MAAQZ,KAAKe,WAAWmB,EAAEtB,MAAOwB,GACnCA,EAAEzB,OAASuB,EACXA,EAAEzB,SACF2B,EAAE1B,MAAO,CACb,EAACP,EAEOY,WAAA,SAAW4B,EAAmBC,GAClC,IAAKD,EAAG,OAAOC,EACf,IAAKA,EAAG,OAAOD,EAEf,IAAME,EAASF,EAAE7B,MACXgC,EAASF,EAAE9B,MAOjB,OALA6B,EAAE7B,MAAQgC,EACVA,EAAOjC,KAAO8B,EACdC,EAAE9B,MAAQ+B,EACVA,EAAOhC,KAAO+B,EAEPD,EAAErC,IAAMsC,EAAEtC,IAAMqC,EAAIC,CAC/B,EAACzC,EAEOe,eAAA,SAAeV,GACnBA,EAAKK,KAAKC,MAAQN,EAAKM,MACvBN,EAAKM,MAAMD,KAAOL,EAAKK,IAC3B,EAACd,CAAA,CAtHqB,GCTbgD,EAAoB,SAACC,EAAoBC,GAClD,IAAMC,EAAY,SAACC,GAAgB,OAAMA,EAAW7B,KAAK8B,GAAM,GAAG,EAE5DC,EAASH,EAAUF,EAAS,IAC5BM,EAAYJ,EAAUF,EAAS,IAC/BO,EAASL,EAAUD,EAAS,IAE5BO,EAAWD,EAASF,EACpBI,EAFYP,EAAUD,EAAS,IAELK,EAE1BX,EACFrB,KAAKoC,IAAIF,EAAW,GAAKlC,KAAKoC,IAAIF,EAAW,GAC7ClC,KAAKqC,IAAIN,GACT/B,KAAKqC,IAAIJ,GACTjC,KAAKoC,IAAID,EAAc,GACvBnC,KAAKoC,IAAID,EAAc,GAM3B,OALU,EAAInC,KAAKsC,MAAMtC,KAAKuC,KAAKlB,GAAIrB,KAAKuC,KAAK,EAAIlB,IAEtC,OAGG,GACtB,kCCZgB,WAYZ,SAAAmB,EACIC,GAZIC,KAAAA,aACAD,EAAAA,KAAAA,yBACAE,EAAAA,KAAAA,cAAwE,IAAIC,IAAKlE,KACjFmE,OAAqB,GAAEnE,KACvBoE,SAA6C,IAAIF,IAUrDlE,KAAK+D,oBAAsBA,GAA4ChB,CAC3E,CAAC,IAAA5C,EAAA2D,EAAA1D,UA4JA,OA5JAD,EASOkE,gBAAA,SAAgBC,GACpB,IAAOC,EAAYD,EAAPE,GAAAA,EAAOF,EACnB,GAAKtE,KAAKoE,SAASK,IAAIF,IAAMvE,KAAKoE,SAASM,IAAIH,EAAK,IAAIL,KAExD,IAAMS,EAAS3E,KAAKoE,SAASQ,IAAIL,GACjC,GAAII,EAAOF,IAAID,GACX,OAAOG,EAAOC,IAAIJ,GAGtB,IAAMK,EAAQ7E,KAAKmE,OAAOlC,OAI1B,OAHAjC,KAAKmE,OAAOrC,KAAKwC,GACjBK,EAAOD,IAAIF,EAAKK,GAETA,CACX,EAAC1E,EAUM2E,gBAAA,SAAgBd,GACnBhE,KAAKgE,QAAUA,EACfhE,KAAKiE,cAAgB,IAAIC,IACzBlE,KAAKmE,OAAS,GACdnE,KAAKoE,SAAW,IAAIF,IAEpB,IAAA,IAA2C3B,EAA3CC,EAAAC,EAAsBzC,KAAKgE,QAAQe,YAAQxC,EAAAC,KAAAE,MAEvC,IAFO,IACDyB,EADQ5B,EAAAhC,MACSyE,SAASC,YACvBC,EAAI,EAAGA,EAAIf,EAAOlC,OAAS,EAAGiD,IAAK,CACxC,IAAMC,EAASnF,KAAKqE,gBAAgBF,EAAOe,IACrCE,EAASpF,KAAKqE,gBAAgBF,EAAOe,EAAI,IACzCG,EAAWrF,KAAK+D,oBAAoBI,EAAOe,GAAIf,EAAOe,EAAI,IAE3DlF,KAAKiE,cAAcQ,IAAIU,IAASnF,KAAKiE,cAAcS,IAAIS,EAAQ,IAC/DnF,KAAKiE,cAAcQ,IAAIW,IAASpF,KAAKiE,cAAcS,IAAIU,EAAQ,IAEpEpF,KAAKiE,cAAcW,IAAIO,GAASrD,KAAK,CAAEtB,KAAM4E,EAAQC,SAAAA,IACrDrF,KAAKiE,cAAcW,IAAIQ,GAAStD,KAAK,CAAEtB,KAAM2E,EAAQE,SAAAA,GACzD,CAER,EAAClF,EAWMmF,SAAA,SAASC,EAAuBC,GACnC,IAAKxF,KAAKgE,QACN,MAAU,IAAAyB,MAAM,kEAGpB,IAAMC,EAAa1F,KAAKqE,gBAAgBkB,EAAMP,SAASC,aACjDU,EAAW3F,KAAKqE,gBAAgBmB,EAAIR,SAASC,aAEnD,GAAIS,IAAeC,EACf,OAAO,KAGX,IAAMC,EAAiB,IAAI7F,EACrB8F,EAAkB,IAAI9F,EAC5B6F,EAAevF,OAAO,EAAGqF,GACzBG,EAAgBxF,OAAO,EAAGsF,GAY1B,IAVA,IAAMG,EAAkB,IAAI5B,IACtB6B,EAAmB,IAAI7B,IACvB8B,EAAgB,IAAI9B,IAAoB,CAAC,CAACwB,EAAY,KACtDO,EAAiB,IAAI/B,IAAoB,CAAC,CAACyB,EAAU,KAErDO,EAAiB,IAAIC,IACrBC,EAAkB,IAAID,IAExBE,EAA6B,KAE1BT,EAAexE,OAAS,GAAKyE,EAAgBzE,OAAS,GAAG,CAC5D,IAAMkF,EAAiBV,EAAe5E,aAGtC,GAFAkF,EAAeK,IAAID,GAEfF,EAAgB3B,IAAI6B,GAAiB,CACrCD,EAAcC,EACd,KACJ,CAEA,IAAAE,IAAmEC,EAAnED,EAAA/D,EAAuBzC,KAAKiE,cAAcW,IAAI0B,IAAmB,MAAEG,EAAAD,KAAA9D,MAAE,CAAAgE,IAAAA,EAAAC,EAA1DC,EAAQH,EAAAlG,MACTsG,GAA+CH,OAAlCA,EAACV,EAAcpB,IAAI0B,IAAeI,EAAII,UAAYF,EAASvB,SAC9E,GAAIwB,GAA8CF,OAApCA,EAAIX,EAAcpB,IAAIgC,EAASpG,OAAKmG,EAAIG,UAAW,CAC7DhB,EAAgBpB,IAAIkC,EAASpG,KAAM8F,GACnCN,EAActB,IAAIkC,EAASpG,KAAMqG,GACjC,IAAME,EAASF,EAAa7G,KAAK+D,oBAAoB/D,KAAKmE,OAAOyC,EAASpG,MAAOR,KAAKmE,OAAOwB,IAC7FC,EAAevF,OAAO0G,EAAQH,EAASpG,KAC3C,CACJ,CAEA,IAAMwG,EAAkBnB,EAAgB7E,aAGxC,GAFAoF,EAAgBG,IAAIS,GAEhBd,EAAezB,IAAIuC,GAAkB,CACrCX,EAAcW,EACd,KACJ,CAEA,IAAA,IAAoEC,EAApEC,EAAAzE,EAAuBzC,KAAKiE,cAAcW,IAAIoC,IAAoB,MAAEC,EAAAC,KAAAxE,MAAE,CAAAyE,IAAAA,EAAAC,EAA3DR,EAAQK,EAAA1G,MACTsG,GAAiDM,OAApCA,EAAClB,EAAerB,IAAIoC,IAAgBG,EAAIL,UAAYF,EAASvB,SAChF,GAAIwB,GAA+CO,OAArCA,EAAInB,EAAerB,IAAIgC,EAASpG,OAAK4G,EAAIN,UAAW,CAC9Df,EAAiBrB,IAAIkC,EAASpG,KAAMwG,GACpCf,EAAevB,IAAIkC,EAASpG,KAAMqG,GAClC,IAAME,EAASF,EAAa7G,KAAK+D,oBAAoB/D,KAAKmE,OAAOyC,EAASpG,MAAOR,KAAKmE,OAAOuB,IAC7FG,EAAgBxF,OAAO0G,EAAQH,EAASpG,KAC5C,CACJ,CACJ,CAEA,GAAoB,OAAhB6F,EACA,OAAO,KAMX,IAFA,IAAMgB,EAA0B,GAC5B7G,EAAO6F,OACKiB,IAAT9G,GACH6G,EAAYE,QAAQvH,KAAKmE,OAAO3D,IAChCA,EAAOsF,EAAgBlB,IAAIpE,GAI/B,IAAMgH,EAA2B,GAEjC,IADAhH,EAAOuF,EAAiBnB,IAAIyB,QACZiB,IAAT9G,GACHgH,EAAa1F,KAAK9B,KAAKmE,OAAO3D,IAC9BA,EAAOuF,EAAiBnB,IAAIpE,GAKhC,MAAO,CACHiH,KAAM,UACNzC,SAAU,CAAEyC,KAAM,aAAcxC,YAJtB,GAAAyC,OAAOL,EAAgBG,IAKjCG,WAAY,CAAA,EAEpB,EAAC7D,CAAA,CA5KW,4BCoBV,SAA2BU,GAC7B,IACMoD,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMxG,KAAK8B,GAAK,IAEhB2E,EAASzG,KAAKqC,IAAIa,EAAMsD,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAI3G,KAAKuC,KAAKmE,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAASlF,EAAaC,GAGlC,IAFA,IAAIyF,EAAW1F,EAAE,GAAKC,EAAE,GAEjByF,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,IAAMC,EAAKD,EAAWF,EAChBI,GAAM5F,EAAE,GAAKC,EAAE,IAAMwF,EAE3B,OAAO9G,KAAKuC,KAAKyE,EAAKA,EAAKC,EAAKA,EACpC,CACJ"}

package/dist/terra-route.d.ts

@@ -38,7 +38,7 @@ declare class TerraRoute {
      */
     buildRouteGraph(network: FeatureCollection<LineString>): void;
     /**
-    * Computes the shortest route between two points in the network using A* algorithm.
+    * Computes the shortest route between two points in the network using bidirectional A* algorithm.
     *
     * @param start - A GeoJSON Point Feature representing the start location.
     * @param end - A GeoJSON Point Feature representing the end location.

package/dist/terra-route.modern.js

@@ -1,2 +1,2 @@
-class t{constructor(){this.heap=[],this.insertCounter=0}insert(t,e){const s={key:t,value:e,index:this.insertCounter++};let n=this.heap.length;for(this.heap.push(s);n>0;){const t=n-1>>>1,e=this.heap[t];if(s.key>e.key||s.key===e.key&&s.index>e.index)break;this.heap[n]=e,n=t}this.heap[n]=s}extractMin(){const t=this.heap.length;if(0===t)return null;const e=this.heap[0],s=this.heap.pop();return t>1&&(this.heap[0]=s,this.bubbleDown(0)),e.value}size(){return this.heap.length}bubbleDown(t){const{heap:e}=this,s=e.length,n=e[t],o=n.key,i=n.index;for(;;){const n=1+(t<<1);if(n>=s)break;let r=n,a=e[n].key,h=e[n].index;const c=n+1;if(c<s){const t=e[c].key,s=e[c].index;(t<a||t===a&&s<h)&&(r=c,a=t,h=s)}if(!(a<o||a===o&&h<i))break;e[t]=e[r],t=r}e[t]=n}}const e=(t,e)=>{const s=t=>t*Math.PI/180,n=s(t[1]),o=s(t[0]),i=s(e[1]),r=i-n,a=s(e[0])-o,h=Math.sin(r/2)*Math.sin(r/2)+Math.cos(n)*Math.cos(i)*Math.sin(a/2)*Math.sin(a/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};function s(t){const e=1/298.257223563,s=e*(2-e),n=Math.PI/180,o=Math.cos(t*n),i=1/(1-s*(1-o*o)),r=Math.sqrt(i),a=6378.137*n,h=a*r*o,c=a*r*i*(1-s);return function(t,e){let s=t[0]-e[0];for(;s<-180;)s+=360;for(;s>180;)s-=360;const n=s*h,o=(t[1]-e[1])*c;return Math.sqrt(n*n+o*o)}}class n{constructor(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||e}coordinateIndex(t){const[e,s]=t;this.coordMap.has(e)||this.coordMap.set(e,new Map);const n=this.coordMap.get(e);if(n.has(s))return n.get(s);const o=this.coords.length;return this.coords.push(t),n.set(s,o),o}buildRouteGraph(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(const t of this.network.features){const e=t.geometry.coordinates;for(let t=0;t<e.length-1;t++){const s=this.coordinateIndex(e[t]),n=this.coordinateIndex(e[t+1]),o=this.distanceMeasurement(e[t],e[t+1]);this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.has(n)||this.adjacencyList.set(n,[]),this.adjacencyList.get(s).push({node:n,distance:o}),this.adjacencyList.get(n).push({node:s,distance:o})}}}getRoute(e,s){if(!this.network)throw new Error("Network not built. Please call buildNetworkGraph(network) first.");const n=this.coordinateIndex(e.geometry.coordinates),o=this.coordinateIndex(s.geometry.coordinates);if(n===o)return null;const i=new t;i.insert(0,n);const r=new Map,a=new Map([[n,0]]);for(;i.size()>0;){const t=i.extractMin();if(t===o){const e=[];let s=t;for(;void 0!==s;)e.unshift(this.coords[s]),s=r.get(s);return{type:"Feature",geometry:{type:"LineString",coordinates:e},properties:{}}}const e=this.adjacencyList.get(t)||[];for(const s of e){var h,c;const e=(null!=(h=a.get(t))?h:Infinity)+s.distance;if(e<(null!=(c=a.get(s.node))?c:Infinity)){r.set(s.node,t),a.set(s.node,e);const n=e+this.distanceMeasurement(this.coords[s.node],this.coords[o]);i.insert(n,s.node)}}}return null}}export{n as TerraRoute,s as createCheapRuler,e as haversineDistance};
+class t{constructor(){this.nodeCount=0,this.minNode=null}insert(t,e){const n={key:t,value:e,degree:0,mark:!1,parent:null,child:null,left:null,right:null};n.left=n,n.right=n,this.minNode=this.mergeLists(this.minNode,n),this.nodeCount++}extractMin(){const t=this.minNode;if(!t)return null;if(t.child){let e=t.child;do{e.parent=null,e=e.right}while(e!==t.child);this.minNode=this.mergeLists(this.minNode,t.child)}return this.removeFromList(t),t===t.right?this.minNode=null:(this.minNode=t.right,this.consolidate()),this.nodeCount--,t.value}size(){return this.nodeCount}consolidate(){const t=Math.floor(Math.log2(this.nodeCount))+1,e=new Array(t).fill(null),n=[];let s=this.minNode;do{n.push(s),s=s.right}while(s!==this.minNode);for(const t of n){let n=t,s=n.degree;for(;e[s];){let t=e[s];if(n.key>t.key){const e=n;n=t,t=e}this.link(t,n),e[s]=null,s++}e[s]=n}this.minNode=null;for(const t of e)t&&(this.minNode=this.mergeLists(this.minNode,t))}link(t,e){this.removeFromList(t),t.left=t.right=t,e.child=this.mergeLists(e.child,t),t.parent=e,e.degree++,t.mark=!1}mergeLists(t,e){if(!t)return e;if(!e)return t;const n=t.right,s=e.right;return t.right=s,s.left=t,e.right=n,n.left=e,t.key<e.key?t:e}removeFromList(t){t.left.right=t.right,t.right.left=t.left}}const e=(t,e)=>{const n=t=>t*Math.PI/180,s=n(t[1]),i=n(t[0]),o=n(e[1]),r=o-s,h=n(e[0])-i,a=Math.sin(r/2)*Math.sin(r/2)+Math.cos(s)*Math.cos(o)*Math.sin(h/2)*Math.sin(h/2);return 2*Math.atan2(Math.sqrt(a),Math.sqrt(1-a))*6371e3/1e3};function n(t){const e=1/298.257223563,n=e*(2-e),s=Math.PI/180,i=Math.cos(t*s),o=1/(1-n*(1-i*i)),r=Math.sqrt(o),h=6378.137*s,a=h*r*i,c=h*r*o*(1-n);return function(t,e){let n=t[0]-e[0];for(;n<-180;)n+=360;for(;n>180;)n-=360;const s=n*a,i=(t[1]-e[1])*c;return Math.sqrt(s*s+i*i)}}class s{constructor(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||e}coordinateIndex(t){const[e,n]=t;this.coordMap.has(e)||this.coordMap.set(e,new Map);const s=this.coordMap.get(e);if(s.has(n))return s.get(n);const i=this.coords.length;return this.coords.push(t),s.set(n,i),i}buildRouteGraph(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(const t of this.network.features){const e=t.geometry.coordinates;for(let t=0;t<e.length-1;t++){const n=this.coordinateIndex(e[t]),s=this.coordinateIndex(e[t+1]),i=this.distanceMeasurement(e[t],e[t+1]);this.adjacencyList.has(n)||this.adjacencyList.set(n,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(n).push({node:s,distance:i}),this.adjacencyList.get(s).push({node:n,distance:i})}}}getRoute(e,n){if(!this.network)throw new Error("Network not built. Please call buildRouteGraph(network) first.");const s=this.coordinateIndex(e.geometry.coordinates),i=this.coordinateIndex(n.geometry.coordinates);if(s===i)return null;const o=new t,r=new t;o.insert(0,s),r.insert(0,i);const h=new Map,a=new Map,c=new Map([[s,0]]),d=new Map([[i,0]]),l=new Set,u=new Set;let f=null;for(;o.size()>0&&r.size()>0;){const t=o.extractMin();if(l.add(t),u.has(t)){f=t;break}for(const e of this.adjacencyList.get(t)||[]){var g,M;const n=(null!=(g=c.get(t))?g:Infinity)+e.distance;if(n<(null!=(M=c.get(e.node))?M:Infinity)){h.set(e.node,t),c.set(e.node,n);const s=n+this.distanceMeasurement(this.coords[e.node],this.coords[i]);o.insert(s,e.node)}}const e=r.extractMin();if(u.add(e),l.has(e)){f=e;break}for(const t of this.adjacencyList.get(e)||[]){var m,p;const n=(null!=(m=d.get(e))?m:Infinity)+t.distance;if(n<(null!=(p=d.get(t.node))?p:Infinity)){a.set(t.node,e),d.set(t.node,n);const i=n+this.distanceMeasurement(this.coords[t.node],this.coords[s]);r.insert(i,t.node)}}}if(null===f)return null;const y=[];let w=f;for(;void 0!==w;)y.unshift(this.coords[w]),w=h.get(w);const L=[];for(w=a.get(f);void 0!==w;)L.push(this.coords[w]),w=a.get(w);return{type:"Feature",geometry:{type:"LineString",coordinates:[...y,...L]},properties:{}}}}export{s as TerraRoute,n as createCheapRuler,e as haversineDistance};
 //# sourceMappingURL=terra-route.modern.js.map

package/dist/terra-route.modern.js.map

@@ -1 +1 @@
-{"version":3,"file":"terra-route.modern.js","sources":["../src/min-heap.ts","../src/distance/haversine.ts","../src/distance/cheap-ruler.ts","../src/terra-route.ts"],"sourcesContent":["export class MinHeap {\n    private heap: Array<{ key: number; value: number; index: number }> = [];\n    private insertCounter = 0;\n\n    insert(key: number, value: number): void {\n        const node = { key, value, index: this.insertCounter++ };\n        let idx = this.heap.length;\n        this.heap.push(node);\n\n        // Optimized Bubble Up\n        while (idx > 0) {\n            const parentIdx = (idx - 1) >>> 1; // Fast Math.floor((idx - 1) / 2)\n            const parent = this.heap[parentIdx];\n            if (node.key > parent.key || (node.key === parent.key && node.index > parent.index)) break;\n            this.heap[idx] = parent;\n            idx = parentIdx;\n        }\n        this.heap[idx] = node;\n    }\n\n    extractMin(): number | null {\n        const length = this.heap.length;\n        if (length === 0) return null;\n\n        const minNode = this.heap[0];\n        const endNode = this.heap.pop()!;\n\n        if (length > 1) {\n            this.heap[0] = endNode;\n            this.bubbleDown(0);\n        }\n\n        return minNode.value;\n    }\n\n    size(): number {\n        return this.heap.length;\n    }\n\n    private bubbleDown(idx: number): void {\n        const { heap } = this;\n        const length = heap.length;\n        // Grab the parent node once, then move it down only if needed\n        const node = heap[idx];\n        const nodeKey = node.key;\n        const nodeIndex = node.index;\n\n        while (true) {\n            // Calculate left and right child indexes\n            const leftIdx = (idx << 1) + 1;\n            if (leftIdx >= length) {\n                // No children => we’re already in place\n                break;\n            }\n\n            // Assume left child is the smaller one by default\n            let smallestIdx = leftIdx;\n            let smallestKey = heap[leftIdx].key;\n            let smallestIndex = heap[leftIdx].index;\n\n            const rightIdx = leftIdx + 1;\n            if (rightIdx < length) {\n                // Compare left child vs. right child\n                const rightKey = heap[rightIdx].key;\n                const rightIndex = heap[rightIdx].index;\n                if (rightKey < smallestKey || (rightKey === smallestKey && rightIndex < smallestIndex)) {\n                    smallestIdx = rightIdx;\n                    smallestKey = rightKey;\n                    smallestIndex = rightIndex;\n                }\n            }\n\n            // Compare the smaller child with the parent\n            if (smallestKey < nodeKey || (smallestKey === nodeKey && smallestIndex < nodeIndex)) {\n                // Swap the smaller child up\n                heap[idx] = heap[smallestIdx];\n                idx = smallestIdx;\n            } else {\n                // We’re in the correct position now, so stop\n                break;\n            }\n        }\n\n        // Place the original node in its final position\n        heap[idx] = node;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { MinHeap } from \"./min-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const idx = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, idx);\n\n        return idx;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIdx = this.coordinateIndex(coords[i]);\n                const bIdx = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIdx)) this.adjacencyList.set(aIdx, []);\n                if (!this.adjacencyList.has(bIdx)) this.adjacencyList.set(bIdx, []);\n\n                this.adjacencyList.get(aIdx)!.push({ node: bIdx, distance });\n                this.adjacencyList.get(bIdx)!.push({ node: aIdx, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildNetworkGraph(network) first.\");\n        }\n\n        const startIdx = this.coordinateIndex(start.geometry.coordinates);\n        const endIdx = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIdx === endIdx) {\n            return null;\n        }\n\n        const openSet = new MinHeap();\n        openSet.insert(0, startIdx);\n        const cameFrom = new Map<number, number>();\n        const gScore = new Map<number, number>([[startIdx, 0]]);\n\n        while (openSet.size() > 0) {\n            const current = openSet.extractMin()!;\n\n            if (current === endIdx) {\n                const path: Position[] = [];\n                let currNode: number | undefined = current;\n                while (currNode !== undefined) {\n                    path.unshift(this.coords[currNode]);\n                    currNode = cameFrom.get(currNode);\n                }\n                return {\n                    type: \"Feature\",\n                    geometry: { type: \"LineString\", coordinates: path },\n                    properties: {},\n                };\n            }\n\n            const neighbors = this.adjacencyList.get(current) || [];\n\n            for (const neighbor of neighbors) {\n                const tentativeGScore = (gScore.get(current) ?? Infinity) + neighbor.distance;\n                if (tentativeGScore < (gScore.get(neighbor.node) ?? Infinity)) {\n                    cameFrom.set(neighbor.node, current);\n                    gScore.set(neighbor.node, tentativeGScore);\n                    const fScore = tentativeGScore + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIdx]);\n                    openSet.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        return null;\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }"],"names":["MinHeap","constructor","heap","insertCounter","insert","key","value","node","index","this","idx","length","push","parentIdx","parent","extractMin","minNode","endNode","pop","bubbleDown","size","nodeKey","nodeIndex","leftIdx","smallestIdx","smallestKey","smallestIndex","rightIdx","rightKey","rightIndex","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","Math","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","a","sin","cos","atan2","sqrt","createCheapRuler","lat","FE","E2","RAD","cosLat","w2","w","m","kx","ky","b","deltaLng","dx","dy","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","has","set","latMap","get","buildRouteGraph","feature","features","geometry","coordinates","i","aIdx","bIdx","distance","getRoute","start","end","Error","startIdx","endIdx","openSet","cameFrom","gScore","current","path","currNode","undefined","unshift","type","properties","neighbors","neighbor","_gScore$get","_gScore$get2","tentativeGScore","Infinity","fScore"],"mappings":"MAAaA,EAAOC,WAAAA,GACRC,KAAAA,KAA6D,GAC7DC,KAAAA,cAAgB,CAAC,CAEzBC,MAAAA,CAAOC,EAAaC,GAChB,MAAMC,EAAO,CAAEF,MAAKC,QAAOE,MAAOC,KAAKN,iBACvC,IAAIO,EAAMD,KAAKP,KAAKS,OAIpB,IAHAF,KAAKP,KAAKU,KAAKL,GAGRG,EAAM,GAAG,CACZ,MAAMG,EAAaH,EAAM,IAAO,EAC1BI,EAASL,KAAKP,KAAKW,GACzB,GAAIN,EAAKF,IAAMS,EAAOT,KAAQE,EAAKF,MAAQS,EAAOT,KAAOE,EAAKC,MAAQM,EAAON,MAAQ,MACrFC,KAAKP,KAAKQ,GAAOI,EACjBJ,EAAMG,CACV,CACAJ,KAAKP,KAAKQ,GAAOH,CACrB,CAEAQ,UAAAA,GACI,MAAMJ,EAASF,KAAKP,KAAKS,OACzB,GAAe,IAAXA,EAAc,OAAW,KAE7B,MAAMK,EAAUP,KAAKP,KAAK,GACpBe,EAAUR,KAAKP,KAAKgB,MAO1B,OALIP,EAAS,IACTF,KAAKP,KAAK,GAAKe,EACfR,KAAKU,WAAW,IAGbH,EAAQV,KACnB,CAEAc,IAAAA,GACI,YAAYlB,KAAKS,MACrB,CAEQQ,UAAAA,CAAWT,GACf,MAAMR,KAAEA,GAASO,KACXE,EAAST,EAAKS,OAEdJ,EAAOL,EAAKQ,GACZW,EAAUd,EAAKF,IACfiB,EAAYf,EAAKC,MAEvB,OAAa,CAET,MAAMe,EAAuB,GAAZb,GAAO,GACxB,GAAIa,GAAWZ,EAEX,MAIJ,IAAIa,EAAcD,EACdE,EAAcvB,EAAKqB,GAASlB,IAC5BqB,EAAgBxB,EAAKqB,GAASf,MAElC,MAAMmB,EAAWJ,EAAU,EAC3B,GAAII,EAAWhB,EAAQ,CAEnB,MAAMiB,EAAW1B,EAAKyB,GAAUtB,IAC1BwB,EAAa3B,EAAKyB,GAAUnB,OAC9BoB,EAAWH,GAAgBG,IAAaH,GAAeI,EAAaH,KACpEF,EAAcG,EACdF,EAAcG,EACdF,EAAgBG,EAExB,CAGA,KAAIJ,EAAcJ,GAAYI,IAAgBJ,GAAWK,EAAgBJ,GAMrE,MAJApB,EAAKQ,GAAOR,EAAKsB,GACjBd,EAAMc,CAKd,CAGAtB,EAAKQ,GAAOH,CAChB,ECnFS,MAAAuB,EAAoBA,CAACC,EAAoBC,KAClD,MAAMC,EAAaC,GAAsBA,EAAWC,KAAKC,GAAM,IAEzDC,EAASJ,EAAUF,EAAS,IAC5BO,EAAYL,EAAUF,EAAS,IAC/BQ,EAASN,EAAUD,EAAS,IAE5BQ,EAAWD,EAASF,EACpBI,EAFYR,EAAUD,EAAS,IAELM,EAE1BI,EACFP,KAAKQ,IAAIH,EAAW,GAAKL,KAAKQ,IAAIH,EAAW,GAC7CL,KAAKS,IAAIP,GACTF,KAAKS,IAAIL,GACTJ,KAAKQ,IAAIF,EAAc,GACvBN,KAAKQ,IAAIF,EAAc,GAM3B,OALU,EAAIN,KAAKU,MAAMV,KAAKW,KAAKJ,GAAIP,KAAKW,KAAK,EAAIJ,IAEtC,OAGG,KCShB,SAAUK,EAAiBC,GAC7B,MACMC,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMhB,KAAKC,GAAK,IAEhBgB,EAASjB,KAAKS,IAAII,EAAMG,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAInB,KAAKW,KAAKO,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAASR,EAAagB,GAClC,IAAIC,EAAWjB,EAAE,GAAKgB,EAAE,GAExB,KAAOC,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,MAAMC,EAAKD,EAAWH,EAChBK,GAAMnB,EAAE,GAAKgB,EAAE,IAAMD,EAE3B,OAAOtB,KAAKW,KAAKc,EAAKA,EAAKC,EAAKA,EACpC,CACJ,CC7CA,MAAMC,EAYF7D,WAAAA,CACI8D,GAZIC,KAAAA,oBACAD,yBAAmB,EAAAtD,KACnBwD,cAAwE,IAAIC,SAC5EC,OAAqB,GACrBC,KAAAA,SAA6C,IAAIF,IAUrDzD,KAAKsD,oBAAsBA,GAA4CjC,CAC3E,CASQuC,eAAAA,CAAgBC,GACpB,MAAOC,EAAKvB,GAAOsB,EACd7D,KAAK2D,SAASI,IAAID,IAAM9D,KAAK2D,SAASK,IAAIF,EAAK,IAAIL,KAExD,MAAMQ,EAASjE,KAAK2D,SAASO,IAAIJ,GACjC,GAAIG,EAAOF,IAAIxB,GACX,OAAO0B,EAAOC,IAAI3B,GAGtB,MAAMtC,EAAMD,KAAK0D,OAAOxD,OAIxB,OAHAF,KAAK0D,OAAOvD,KAAK0D,GACjBI,EAAOD,IAAIzB,EAAKtC,GAETA,CACX,CAUOkE,eAAAA,CAAgBZ,GACnBvD,KAAKuD,QAAUA,EACfvD,KAAKwD,cAAgB,IAAIC,IACzBzD,KAAK0D,OAAS,GACd1D,KAAK2D,SAAW,IAAIF,IAEpB,IAAK,MAAMW,UAAgBb,QAAQc,SAAU,CACzC,MAAMX,EAASU,EAAQE,SAASC,YAChC,IAAK,IAAIC,EAAI,EAAGA,EAAId,EAAOxD,OAAS,EAAGsE,IAAK,CACxC,MAAMC,EAAOzE,KAAK4D,gBAAgBF,EAAOc,IACnCE,EAAO1E,KAAK4D,gBAAgBF,EAAOc,EAAI,IACvCG,EAAW3E,KAAKsD,oBAAoBI,EAAOc,GAAId,EAAOc,EAAI,IAE3DxE,KAAKwD,cAAcO,IAAIU,IAAOzE,KAAKwD,cAAcQ,IAAIS,EAAM,IAC3DzE,KAAKwD,cAAcO,IAAIW,IAAO1E,KAAKwD,cAAcQ,IAAIU,EAAM,IAEhE1E,KAAKwD,cAAcU,IAAIO,GAAOtE,KAAK,CAAEL,KAAM4E,EAAMC,aACjD3E,KAAKwD,cAAcU,IAAIQ,GAAOvE,KAAK,CAAEL,KAAM2E,EAAME,YACrD,CACJ,CACJ,CAWOC,QAAAA,CAASC,EAAuBC,GACnC,IAAK9E,KAAKuD,QACN,MAAM,IAAIwB,MAAM,oEAGpB,MAAMC,EAAWhF,KAAK4D,gBAAgBiB,EAAMP,SAASC,aAC/CU,EAASjF,KAAK4D,gBAAgBkB,EAAIR,SAASC,aAEjD,GAAIS,IAAaC,EACb,OAAO,KAGX,MAAMC,EAAU,IAAI3F,EACpB2F,EAAQvF,OAAO,EAAGqF,GAClB,MAAMG,EAAW,IAAI1B,IACf2B,EAAS,IAAI3B,IAAoB,CAAC,CAACuB,EAAU,KAEnD,KAAOE,EAAQvE,OAAS,GAAG,CACvB,MAAM0E,EAAUH,EAAQ5E,aAExB,GAAI+E,IAAYJ,EAAQ,CACpB,MAAMK,EAAmB,GACzB,IAAIC,EAA+BF,EACnC,UAAoBG,IAAbD,GACHD,EAAKG,QAAQzF,KAAK0D,OAAO6B,IACzBA,EAAWJ,EAASjB,IAAIqB,GAE5B,MAAO,CACHG,KAAM,UACNpB,SAAU,CAAEoB,KAAM,aAAcnB,YAAae,GAC7CK,WAAY,CAAA,EAEpB,CAEA,MAAMC,EAAY5F,KAAKwD,cAAcU,IAAImB,IAAY,GAErD,IAAK,MAAMQ,KAAYD,EAAW,CAAA,IAAAE,EAAAC,EAC9B,MAAMC,UAAkBF,EAACV,EAAOlB,IAAImB,IAAQS,EAAIG,UAAYJ,EAASlB,SACrE,GAAIqB,UAAeD,EAAIX,EAAOlB,IAAI2B,EAAS/F,OAAKiG,EAAIE,UAAW,CAC3Dd,EAASnB,IAAI6B,EAAS/F,KAAMuF,GAC5BD,EAAOpB,IAAI6B,EAAS/F,KAAMkG,GAC1B,MAAME,EAASF,EAAkBhG,KAAKsD,oBAAoBtD,KAAK0D,OAAOmC,EAAS/F,MAAOE,KAAK0D,OAAOuB,IAClGC,EAAQvF,OAAOuG,EAAQL,EAAS/F,KACpC,CACJ,CACJ,CAEA,OAAO,IACX"}
+{"version":3,"file":"terra-route.modern.js","sources":["../src/fibonacci-heap.ts","../src/distance/haversine.ts","../src/distance/cheap-ruler.ts","../src/terra-route.ts"],"sourcesContent":["type FibNode = {\n    key: number;\n    value: number;\n    degree: number;\n    mark: boolean;\n    parent: FibNode | null;\n    child: FibNode | null;\n    left: FibNode;\n    right: FibNode;\n};\n\nexport class FibonacciHeap {\n    private nodeCount = 0;\n    private minNode: FibNode | null = null;\n\n    insert(key: number, value: number): void {\n        const node: FibNode = {\n            key,\n            value,\n            degree: 0,\n            mark: false,\n            parent: null,\n            child: null,\n            left: null as any,\n            right: null as any,\n        };\n        node.left = node;\n        node.right = node;\n\n        this.minNode = this.mergeLists(this.minNode, node);\n        this.nodeCount++;\n    }\n\n    extractMin(): number | null {\n        const z = this.minNode;\n        if (!z) return null;\n\n        // Add children to root list\n        if (z.child) {\n            let child = z.child;\n            do {\n                child.parent = null;\n                child = child.right!;\n            } while (child !== z.child);\n            this.minNode = this.mergeLists(this.minNode, z.child);\n        }\n\n        this.removeFromList(z);\n\n        if (z === z.right) {\n            this.minNode = null;\n        } else {\n            this.minNode = z.right;\n            this.consolidate();\n        }\n\n        this.nodeCount--;\n        return z.value;\n    }\n\n    size(): number {\n        return this.nodeCount;\n    }\n\n    // ========== Internal Methods ==========\n\n    private consolidate(): void {\n        const maxDegree = Math.floor(Math.log2(this.nodeCount)) + 1;\n        const A = new Array<FibNode | null>(maxDegree).fill(null);\n\n        const rootList: FibNode[] = [];\n        let curr = this.minNode!;\n        do {\n            rootList.push(curr);\n            curr = curr.right!;\n        } while (curr !== this.minNode);\n\n        for (const w of rootList) {\n            let x = w;\n            let d = x.degree;\n            while (A[d]) {\n                let y = A[d]!;\n                if (x.key > y.key) {\n                    const temp = x;\n                    x = y;\n                    y = temp;\n                }\n                this.link(y, x);\n                A[d] = null;\n                d++;\n            }\n            A[d] = x;\n        }\n\n        this.minNode = null;\n        for (const node of A) {\n            if (node) {\n                this.minNode = this.mergeLists(this.minNode, node);\n            }\n        }\n    }\n\n    private link(y: FibNode, x: FibNode): void {\n        this.removeFromList(y);\n        y.left = y.right = y;\n        x.child = this.mergeLists(x.child, y);\n        y.parent = x;\n        x.degree++;\n        y.mark = false;\n    }\n\n    private mergeLists(a: FibNode | null, b: FibNode | null): FibNode {\n        if (!a) return b!;\n        if (!b) return a;\n\n        const aRight = a.right!;\n        const bRight = b.right!;\n\n        a.right = bRight;\n        bRight.left = a;\n        b.right = aRight;\n        aRight.left = b;\n\n        return a.key < b.key ? a : b;\n    }\n\n    private removeFromList(node: FibNode): void {\n        node.left.right = node.right;\n        node.right.left = node.left;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { FibonacciHeap } from \"./fibonacci-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const index = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, index);\n\n        return index;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIndex = this.coordinateIndex(coords[i]);\n                const bIndex = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIndex)) this.adjacencyList.set(aIndex, []);\n                if (!this.adjacencyList.has(bIndex)) this.adjacencyList.set(bIndex, []);\n\n                this.adjacencyList.get(aIndex)!.push({ node: bIndex, distance });\n                this.adjacencyList.get(bIndex)!.push({ node: aIndex, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using bidirectional A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildRouteGraph(network) first.\");\n        }\n\n        const startIndex = this.coordinateIndex(start.geometry.coordinates);\n        const endIndex = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIndex === endIndex) {\n            return null;\n        }\n\n        const openSetForward = new FibonacciHeap();\n        const openSetBackward = new FibonacciHeap();\n        openSetForward.insert(0, startIndex);\n        openSetBackward.insert(0, endIndex);\n\n        const cameFromForward = new Map<number, number>();\n        const cameFromBackward = new Map<number, number>();\n        const gScoreForward = new Map<number, number>([[startIndex, 0]]);\n        const gScoreBackward = new Map<number, number>([[endIndex, 0]]);\n\n        const visitedForward = new Set<number>();\n        const visitedBackward = new Set<number>();\n\n        let meetingNode: number | null = null;\n\n        while (openSetForward.size() > 0 && openSetBackward.size() > 0) {\n            const currentForward = openSetForward.extractMin()!;\n            visitedForward.add(currentForward);\n\n            if (visitedBackward.has(currentForward)) {\n                meetingNode = currentForward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentForward) || []) {\n                const tentativeG = (gScoreForward.get(currentForward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreForward.get(neighbor.node) ?? Infinity)) {\n                    cameFromForward.set(neighbor.node, currentForward);\n                    gScoreForward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIndex]);\n                    openSetForward.insert(fScore, neighbor.node);\n                }\n            }\n\n            const currentBackward = openSetBackward.extractMin()!;\n            visitedBackward.add(currentBackward);\n\n            if (visitedForward.has(currentBackward)) {\n                meetingNode = currentBackward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentBackward) || []) {\n                const tentativeG = (gScoreBackward.get(currentBackward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreBackward.get(neighbor.node) ?? Infinity)) {\n                    cameFromBackward.set(neighbor.node, currentBackward);\n                    gScoreBackward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[startIndex]);\n                    openSetBackward.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        if (meetingNode === null) {\n            return null;\n        }\n\n        // Reconstruct forward path\n        const pathForward: Position[] = [];\n        let node = meetingNode;\n        while (node !== undefined) {\n            pathForward.unshift(this.coords[node]);\n            node = cameFromForward.get(node)!;\n        }\n\n        // Reconstruct backward path (omit meeting node to avoid duplication)\n        const pathBackward: Position[] = [];\n        node = cameFromBackward.get(meetingNode)!;\n        while (node !== undefined) {\n            pathBackward.push(this.coords[node]);\n            node = cameFromBackward.get(node)!;\n        }\n\n        const fullPath = [...pathForward, ...pathBackward];\n\n        return {\n            type: \"Feature\",\n            geometry: { type: \"LineString\", coordinates: fullPath },\n            properties: {},\n        };\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }"],"names":["FibonacciHeap","constructor","nodeCount","minNode","insert","key","value","node","degree","mark","parent","child","left","right","this","mergeLists","extractMin","z","removeFromList","consolidate","size","maxDegree","Math","floor","log2","A","Array","fill","rootList","curr","push","w","x","d","y","temp","link","a","b","aRight","bRight","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","sin","cos","atan2","sqrt","createCheapRuler","lat","FE","E2","RAD","cosLat","w2","m","kx","ky","deltaLng","dx","dy","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","has","set","latMap","get","index","length","buildRouteGraph","feature","features","geometry","coordinates","i","aIndex","bIndex","distance","getRoute","start","end","Error","startIndex","endIndex","openSetForward","openSetBackward","cameFromForward","cameFromBackward","gScoreForward","gScoreBackward","visitedForward","Set","visitedBackward","meetingNode","currentForward","add","neighbor","_gScoreForward$get","_gScoreForward$get2","tentativeG","Infinity","fScore","currentBackward","_gScoreBackward$get","_gScoreBackward$get2","pathForward","undefined","unshift","pathBackward","type","properties"],"mappings":"AAWa,MAAAA,EAAaC,WAAAA,GACdC,KAAAA,UAAY,EACZC,KAAAA,QAA0B,IAAI,CAEtCC,MAAAA,CAAOC,EAAaC,GAChB,MAAMC,EAAgB,CAClBF,MACAC,QACAE,OAAQ,EACRC,MAAM,EACNC,OAAQ,KACRC,MAAO,KACPC,KAAM,KACNC,MAAO,MAEXN,EAAKK,KAAOL,EACZA,EAAKM,MAAQN,EAEbO,KAAKX,QAAUW,KAAKC,WAAWD,KAAKX,QAASI,GAC7CO,KAAKZ,WACT,CAEAc,UAAAA,GACI,MAAMC,EAAIH,KAAKX,QACf,IAAKc,EAAG,OAAW,KAGnB,GAAIA,EAAEN,MAAO,CACT,IAAIA,EAAQM,EAAEN,MACd,GACIA,EAAMD,OAAS,KACfC,EAAQA,EAAME,YACTF,IAAUM,EAAEN,OACrBG,KAAKX,QAAUW,KAAKC,WAAWD,KAAKX,QAASc,EAAEN,MACnD,CAYA,OAVAG,KAAKI,eAAeD,GAEhBA,IAAMA,EAAEJ,MACRC,KAAKX,QAAU,MAEfW,KAAKX,QAAUc,EAAEJ,MACjBC,KAAKK,eAGTL,KAAKZ,YACEe,EAAEX,KACb,CAEAc,IAAAA,GACI,YAAYlB,SAChB,CAIQiB,WAAAA,GACJ,MAAME,EAAYC,KAAKC,MAAMD,KAAKE,KAAKV,KAAKZ,YAAc,EACpDuB,EAAI,IAAIC,MAAsBL,GAAWM,KAAK,MAE9CC,EAAsB,GAC5B,IAAIC,EAAOf,KAAKX,QAChB,GACIyB,EAASE,KAAKD,GACdA,EAAOA,EAAKhB,YACPgB,IAASf,KAAKX,SAEvB,IAAK,MAAM4B,KAAKH,EAAU,CACtB,IAAII,EAAID,EACJE,EAAID,EAAExB,OACV,KAAOiB,EAAEQ,IAAI,CACT,IAAIC,EAAIT,EAAEQ,GACV,GAAID,EAAE3B,IAAM6B,EAAE7B,IAAK,CACf,MAAM8B,EAAOH,EACbA,EAAIE,EACJA,EAAIC,CACR,CACArB,KAAKsB,KAAKF,EAAGF,GACbP,EAAEQ,GAAK,KACPA,GACJ,CACAR,EAAEQ,GAAKD,CACX,CAEAlB,KAAKX,QAAU,KACf,IAAK,MAAMI,KAAQkB,EACXlB,IACAO,KAAKX,QAAUW,KAAKC,WAAWD,KAAKX,QAASI,GAGzD,CAEQ6B,IAAAA,CAAKF,EAAYF,GACrBlB,KAAKI,eAAegB,GACpBA,EAAEtB,KAAOsB,EAAErB,MAAQqB,EACnBF,EAAErB,MAAQG,KAAKC,WAAWiB,EAAErB,MAAOuB,GACnCA,EAAExB,OAASsB,EACXA,EAAExB,SACF0B,EAAEzB,MAAO,CACb,CAEQM,UAAAA,CAAWsB,EAAmBC,GAClC,IAAKD,EAAG,OAAOC,EACf,IAAKA,EAAG,OAAOD,EAEf,MAAME,EAASF,EAAExB,MACX2B,EAASF,EAAEzB,MAOjB,OALAwB,EAAExB,MAAQ2B,EACVA,EAAO5B,KAAOyB,EACdC,EAAEzB,MAAQ0B,EACVA,EAAO3B,KAAO0B,EAEPD,EAAEhC,IAAMiC,EAAEjC,IAAMgC,EAAIC,CAC/B,CAEQpB,cAAAA,CAAeX,GACnBA,EAAKK,KAAKC,MAAQN,EAAKM,MACvBN,EAAKM,MAAMD,KAAOL,EAAKK,IAC3B,EC/HS,MAAA6B,EAAoBA,CAACC,EAAoBC,KAClD,MAAMC,EAAaC,GAAsBA,EAAWvB,KAAKwB,GAAM,IAEzDC,EAASH,EAAUF,EAAS,IAC5BM,EAAYJ,EAAUF,EAAS,IAC/BO,EAASL,EAAUD,EAAS,IAE5BO,EAAWD,EAASF,EACpBI,EAFYP,EAAUD,EAAS,IAELK,EAE1BX,EACFf,KAAK8B,IAAIF,EAAW,GAAK5B,KAAK8B,IAAIF,EAAW,GAC7C5B,KAAK+B,IAAIN,GACTzB,KAAK+B,IAAIJ,GACT3B,KAAK8B,IAAID,EAAc,GACvB7B,KAAK8B,IAAID,EAAc,GAM3B,OALU,EAAI7B,KAAKgC,MAAMhC,KAAKiC,KAAKlB,GAAIf,KAAKiC,KAAK,EAAIlB,IAEtC,OAGG,KCShB,SAAUmB,EAAiBC,GAC7B,MACMC,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMtC,KAAKwB,GAAK,IAEhBe,EAASvC,KAAK+B,IAAII,EAAMG,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjC9B,EAAIT,KAAKiC,KAAKO,GAEdC,EATK,SASDH,EACJI,EAAKD,EAAIhC,EAAI8B,EACbI,EAAKF,EAAIhC,EAAI+B,GAAM,EAAIH,GAE7B,OAAgB,SAAStB,EAAaC,GAClC,IAAI4B,EAAW7B,EAAE,GAAKC,EAAE,GAExB,KAAO4B,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,MAAMC,EAAKD,EAAWF,EAChBI,GAAM/B,EAAE,GAAKC,EAAE,IAAM2B,EAE3B,OAAO3C,KAAKiC,KAAKY,EAAKA,EAAKC,EAAKA,EACpC,CACJ,CC7CA,MAAMC,EAYFpE,WAAAA,CACIqE,GAA0ExD,KAZtEyD,aAAO,EAAAzD,KACPwD,yBAAmB,EAAAxD,KACnB0D,cAAwE,IAAIC,IAC5EC,KAAAA,OAAqB,GACrBC,KAAAA,SAA6C,IAAIF,IAUrD3D,KAAKwD,oBAAsBA,GAA4C7B,CAC3E,CASQmC,eAAAA,CAAgBC,GACpB,MAAOC,EAAKrB,GAAOoB,EACd/D,KAAK6D,SAASI,IAAID,IAAMhE,KAAK6D,SAASK,IAAIF,EAAK,IAAIL,KAExD,MAAMQ,EAASnE,KAAK6D,SAASO,IAAIJ,GACjC,GAAIG,EAAOF,IAAItB,GACX,OAAOwB,EAAOC,IAAIzB,GAGtB,MAAM0B,EAAQrE,KAAK4D,OAAOU,OAI1B,OAHAtE,KAAK4D,OAAO5C,KAAK+C,GACjBI,EAAOD,IAAIvB,EAAK0B,GAETA,CACX,CAUOE,eAAAA,CAAgBd,GACnBzD,KAAKyD,QAAUA,EACfzD,KAAK0D,cAAgB,IAAIC,IACzB3D,KAAK4D,OAAS,GACd5D,KAAK6D,SAAW,IAAIF,IAEpB,IAAK,MAAMa,KAAWxE,KAAKyD,QAAQgB,SAAU,CACzC,MAAMb,EAASY,EAAQE,SAASC,YAChC,IAAK,IAAIC,EAAI,EAAGA,EAAIhB,EAAOU,OAAS,EAAGM,IAAK,CACxC,MAAMC,EAAS7E,KAAK8D,gBAAgBF,EAAOgB,IACrCE,EAAS9E,KAAK8D,gBAAgBF,EAAOgB,EAAI,IACzCG,EAAW/E,KAAKwD,oBAAoBI,EAAOgB,GAAIhB,EAAOgB,EAAI,IAE3D5E,KAAK0D,cAAcO,IAAIY,IAAS7E,KAAK0D,cAAcQ,IAAIW,EAAQ,IAC/D7E,KAAK0D,cAAcO,IAAIa,IAAS9E,KAAK0D,cAAcQ,IAAIY,EAAQ,IAEpE9E,KAAK0D,cAAcU,IAAIS,GAAS7D,KAAK,CAAEvB,KAAMqF,EAAQC,aACrD/E,KAAK0D,cAAcU,IAAIU,GAAS9D,KAAK,CAAEvB,KAAMoF,EAAQE,YACzD,CACJ,CACJ,CAWOC,QAAAA,CAASC,EAAuBC,GACnC,IAAKlF,KAAKyD,QACN,MAAM,IAAI0B,MAAM,kEAGpB,MAAMC,EAAapF,KAAK8D,gBAAgBmB,EAAMP,SAASC,aACjDU,EAAWrF,KAAK8D,gBAAgBoB,EAAIR,SAASC,aAEnD,GAAIS,IAAeC,EACf,OACJ,KAEA,MAAMC,EAAiB,IAAIpG,EACrBqG,EAAkB,IAAIrG,EAC5BoG,EAAehG,OAAO,EAAG8F,GACzBG,EAAgBjG,OAAO,EAAG+F,GAE1B,MAAMG,EAAkB,IAAI7B,IACtB8B,EAAmB,IAAI9B,IACvB+B,EAAgB,IAAI/B,IAAoB,CAAC,CAACyB,EAAY,KACtDO,EAAiB,IAAIhC,IAAoB,CAAC,CAAC0B,EAAU,KAErDO,EAAiB,IAAIC,IACrBC,EAAkB,IAAID,IAE5B,IAAIE,EAA6B,KAEjC,KAAOT,EAAehF,OAAS,GAAKiF,EAAgBjF,OAAS,GAAG,CAC5D,MAAM0F,EAAiBV,EAAepF,aAGtC,GAFA0F,EAAeK,IAAID,GAEfF,EAAgB7B,IAAI+B,GAAiB,CACrCD,EAAcC,EACd,KACJ,CAEA,IAAK,MAAME,KAAYlG,KAAK0D,cAAcU,IAAI4B,IAAmB,GAAI,CAAAG,IAAAA,EAAAC,EACjE,MAAMC,GAA+CF,OAAlCA,EAACT,EAActB,IAAI4B,IAAeG,EAAIG,UAAYJ,EAASnB,SAC9E,GAAIsB,GAA8C,OAApCD,EAAIV,EAActB,IAAI8B,EAASzG,OAAK2G,EAAIE,UAAW,CAC7Dd,EAAgBtB,IAAIgC,EAASzG,KAAMuG,GACnCN,EAAcxB,IAAIgC,EAASzG,KAAM4G,GACjC,MAAME,EAASF,EAAarG,KAAKwD,oBAAoBxD,KAAK4D,OAAOsC,EAASzG,MAAOO,KAAK4D,OAAOyB,IAC7FC,EAAehG,OAAOiH,EAAQL,EAASzG,KAC3C,CACJ,CAEA,MAAM+G,EAAkBjB,EAAgBrF,aAGxC,GAFA4F,EAAgBG,IAAIO,GAEhBZ,EAAe3B,IAAIuC,GAAkB,CACrCT,EAAcS,EACd,KACJ,CAEA,IAAK,MAAMN,KAAgBlG,KAAC0D,cAAcU,IAAIoC,IAAoB,GAAI,CAAAC,IAAAA,EAAAC,EAClE,MAAML,GAAiDI,OAApCA,EAACd,EAAevB,IAAIoC,IAAgBC,EAAIH,UAAYJ,EAASnB,SAChF,GAAIsB,GAA+C,OAArCK,EAAIf,EAAevB,IAAI8B,EAASzG,OAAKiH,EAAIJ,UAAW,CAC9Db,EAAiBvB,IAAIgC,EAASzG,KAAM+G,GACpCb,EAAezB,IAAIgC,EAASzG,KAAM4G,GAClC,MAAME,EAASF,EAAarG,KAAKwD,oBAAoBxD,KAAK4D,OAAOsC,EAASzG,MAAOO,KAAK4D,OAAOwB,IAC7FG,EAAgBjG,OAAOiH,EAAQL,EAASzG,KAC5C,CACJ,CACJ,CAEA,GAAoB,OAAhBsG,EACA,OACJ,KAGA,MAAMY,EAA0B,GAChC,IAAIlH,EAAOsG,EACX,UAAgBa,IAATnH,GACHkH,EAAYE,QAAQ7G,KAAK4D,OAAOnE,IAChCA,EAAO+F,EAAgBpB,IAAI3E,GAI/B,MAAMqH,EAA2B,GAEjC,IADArH,EAAOgG,EAAiBrB,IAAI2B,QACZa,IAATnH,GACHqH,EAAa9F,KAAKhB,KAAK4D,OAAOnE,IAC9BA,EAAOgG,EAAiBrB,IAAI3E,GAKhC,MAAO,CACHsH,KAAM,UACNrC,SAAU,CAAEqC,KAAM,aAAcpC,YAJnB,IAAIgC,KAAgBG,IAKjCE,WAAY,GAEpB"}

package/dist/terra-route.module.js

@@ -1,2 +1,2 @@
-function t(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=Array(e);r<e;r++)n[r]=t[r];return n}function e(e,r){var n="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(n)return(n=n.call(e)).next.bind(n);if(Array.isArray(e)||(n=function(e,r){if(e){if("string"==typeof e)return t(e,r);var n={}.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?t(e,r):void 0}}(e))||r&&e&&"number"==typeof e.length){n&&(e=n);var i=0;return function(){return i>=e.length?{done:!0}:{done:!1,value:e[i++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var r=/*#__PURE__*/function(){function t(){this.heap=[],this.insertCounter=0}var e=t.prototype;return e.insert=function(t,e){var r={key:t,value:e,index:this.insertCounter++},n=this.heap.length;for(this.heap.push(r);n>0;){var i=n-1>>>1,a=this.heap[i];if(r.key>a.key||r.key===a.key&&r.index>a.index)break;this.heap[n]=a,n=i}this.heap[n]=r},e.extractMin=function(){var t=this.heap.length;if(0===t)return null;var e=this.heap[0],r=this.heap.pop();return t>1&&(this.heap[0]=r,this.bubbleDown(0)),e.value},e.size=function(){return this.heap.length},e.bubbleDown=function(t){for(var e=this.heap,r=e.length,n=e[t],i=n.key,a=n.index;;){var o=1+(t<<1);if(o>=r)break;var s=o,h=e[o].key,c=e[o].index,u=o+1;if(u<r){var d=e[u].key,f=e[u].index;(d<h||d===h&&f<c)&&(s=u,h=d,c=f)}if(!(h<i||h===i&&c<a))break;e[t]=e[s],t=s}e[t]=n},t}(),n=function(t,e){var r=function(t){return t*Math.PI/180},n=r(t[1]),i=r(t[0]),a=r(e[1]),o=a-n,s=r(e[0])-i,h=Math.sin(o/2)*Math.sin(o/2)+Math.cos(n)*Math.cos(a)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};function i(t){var e=1/298.257223563,r=e*(2-e),n=Math.PI/180,i=Math.cos(t*n),a=1/(1-r*(1-i*i)),o=Math.sqrt(a),s=6378.137*n,h=s*o*i,c=s*o*a*(1-r);return function(t,e){for(var r=t[0]-e[0];r<-180;)r+=360;for(;r>180;)r-=360;var n=r*h,i=(t[1]-e[1])*c;return Math.sqrt(n*n+i*i)}}var a=/*#__PURE__*/function(){function t(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||n}var i=t.prototype;return i.coordinateIndex=function(t){var e=t[0],r=t[1];this.coordMap.has(e)||this.coordMap.set(e,new Map);var n=this.coordMap.get(e);if(n.has(r))return n.get(r);var i=this.coords.length;return this.coords.push(t),n.set(r,i),i},i.buildRouteGraph=function(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(var r,n=e(this.network.features);!(r=n()).done;)for(var i=r.value.geometry.coordinates,a=0;a<i.length-1;a++){var o=this.coordinateIndex(i[a]),s=this.coordinateIndex(i[a+1]),h=this.distanceMeasurement(i[a],i[a+1]);this.adjacencyList.has(o)||this.adjacencyList.set(o,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(o).push({node:s,distance:h}),this.adjacencyList.get(s).push({node:o,distance:h})}},i.getRoute=function(t,n){if(!this.network)throw new Error("Network not built. Please call buildNetworkGraph(network) first.");var i=this.coordinateIndex(t.geometry.coordinates),a=this.coordinateIndex(n.geometry.coordinates);if(i===a)return null;var o=new r;o.insert(0,i);for(var s=new Map,h=new Map([[i,0]]);o.size()>0;){var c=o.extractMin();if(c===a){for(var u=[],d=c;void 0!==d;)u.unshift(this.coords[d]),d=s.get(d);return{type:"Feature",geometry:{type:"LineString",coordinates:u},properties:{}}}for(var f,p=e(this.adjacencyList.get(c)||[]);!(f=p()).done;){var l,v,y=f.value,M=(null!=(l=h.get(c))?l:Infinity)+y.distance;if(M<(null!=(v=h.get(y.node))?v:Infinity)){s.set(y.node,c),h.set(y.node,M);var g=M+this.distanceMeasurement(this.coords[y.node],this.coords[a]);o.insert(g,y.node)}}}return null},t}();export{a as TerraRoute,i as createCheapRuler,n as haversineDistance};
+function t(t,e){(null==e||e>t.length)&&(e=t.length);for(var n=0,r=Array(e);n<e;n++)r[n]=t[n];return r}function e(e,n){var r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(r)return(r=r.call(e)).next.bind(r);if(Array.isArray(e)||(r=function(e,n){if(e){if("string"==typeof e)return t(e,n);var r={}.toString.call(e).slice(8,-1);return"Object"===r&&e.constructor&&(r=e.constructor.name),"Map"===r||"Set"===r?Array.from(e):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?t(e,n):void 0}}(e))||n&&e&&"number"==typeof e.length){r&&(e=r);var i=0;return function(){return i>=e.length?{done:!0}:{done:!1,value:e[i++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var n=/*#__PURE__*/function(){function t(){this.nodeCount=0,this.minNode=null}var n=t.prototype;return n.insert=function(t,e){var n={key:t,value:e,degree:0,mark:!1,parent:null,child:null,left:null,right:null};n.left=n,n.right=n,this.minNode=this.mergeLists(this.minNode,n),this.nodeCount++},n.extractMin=function(){var t=this.minNode;if(!t)return null;if(t.child){var e=t.child;do{e.parent=null,e=e.right}while(e!==t.child);this.minNode=this.mergeLists(this.minNode,t.child)}return this.removeFromList(t),t===t.right?this.minNode=null:(this.minNode=t.right,this.consolidate()),this.nodeCount--,t.value},n.size=function(){return this.nodeCount},n.consolidate=function(){var t=Math.floor(Math.log2(this.nodeCount))+1,n=new Array(t).fill(null),r=[],i=this.minNode;do{r.push(i),i=i.right}while(i!==this.minNode);for(var o=0,a=r;o<a.length;o++){for(var s=a[o],h=s.degree;n[h];){var d=n[h];if(s.key>d.key){var c=s;s=d,d=c}this.link(d,s),n[h]=null,h++}n[h]=s}this.minNode=null;for(var u,l=e(n);!(u=l()).done;){var f=u.value;f&&(this.minNode=this.mergeLists(this.minNode,f))}},n.link=function(t,e){this.removeFromList(t),t.left=t.right=t,e.child=this.mergeLists(e.child,t),t.parent=e,e.degree++,t.mark=!1},n.mergeLists=function(t,e){if(!t)return e;if(!e)return t;var n=t.right,r=e.right;return t.right=r,r.left=t,e.right=n,n.left=e,t.key<e.key?t:e},n.removeFromList=function(t){t.left.right=t.right,t.right.left=t.left},t}(),r=function(t,e){var n=function(t){return t*Math.PI/180},r=n(t[1]),i=n(t[0]),o=n(e[1]),a=o-r,s=n(e[0])-i,h=Math.sin(a/2)*Math.sin(a/2)+Math.cos(r)*Math.cos(o)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};function i(t){var e=1/298.257223563,n=e*(2-e),r=Math.PI/180,i=Math.cos(t*r),o=1/(1-n*(1-i*i)),a=Math.sqrt(o),s=6378.137*r,h=s*a*i,d=s*a*o*(1-n);return function(t,e){for(var n=t[0]-e[0];n<-180;)n+=360;for(;n>180;)n-=360;var r=n*h,i=(t[1]-e[1])*d;return Math.sqrt(r*r+i*i)}}var o=/*#__PURE__*/function(){function t(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||r}var i=t.prototype;return i.coordinateIndex=function(t){var e=t[0],n=t[1];this.coordMap.has(e)||this.coordMap.set(e,new Map);var r=this.coordMap.get(e);if(r.has(n))return r.get(n);var i=this.coords.length;return this.coords.push(t),r.set(n,i),i},i.buildRouteGraph=function(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(var n,r=e(this.network.features);!(n=r()).done;)for(var i=n.value.geometry.coordinates,o=0;o<i.length-1;o++){var a=this.coordinateIndex(i[o]),s=this.coordinateIndex(i[o+1]),h=this.distanceMeasurement(i[o],i[o+1]);this.adjacencyList.has(a)||this.adjacencyList.set(a,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(a).push({node:s,distance:h}),this.adjacencyList.get(s).push({node:a,distance:h})}},i.getRoute=function(t,r){if(!this.network)throw new Error("Network not built. Please call buildRouteGraph(network) first.");var i=this.coordinateIndex(t.geometry.coordinates),o=this.coordinateIndex(r.geometry.coordinates);if(i===o)return null;var a=new n,s=new n;a.insert(0,i),s.insert(0,o);for(var h=new Map,d=new Map,c=new Map([[i,0]]),u=new Map([[o,0]]),l=new Set,f=new Set,v=null;a.size()>0&&s.size()>0;){var g=a.extractMin();if(l.add(g),f.has(g)){v=g;break}for(var m,y=e(this.adjacencyList.get(g)||[]);!(m=y()).done;){var p,M,w=m.value,L=(null!=(p=c.get(g))?p:Infinity)+w.distance;if(L<(null!=(M=c.get(w.node))?M:Infinity)){h.set(w.node,g),c.set(w.node,L);var k=L+this.distanceMeasurement(this.coords[w.node],this.coords[o]);a.insert(k,w.node)}}var b=s.extractMin();if(f.add(b),l.has(b)){v=b;break}for(var I,N=e(this.adjacencyList.get(b)||[]);!(I=N()).done;){var j,x,S=I.value,A=(null!=(j=u.get(b))?j:Infinity)+S.distance;if(A<(null!=(x=u.get(S.node))?x:Infinity)){d.set(S.node,b),u.set(S.node,A);var C=A+this.distanceMeasurement(this.coords[S.node],this.coords[i]);s.insert(C,S.node)}}}if(null===v)return null;for(var q=[],F=v;void 0!==F;)q.unshift(this.coords[F]),F=h.get(F);var z=[];for(F=d.get(v);void 0!==F;)z.push(this.coords[F]),F=d.get(F);return{type:"Feature",geometry:{type:"LineString",coordinates:[].concat(q,z)},properties:{}}},t}();export{o as TerraRoute,i as createCheapRuler,r as haversineDistance};
 //# sourceMappingURL=terra-route.module.js.map

package/dist/terra-route.module.js.map

@@ -1 +1 @@
-{"version":3,"file":"terra-route.module.js","sources":["../src/min-heap.ts","../src/distance/haversine.ts","../src/distance/cheap-ruler.ts","../src/terra-route.ts"],"sourcesContent":["export class MinHeap {\n    private heap: Array<{ key: number; value: number; index: number }> = [];\n    private insertCounter = 0;\n\n    insert(key: number, value: number): void {\n        const node = { key, value, index: this.insertCounter++ };\n        let idx = this.heap.length;\n        this.heap.push(node);\n\n        // Optimized Bubble Up\n        while (idx > 0) {\n            const parentIdx = (idx - 1) >>> 1; // Fast Math.floor((idx - 1) / 2)\n            const parent = this.heap[parentIdx];\n            if (node.key > parent.key || (node.key === parent.key && node.index > parent.index)) break;\n            this.heap[idx] = parent;\n            idx = parentIdx;\n        }\n        this.heap[idx] = node;\n    }\n\n    extractMin(): number | null {\n        const length = this.heap.length;\n        if (length === 0) return null;\n\n        const minNode = this.heap[0];\n        const endNode = this.heap.pop()!;\n\n        if (length > 1) {\n            this.heap[0] = endNode;\n            this.bubbleDown(0);\n        }\n\n        return minNode.value;\n    }\n\n    size(): number {\n        return this.heap.length;\n    }\n\n    private bubbleDown(idx: number): void {\n        const { heap } = this;\n        const length = heap.length;\n        // Grab the parent node once, then move it down only if needed\n        const node = heap[idx];\n        const nodeKey = node.key;\n        const nodeIndex = node.index;\n\n        while (true) {\n            // Calculate left and right child indexes\n            const leftIdx = (idx << 1) + 1;\n            if (leftIdx >= length) {\n                // No children => we’re already in place\n                break;\n            }\n\n            // Assume left child is the smaller one by default\n            let smallestIdx = leftIdx;\n            let smallestKey = heap[leftIdx].key;\n            let smallestIndex = heap[leftIdx].index;\n\n            const rightIdx = leftIdx + 1;\n            if (rightIdx < length) {\n                // Compare left child vs. right child\n                const rightKey = heap[rightIdx].key;\n                const rightIndex = heap[rightIdx].index;\n                if (rightKey < smallestKey || (rightKey === smallestKey && rightIndex < smallestIndex)) {\n                    smallestIdx = rightIdx;\n                    smallestKey = rightKey;\n                    smallestIndex = rightIndex;\n                }\n            }\n\n            // Compare the smaller child with the parent\n            if (smallestKey < nodeKey || (smallestKey === nodeKey && smallestIndex < nodeIndex)) {\n                // Swap the smaller child up\n                heap[idx] = heap[smallestIdx];\n                idx = smallestIdx;\n            } else {\n                // We’re in the correct position now, so stop\n                break;\n            }\n        }\n\n        // Place the original node in its final position\n        heap[idx] = node;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { MinHeap } from \"./min-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const idx = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, idx);\n\n        return idx;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIdx = this.coordinateIndex(coords[i]);\n                const bIdx = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIdx)) this.adjacencyList.set(aIdx, []);\n                if (!this.adjacencyList.has(bIdx)) this.adjacencyList.set(bIdx, []);\n\n                this.adjacencyList.get(aIdx)!.push({ node: bIdx, distance });\n                this.adjacencyList.get(bIdx)!.push({ node: aIdx, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildNetworkGraph(network) first.\");\n        }\n\n        const startIdx = this.coordinateIndex(start.geometry.coordinates);\n        const endIdx = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIdx === endIdx) {\n            return null;\n        }\n\n        const openSet = new MinHeap();\n        openSet.insert(0, startIdx);\n        const cameFrom = new Map<number, number>();\n        const gScore = new Map<number, number>([[startIdx, 0]]);\n\n        while (openSet.size() > 0) {\n            const current = openSet.extractMin()!;\n\n            if (current === endIdx) {\n                const path: Position[] = [];\n                let currNode: number | undefined = current;\n                while (currNode !== undefined) {\n                    path.unshift(this.coords[currNode]);\n                    currNode = cameFrom.get(currNode);\n                }\n                return {\n                    type: \"Feature\",\n                    geometry: { type: \"LineString\", coordinates: path },\n                    properties: {},\n                };\n            }\n\n            const neighbors = this.adjacencyList.get(current) || [];\n\n            for (const neighbor of neighbors) {\n                const tentativeGScore = (gScore.get(current) ?? Infinity) + neighbor.distance;\n                if (tentativeGScore < (gScore.get(neighbor.node) ?? Infinity)) {\n                    cameFrom.set(neighbor.node, current);\n                    gScore.set(neighbor.node, tentativeGScore);\n                    const fScore = tentativeGScore + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIdx]);\n                    openSet.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        return null;\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }"],"names":["MinHeap","this","heap","insertCounter","_proto","prototype","insert","key","value","node","index","idx","length","push","parentIdx","parent","extractMin","minNode","endNode","pop","bubbleDown","size","nodeKey","nodeIndex","leftIdx","smallestIdx","smallestKey","smallestIndex","rightIdx","rightKey","rightIndex","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","Math","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","a","sin","cos","atan2","sqrt","createCheapRuler","lat","FE","E2","RAD","cosLat","w2","w","m","kx","ky","b","deltaLng","dx","dy","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","has","set","latMap","get","buildRouteGraph","_iterator","_step","_createForOfIteratorHelperLoose","features","done","geometry","coordinates","i","aIdx","bIdx","distance","getRoute","start","end","Error","startIdx","endIdx","openSet","cameFrom","gScore","current","path","currNode","undefined","unshift","type","properties","_step2","_iterator2","_gScore$get","_gScore$get2","neighbor","tentativeGScore","Infinity","fScore"],"mappings":"oyBAAa,IAAAA,eAAO,WAAA,SAAAA,IAAAC,KACRC,KAA6D,GAC7DC,KAAAA,cAAgB,CAAC,KAAAC,EAAAJ,EAAAK,UAmFxB,OAnFwBD,EAEzBE,OAAA,SAAOC,EAAaC,GAChB,IAAMC,EAAO,CAAEF,IAAAA,EAAKC,MAAAA,EAAOE,MAAOT,KAAKE,iBACnCQ,EAAMV,KAAKC,KAAKU,OAIpB,IAHAX,KAAKC,KAAKW,KAAKJ,GAGRE,EAAM,GAAG,CACZ,IAAMG,EAAaH,EAAM,IAAO,EAC1BI,EAASd,KAAKC,KAAKY,GACzB,GAAIL,EAAKF,IAAMQ,EAAOR,KAAQE,EAAKF,MAAQQ,EAAOR,KAAOE,EAAKC,MAAQK,EAAOL,MAAQ,MACrFT,KAAKC,KAAKS,GAAOI,EACjBJ,EAAMG,CACV,CACAb,KAAKC,KAAKS,GAAOF,CACrB,EAACL,EAEDY,WAAA,WACI,IAAMJ,EAASX,KAAKC,KAAKU,OACzB,GAAe,IAAXA,EAAc,OAAW,KAE7B,IAAMK,EAAUhB,KAAKC,KAAK,GACpBgB,EAAUjB,KAAKC,KAAKiB,MAO1B,OALIP,EAAS,IACTX,KAAKC,KAAK,GAAKgB,EACfjB,KAAKmB,WAAW,IAGbH,EAAQT,KACnB,EAACJ,EAEDiB,KAAA,WACI,OAAWpB,KAACC,KAAKU,MACrB,EAACR,EAEOgB,WAAA,SAAWT,GAQf,IAPA,IAAQT,EAASD,KAATC,KACFU,EAASV,EAAKU,OAEdH,EAAOP,EAAKS,GACZW,EAAUb,EAAKF,IACfgB,EAAYd,EAAKC,QAEV,CAET,IAAMc,EAAuB,GAAZb,GAAO,GACxB,GAAIa,GAAWZ,EAEX,MAIJ,IAAIa,EAAcD,EACdE,EAAcxB,EAAKsB,GAASjB,IAC5BoB,EAAgBzB,EAAKsB,GAASd,MAE5BkB,EAAWJ,EAAU,EAC3B,GAAII,EAAWhB,EAAQ,CAEnB,IAAMiB,EAAW3B,EAAK0B,GAAUrB,IAC1BuB,EAAa5B,EAAK0B,GAAUlB,OAC9BmB,EAAWH,GAAgBG,IAAaH,GAAeI,EAAaH,KACpEF,EAAcG,EACdF,EAAcG,EACdF,EAAgBG,EAExB,CAGA,KAAIJ,EAAcJ,GAAYI,IAAgBJ,GAAWK,EAAgBJ,GAMrE,MAJArB,EAAKS,GAAOT,EAAKuB,GACjBd,EAAMc,CAKd,CAGAvB,EAAKS,GAAOF,CAChB,EAACT,CAAA,CArFe,GCEP+B,EAAoB,SAACC,EAAoBC,GAClD,IAAMC,EAAY,SAACC,GAAgB,OAAMA,EAAWC,KAAKC,GAAM,GAAG,EAE5DC,EAASJ,EAAUF,EAAS,IAC5BO,EAAYL,EAAUF,EAAS,IAC/BQ,EAASN,EAAUD,EAAS,IAE5BQ,EAAWD,EAASF,EACpBI,EAFYR,EAAUD,EAAS,IAELM,EAE1BI,EACFP,KAAKQ,IAAIH,EAAW,GAAKL,KAAKQ,IAAIH,EAAW,GAC7CL,KAAKS,IAAIP,GACTF,KAAKS,IAAIL,GACTJ,KAAKQ,IAAIF,EAAc,GACvBN,KAAKQ,IAAIF,EAAc,GAM3B,OALU,EAAIN,KAAKU,MAAMV,KAAKW,KAAKJ,GAAIP,KAAKW,KAAK,EAAIJ,IAEtC,OAGG,GACtB,ECQM,SAAUK,EAAiBC,GAC7B,IACMC,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMhB,KAAKC,GAAK,IAEhBgB,EAASjB,KAAKS,IAAII,EAAMG,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAInB,KAAKW,KAAKO,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAASR,EAAagB,GAGlC,IAFA,IAAIC,EAAWjB,EAAE,GAAKgB,EAAE,GAEjBC,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,IAAMC,EAAKD,EAAWH,EAChBK,GAAMnB,EAAE,GAAKgB,EAAE,IAAMD,EAE3B,OAAOtB,KAAKW,KAAKc,EAAKA,EAAKC,EAAKA,EACpC,CACJ,CC7CM,IAAAC,eAAU,WAYZ,SAAAA,EACIC,GAZIC,KAAAA,oBACAD,yBAAmB,EAAA/D,KACnBiE,cAAwE,IAAIC,IAAKlE,KACjFmE,OAAqB,QACrBC,SAA6C,IAAIF,IAUrDlE,KAAK+D,oBAAsBA,GAA4CjC,CAC3E,CAAC,IAAA3B,EAAA2D,EAAA1D,UAgHA,OAhHAD,EASOkE,gBAAA,SAAgBC,GACpB,IAAOC,EAAYD,KAAPtB,EAAOsB,EACnB,GAAKtE,KAAKoE,SAASI,IAAID,IAAMvE,KAAKoE,SAASK,IAAIF,EAAK,IAAIL,KAExD,IAAMQ,EAAS1E,KAAKoE,SAASO,IAAIJ,GACjC,GAAIG,EAAOF,IAAIxB,GACX,OAAO0B,EAAOC,IAAI3B,GAGtB,IAAMtC,EAAMV,KAAKmE,OAAOxD,OAIxB,OAHAX,KAAKmE,OAAOvD,KAAK0D,GACjBI,EAAOD,IAAIzB,EAAKtC,GAETA,CACX,EAACP,EAUMyE,gBAAA,SAAgBZ,GACnBhE,KAAKgE,QAAUA,EACfhE,KAAKiE,cAAgB,IAAIC,IACzBlE,KAAKmE,OAAS,GACdnE,KAAKoE,SAAW,IAAIF,IAEpB,IAAAW,IAA2CC,EAA3CD,EAAAE,EAAsB/E,KAAKgE,QAAQgB,YAAQF,EAAAD,KAAAI,MAEvC,IAFyC,IACnCd,EADQW,EAAAvE,MACS2E,SAASC,YACvBC,EAAI,EAAGA,EAAIjB,EAAOxD,OAAS,EAAGyE,IAAK,CACxC,IAAMC,EAAOrF,KAAKqE,gBAAgBF,EAAOiB,IACnCE,EAAOtF,KAAKqE,gBAAgBF,EAAOiB,EAAI,IACvCG,EAAWvF,KAAK+D,oBAAoBI,EAAOiB,GAAIjB,EAAOiB,EAAI,IAE3DpF,KAAKiE,cAAcO,IAAIa,IAAOrF,KAAKiE,cAAcQ,IAAIY,EAAM,IAC3DrF,KAAKiE,cAAcO,IAAIc,IAAOtF,KAAKiE,cAAcQ,IAAIa,EAAM,IAEhEtF,KAAKiE,cAAcU,IAAIU,GAAOzE,KAAK,CAAEJ,KAAM8E,EAAMC,SAAAA,IACjDvF,KAAKiE,cAAcU,IAAIW,GAAO1E,KAAK,CAAEJ,KAAM6E,EAAME,SAAAA,GACrD,CAER,EAACpF,EAWMqF,SAAA,SAASC,EAAuBC,GACnC,IAAK1F,KAAKgE,QACN,MAAU,IAAA2B,MAAM,oEAGpB,IAAMC,EAAW5F,KAAKqE,gBAAgBoB,EAAMP,SAASC,aAC/CU,EAAS7F,KAAKqE,gBAAgBqB,EAAIR,SAASC,aAEjD,GAAIS,IAAaC,EACb,YAGJ,IAAMC,EAAU,IAAI/F,EACpB+F,EAAQzF,OAAO,EAAGuF,GAIlB,IAHA,IAAMG,EAAW,IAAI7B,IACf8B,EAAS,IAAI9B,IAAoB,CAAC,CAAC0B,EAAU,KAE5CE,EAAQ1E,OAAS,GAAG,CACvB,IAAM6E,EAAUH,EAAQ/E,aAExB,GAAIkF,IAAYJ,EAAQ,CAGpB,IAFA,IAAMK,EAAmB,GACrBC,EAA+BF,OACfG,IAAbD,GACHD,EAAKG,QAAQrG,KAAKmE,OAAOgC,IACzBA,EAAWJ,EAASpB,IAAIwB,GAE5B,MAAO,CACHG,KAAM,UACNpB,SAAU,CAAEoB,KAAM,aAAcnB,YAAae,GAC7CK,WAAY,CAAA,EAEpB,CAIA,IAFA,IAEgCC,EAAhCC,EAAA1B,EAFkB/E,KAAKiE,cAAcU,IAAIsB,IAAY,MAErBO,EAAAC,KAAAxB,MAAE,KAAAyB,EAAAC,EAAvBC,EAAQJ,EAAAjG,MACTsG,GAAsCH,OAApBA,EAACV,EAAOrB,IAAIsB,IAAQS,EAAII,UAAYF,EAASrB,SACrE,GAAIsB,GAA4C,OAA7BF,EAAIX,EAAOrB,IAAIiC,EAASpG,OAAKmG,EAAIG,UAAW,CAC3Df,EAAStB,IAAImC,EAASpG,KAAMyF,GAC5BD,EAAOvB,IAAImC,EAASpG,KAAMqG,GAC1B,IAAME,EAASF,EAAkB7G,KAAK+D,oBAAoB/D,KAAKmE,OAAOyC,EAASpG,MAAOR,KAAKmE,OAAO0B,IAClGC,EAAQzF,OAAO0G,EAAQH,EAASpG,KACpC,CACJ,CACJ,CAEA,WACJ,EAACsD,CAAA,CAhIW"}
+{"version":3,"file":"terra-route.module.js","sources":["../src/fibonacci-heap.ts","../src/distance/haversine.ts","../src/distance/cheap-ruler.ts","../src/terra-route.ts"],"sourcesContent":["type FibNode = {\n    key: number;\n    value: number;\n    degree: number;\n    mark: boolean;\n    parent: FibNode | null;\n    child: FibNode | null;\n    left: FibNode;\n    right: FibNode;\n};\n\nexport class FibonacciHeap {\n    private nodeCount = 0;\n    private minNode: FibNode | null = null;\n\n    insert(key: number, value: number): void {\n        const node: FibNode = {\n            key,\n            value,\n            degree: 0,\n            mark: false,\n            parent: null,\n            child: null,\n            left: null as any,\n            right: null as any,\n        };\n        node.left = node;\n        node.right = node;\n\n        this.minNode = this.mergeLists(this.minNode, node);\n        this.nodeCount++;\n    }\n\n    extractMin(): number | null {\n        const z = this.minNode;\n        if (!z) return null;\n\n        // Add children to root list\n        if (z.child) {\n            let child = z.child;\n            do {\n                child.parent = null;\n                child = child.right!;\n            } while (child !== z.child);\n            this.minNode = this.mergeLists(this.minNode, z.child);\n        }\n\n        this.removeFromList(z);\n\n        if (z === z.right) {\n            this.minNode = null;\n        } else {\n            this.minNode = z.right;\n            this.consolidate();\n        }\n\n        this.nodeCount--;\n        return z.value;\n    }\n\n    size(): number {\n        return this.nodeCount;\n    }\n\n    // ========== Internal Methods ==========\n\n    private consolidate(): void {\n        const maxDegree = Math.floor(Math.log2(this.nodeCount)) + 1;\n        const A = new Array<FibNode | null>(maxDegree).fill(null);\n\n        const rootList: FibNode[] = [];\n        let curr = this.minNode!;\n        do {\n            rootList.push(curr);\n            curr = curr.right!;\n        } while (curr !== this.minNode);\n\n        for (const w of rootList) {\n            let x = w;\n            let d = x.degree;\n            while (A[d]) {\n                let y = A[d]!;\n                if (x.key > y.key) {\n                    const temp = x;\n                    x = y;\n                    y = temp;\n                }\n                this.link(y, x);\n                A[d] = null;\n                d++;\n            }\n            A[d] = x;\n        }\n\n        this.minNode = null;\n        for (const node of A) {\n            if (node) {\n                this.minNode = this.mergeLists(this.minNode, node);\n            }\n        }\n    }\n\n    private link(y: FibNode, x: FibNode): void {\n        this.removeFromList(y);\n        y.left = y.right = y;\n        x.child = this.mergeLists(x.child, y);\n        y.parent = x;\n        x.degree++;\n        y.mark = false;\n    }\n\n    private mergeLists(a: FibNode | null, b: FibNode | null): FibNode {\n        if (!a) return b!;\n        if (!b) return a;\n\n        const aRight = a.right!;\n        const bRight = b.right!;\n\n        a.right = bRight;\n        bRight.left = a;\n        b.right = aRight;\n        aRight.left = b;\n\n        return a.key < b.key ? a : b;\n    }\n\n    private removeFromList(node: FibNode): void {\n        node.left.right = node.right;\n        node.right.left = node.left;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { FibonacciHeap } from \"./fibonacci-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const index = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, index);\n\n        return index;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIndex = this.coordinateIndex(coords[i]);\n                const bIndex = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIndex)) this.adjacencyList.set(aIndex, []);\n                if (!this.adjacencyList.has(bIndex)) this.adjacencyList.set(bIndex, []);\n\n                this.adjacencyList.get(aIndex)!.push({ node: bIndex, distance });\n                this.adjacencyList.get(bIndex)!.push({ node: aIndex, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using bidirectional A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildRouteGraph(network) first.\");\n        }\n\n        const startIndex = this.coordinateIndex(start.geometry.coordinates);\n        const endIndex = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIndex === endIndex) {\n            return null;\n        }\n\n        const openSetForward = new FibonacciHeap();\n        const openSetBackward = new FibonacciHeap();\n        openSetForward.insert(0, startIndex);\n        openSetBackward.insert(0, endIndex);\n\n        const cameFromForward = new Map<number, number>();\n        const cameFromBackward = new Map<number, number>();\n        const gScoreForward = new Map<number, number>([[startIndex, 0]]);\n        const gScoreBackward = new Map<number, number>([[endIndex, 0]]);\n\n        const visitedForward = new Set<number>();\n        const visitedBackward = new Set<number>();\n\n        let meetingNode: number | null = null;\n\n        while (openSetForward.size() > 0 && openSetBackward.size() > 0) {\n            const currentForward = openSetForward.extractMin()!;\n            visitedForward.add(currentForward);\n\n            if (visitedBackward.has(currentForward)) {\n                meetingNode = currentForward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentForward) || []) {\n                const tentativeG = (gScoreForward.get(currentForward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreForward.get(neighbor.node) ?? Infinity)) {\n                    cameFromForward.set(neighbor.node, currentForward);\n                    gScoreForward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIndex]);\n                    openSetForward.insert(fScore, neighbor.node);\n                }\n            }\n\n            const currentBackward = openSetBackward.extractMin()!;\n            visitedBackward.add(currentBackward);\n\n            if (visitedForward.has(currentBackward)) {\n                meetingNode = currentBackward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentBackward) || []) {\n                const tentativeG = (gScoreBackward.get(currentBackward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreBackward.get(neighbor.node) ?? Infinity)) {\n                    cameFromBackward.set(neighbor.node, currentBackward);\n                    gScoreBackward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[startIndex]);\n                    openSetBackward.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        if (meetingNode === null) {\n            return null;\n        }\n\n        // Reconstruct forward path\n        const pathForward: Position[] = [];\n        let node = meetingNode;\n        while (node !== undefined) {\n            pathForward.unshift(this.coords[node]);\n            node = cameFromForward.get(node)!;\n        }\n\n        // Reconstruct backward path (omit meeting node to avoid duplication)\n        const pathBackward: Position[] = [];\n        node = cameFromBackward.get(meetingNode)!;\n        while (node !== undefined) {\n            pathBackward.push(this.coords[node]);\n            node = cameFromBackward.get(node)!;\n        }\n\n        const fullPath = [...pathForward, ...pathBackward];\n\n        return {\n            type: \"Feature\",\n            geometry: { type: \"LineString\", coordinates: fullPath },\n            properties: {},\n        };\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }"],"names":["FibonacciHeap","this","nodeCount","minNode","_proto","prototype","insert","key","value","node","degree","mark","parent","child","left","right","mergeLists","extractMin","z","removeFromList","consolidate","size","maxDegree","Math","floor","log2","A","Array","fill","rootList","curr","push","_i","_rootList","length","x","d","y","temp","link","_step","_iterator","_createForOfIteratorHelperLoose","done","a","b","aRight","bRight","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","sin","cos","atan2","sqrt","createCheapRuler","lat","FE","E2","RAD","cosLat","w2","w","m","kx","ky","deltaLng","dx","dy","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","has","set","latMap","get","index","buildRouteGraph","features","geometry","coordinates","i","aIndex","bIndex","distance","getRoute","start","end","Error","startIndex","endIndex","openSetForward","openSetBackward","cameFromForward","cameFromBackward","gScoreForward","gScoreBackward","visitedForward","Set","visitedBackward","meetingNode","currentForward","add","_iterator2","_step2","_gScoreForward$get","_gScoreForward$get2","neighbor","tentativeG","Infinity","fScore","currentBackward","_step3","_iterator3","_gScoreBackward$get","_gScoreBackward$get2","pathForward","undefined","unshift","pathBackward","type","concat","properties"],"mappings":"oyBAWA,IAAaA,eAAa,WAAA,SAAAA,IAAAC,KACdC,UAAY,EACZC,KAAAA,QAA0B,IAAI,CAAA,IAAAC,EAAAJ,EAAAK,iBAAAD,EAEtCE,OAAA,SAAOC,EAAaC,GAChB,IAAMC,EAAgB,CAClBF,IAAAA,EACAC,MAAAA,EACAE,OAAQ,EACRC,MAAM,EACNC,OAAQ,KACRC,MAAO,KACPC,KAAM,KACNC,MAAO,MAEXN,EAAKK,KAAOL,EACZA,EAAKM,MAAQN,EAEbR,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASM,GAC7CR,KAAKC,WACT,EAACE,EAEDa,WAAA,WACI,IAAMC,EAAIjB,KAAKE,QACf,IAAKe,EAAG,OAAW,KAGnB,GAAIA,EAAEL,MAAO,CACT,IAAIA,EAAQK,EAAEL,MACd,GACIA,EAAMD,OAAS,KACfC,EAAQA,EAAME,YACTF,IAAUK,EAAEL,OACrBZ,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASe,EAAEL,MACnD,CAYA,OAVAZ,KAAKkB,eAAeD,GAEhBA,IAAMA,EAAEH,MACRd,KAAKE,QAAU,MAEfF,KAAKE,QAAUe,EAAEH,MACjBd,KAAKmB,eAGTnB,KAAKC,YACEgB,EAAEV,KACb,EAACJ,EAEDiB,KAAA,WACI,OAAOpB,KAAKC,SAChB,EAACE,EAIOgB,YAAA,WACJ,IAAME,EAAYC,KAAKC,MAAMD,KAAKE,KAAKxB,KAAKC,YAAc,EACpDwB,EAAI,IAAIC,MAAsBL,GAAWM,KAAK,MAE9CC,EAAsB,GACxBC,EAAO7B,KAAKE,QAChB,GACI0B,EAASE,KAAKD,GACdA,EAAOA,EAAKf,YACPe,IAAS7B,KAAKE,SAEvB,IAAA,IAAA6B,EAAAC,EAAAA,EAAgBJ,EAAQG,EAAAC,EAAAC,OAAAF,IAAE,CAGtB,IAHC,IACGG,EADIF,EAAAD,GAEJI,EAAID,EAAEzB,OACHgB,EAAEU,IAAI,CACT,IAAIC,EAAIX,EAAEU,GACV,GAAID,EAAE5B,IAAM8B,EAAE9B,IAAK,CACf,IAAM+B,EAAOH,EACbA,EAAIE,EACJA,EAAIC,CACR,CACArC,KAAKsC,KAAKF,EAAGF,GACbT,EAAEU,GAAK,KACPA,GACJ,CACAV,EAAEU,GAAKD,CACX,CAEAlC,KAAKE,QAAU,KACf,IAAA,IAAoBqC,EAApBC,EAAAC,EAAmBhB,KAACc,EAAAC,KAAAE,MAAE,CAAX,IAAAlC,EAAI+B,EAAAhC,MACPC,IACAR,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASM,GAErD,CACJ,EAACL,EAEOmC,KAAA,SAAKF,EAAYF,GACrBlC,KAAKkB,eAAekB,GACpBA,EAAEvB,KAAOuB,EAAEtB,MAAQsB,EACnBF,EAAEtB,MAAQZ,KAAKe,WAAWmB,EAAEtB,MAAOwB,GACnCA,EAAEzB,OAASuB,EACXA,EAAEzB,SACF2B,EAAE1B,MAAO,CACb,EAACP,EAEOY,WAAA,SAAW4B,EAAmBC,GAClC,IAAKD,EAAG,OAAOC,EACf,IAAKA,EAAG,OAAOD,EAEf,IAAME,EAASF,EAAE7B,MACXgC,EAASF,EAAE9B,MAOjB,OALA6B,EAAE7B,MAAQgC,EACVA,EAAOjC,KAAO8B,EACdC,EAAE9B,MAAQ+B,EACVA,EAAOhC,KAAO+B,EAEPD,EAAErC,IAAMsC,EAAEtC,IAAMqC,EAAIC,CAC/B,EAACzC,EAEOe,eAAA,SAAeV,GACnBA,EAAKK,KAAKC,MAAQN,EAAKM,MACvBN,EAAKM,MAAMD,KAAOL,EAAKK,IAC3B,EAACd,CAAA,CAtHqB,GCTbgD,EAAoB,SAACC,EAAoBC,GAClD,IAAMC,EAAY,SAACC,GAAgB,OAAMA,EAAW7B,KAAK8B,GAAM,GAAG,EAE5DC,EAASH,EAAUF,EAAS,IAC5BM,EAAYJ,EAAUF,EAAS,IAC/BO,EAASL,EAAUD,EAAS,IAE5BO,EAAWD,EAASF,EACpBI,EAFYP,EAAUD,EAAS,IAELK,EAE1BX,EACFrB,KAAKoC,IAAIF,EAAW,GAAKlC,KAAKoC,IAAIF,EAAW,GAC7ClC,KAAKqC,IAAIN,GACT/B,KAAKqC,IAAIJ,GACTjC,KAAKoC,IAAID,EAAc,GACvBnC,KAAKoC,IAAID,EAAc,GAM3B,OALU,EAAInC,KAAKsC,MAAMtC,KAAKuC,KAAKlB,GAAIrB,KAAKuC,KAAK,EAAIlB,IAEtC,OAGG,GACtB,ECQM,SAAUmB,EAAiBC,GAC7B,IACMC,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAM5C,KAAK8B,GAAK,IAEhBe,EAAS7C,KAAKqC,IAAII,EAAMG,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAI/C,KAAKuC,KAAKO,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAAStB,EAAaC,GAGlC,IAFA,IAAI6B,EAAW9B,EAAE,GAAKC,EAAE,GAEjB6B,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,IAAMC,EAAKD,EAAWF,EAChBI,GAAMhC,EAAE,GAAKC,EAAE,IAAM4B,EAE3B,OAAOlD,KAAKuC,KAAKa,EAAKA,EAAKC,EAAKA,EACpC,CACJ,CC7CM,IAAAC,eAAU,WAYZ,SAAAA,EACIC,GAZIC,KAAAA,aACAD,EAAAA,KAAAA,yBACAE,EAAAA,KAAAA,cAAwE,IAAIC,IAAKhF,KACjFiF,OAAqB,GAAEjF,KACvBkF,SAA6C,IAAIF,IAUrDhF,KAAK6E,oBAAsBA,GAA4C9B,CAC3E,CAAC,IAAA5C,EAAAyE,EAAAxE,UA4JA,OA5JAD,EASOgF,gBAAA,SAAgBC,GACpB,IAAOC,EAAYD,EAAPrB,GAAAA,EAAOqB,EACnB,GAAKpF,KAAKkF,SAASI,IAAID,IAAMrF,KAAKkF,SAASK,IAAIF,EAAK,IAAIL,KAExD,IAAMQ,EAASxF,KAAKkF,SAASO,IAAIJ,GACjC,GAAIG,EAAOF,IAAIvB,GACX,OAAOyB,EAAOC,IAAI1B,GAGtB,IAAM2B,EAAQ1F,KAAKiF,OAAOhD,OAI1B,OAHAjC,KAAKiF,OAAOnD,KAAKsD,GACjBI,EAAOD,IAAIxB,EAAK2B,GAETA,CACX,EAACvF,EAUMwF,gBAAA,SAAgBb,GACnB9E,KAAK8E,QAAUA,EACf9E,KAAK+E,cAAgB,IAAIC,IACzBhF,KAAKiF,OAAS,GACdjF,KAAKkF,SAAW,IAAIF,IAEpB,IAAA,IAA2CzC,EAA3CC,EAAAC,EAAsBzC,KAAK8E,QAAQc,YAAQrD,EAAAC,KAAAE,MAEvC,IAFO,IACDuC,EADQ1C,EAAAhC,MACSsF,SAASC,YACvBC,EAAI,EAAGA,EAAId,EAAOhD,OAAS,EAAG8D,IAAK,CACxC,IAAMC,EAAShG,KAAKmF,gBAAgBF,EAAOc,IACrCE,EAASjG,KAAKmF,gBAAgBF,EAAOc,EAAI,IACzCG,EAAWlG,KAAK6E,oBAAoBI,EAAOc,GAAId,EAAOc,EAAI,IAE3D/F,KAAK+E,cAAcO,IAAIU,IAAShG,KAAK+E,cAAcQ,IAAIS,EAAQ,IAC/DhG,KAAK+E,cAAcO,IAAIW,IAASjG,KAAK+E,cAAcQ,IAAIU,EAAQ,IAEpEjG,KAAK+E,cAAcU,IAAIO,GAASlE,KAAK,CAAEtB,KAAMyF,EAAQC,SAAAA,IACrDlG,KAAK+E,cAAcU,IAAIQ,GAASnE,KAAK,CAAEtB,KAAMwF,EAAQE,SAAAA,GACzD,CAER,EAAC/F,EAWMgG,SAAA,SAASC,EAAuBC,GACnC,IAAKrG,KAAK8E,QACN,MAAU,IAAAwB,MAAM,kEAGpB,IAAMC,EAAavG,KAAKmF,gBAAgBiB,EAAMP,SAASC,aACjDU,EAAWxG,KAAKmF,gBAAgBkB,EAAIR,SAASC,aAEnD,GAAIS,IAAeC,EACf,OAAO,KAGX,IAAMC,EAAiB,IAAI1G,EACrB2G,EAAkB,IAAI3G,EAC5B0G,EAAepG,OAAO,EAAGkG,GACzBG,EAAgBrG,OAAO,EAAGmG,GAY1B,IAVA,IAAMG,EAAkB,IAAI3B,IACtB4B,EAAmB,IAAI5B,IACvB6B,EAAgB,IAAI7B,IAAoB,CAAC,CAACuB,EAAY,KACtDO,EAAiB,IAAI9B,IAAoB,CAAC,CAACwB,EAAU,KAErDO,EAAiB,IAAIC,IACrBC,EAAkB,IAAID,IAExBE,EAA6B,KAE1BT,EAAerF,OAAS,GAAKsF,EAAgBtF,OAAS,GAAG,CAC5D,IAAM+F,EAAiBV,EAAezF,aAGtC,GAFA+F,EAAeK,IAAID,GAEfF,EAAgB3B,IAAI6B,GAAiB,CACrCD,EAAcC,EACd,KACJ,CAEA,IAAAE,IAAmEC,EAAnED,EAAA5E,EAAuBzC,KAAK+E,cAAcU,IAAI0B,IAAmB,MAAEG,EAAAD,KAAA3E,MAAE,CAAA6E,IAAAA,EAAAC,EAA1DC,EAAQH,EAAA/G,MACTmH,GAA+CH,OAAlCA,EAACV,EAAcpB,IAAI0B,IAAeI,EAAII,UAAYF,EAASvB,SAC9E,GAAIwB,GAA8CF,OAApCA,EAAIX,EAAcpB,IAAIgC,EAASjH,OAAKgH,EAAIG,UAAW,CAC7DhB,EAAgBpB,IAAIkC,EAASjH,KAAM2G,GACnCN,EAActB,IAAIkC,EAASjH,KAAMkH,GACjC,IAAME,EAASF,EAAa1H,KAAK6E,oBAAoB7E,KAAKiF,OAAOwC,EAASjH,MAAOR,KAAKiF,OAAOuB,IAC7FC,EAAepG,OAAOuH,EAAQH,EAASjH,KAC3C,CACJ,CAEA,IAAMqH,EAAkBnB,EAAgB1F,aAGxC,GAFAiG,EAAgBG,IAAIS,GAEhBd,EAAezB,IAAIuC,GAAkB,CACrCX,EAAcW,EACd,KACJ,CAEA,IAAA,IAAoEC,EAApEC,EAAAtF,EAAuBzC,KAAK+E,cAAcU,IAAIoC,IAAoB,MAAEC,EAAAC,KAAArF,MAAE,CAAAsF,IAAAA,EAAAC,EAA3DR,EAAQK,EAAAvH,MACTmH,GAAiDM,OAApCA,EAAClB,EAAerB,IAAIoC,IAAgBG,EAAIL,UAAYF,EAASvB,SAChF,GAAIwB,GAA+CO,OAArCA,EAAInB,EAAerB,IAAIgC,EAASjH,OAAKyH,EAAIN,UAAW,CAC9Df,EAAiBrB,IAAIkC,EAASjH,KAAMqH,GACpCf,EAAevB,IAAIkC,EAASjH,KAAMkH,GAClC,IAAME,EAASF,EAAa1H,KAAK6E,oBAAoB7E,KAAKiF,OAAOwC,EAASjH,MAAOR,KAAKiF,OAAOsB,IAC7FG,EAAgBrG,OAAOuH,EAAQH,EAASjH,KAC5C,CACJ,CACJ,CAEA,GAAoB,OAAhB0G,EACA,OAAO,KAMX,IAFA,IAAMgB,EAA0B,GAC5B1H,EAAO0G,OACKiB,IAAT3H,GACH0H,EAAYE,QAAQpI,KAAKiF,OAAOzE,IAChCA,EAAOmG,EAAgBlB,IAAIjF,GAI/B,IAAM6H,EAA2B,GAEjC,IADA7H,EAAOoG,EAAiBnB,IAAIyB,QACZiB,IAAT3H,GACH6H,EAAavG,KAAK9B,KAAKiF,OAAOzE,IAC9BA,EAAOoG,EAAiBnB,IAAIjF,GAKhC,MAAO,CACH8H,KAAM,UACNzC,SAAU,CAAEyC,KAAM,aAAcxC,YAJtB,GAAAyC,OAAOL,EAAgBG,IAKjCG,WAAY,CAAA,EAEpB,EAAC5D,CAAA,CA5KW"}

package/dist/terra-route.umd.js

@@ -1,2 +1,2 @@
-!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t||self).terraRoute={})}(this,function(t){function e(t,e){(null==e||e>t.length)&&(e=t.length);for(var n=0,r=Array(e);n<e;n++)r[n]=t[n];return r}function n(t,n){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(r)return(r=r.call(t)).next.bind(r);if(Array.isArray(t)||(r=function(t,n){if(t){if("string"==typeof t)return e(t,n);var r={}.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?e(t,n):void 0}}(t))||n&&t&&"number"==typeof t.length){r&&(t=r);var i=0;return function(){return i>=t.length?{done:!0}:{done:!1,value:t[i++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var r=/*#__PURE__*/function(){function t(){this.heap=[],this.insertCounter=0}var e=t.prototype;return e.insert=function(t,e){var n={key:t,value:e,index:this.insertCounter++},r=this.heap.length;for(this.heap.push(n);r>0;){var i=r-1>>>1,a=this.heap[i];if(n.key>a.key||n.key===a.key&&n.index>a.index)break;this.heap[r]=a,r=i}this.heap[r]=n},e.extractMin=function(){var t=this.heap.length;if(0===t)return null;var e=this.heap[0],n=this.heap.pop();return t>1&&(this.heap[0]=n,this.bubbleDown(0)),e.value},e.size=function(){return this.heap.length},e.bubbleDown=function(t){for(var e=this.heap,n=e.length,r=e[t],i=r.key,a=r.index;;){var o=1+(t<<1);if(o>=n)break;var s=o,h=e[o].key,c=e[o].index,u=o+1;if(u<n){var d=e[u].key,f=e[u].index;(d<h||d===h&&f<c)&&(s=u,h=d,c=f)}if(!(h<i||h===i&&c<a))break;e[t]=e[s],t=s}e[t]=r},t}(),i=function(t,e){var n=function(t){return t*Math.PI/180},r=n(t[1]),i=n(t[0]),a=n(e[1]),o=a-r,s=n(e[0])-i,h=Math.sin(o/2)*Math.sin(o/2)+Math.cos(r)*Math.cos(a)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};t.TerraRoute=/*#__PURE__*/function(){function t(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||i}var e=t.prototype;return e.coordinateIndex=function(t){var e=t[0],n=t[1];this.coordMap.has(e)||this.coordMap.set(e,new Map);var r=this.coordMap.get(e);if(r.has(n))return r.get(n);var i=this.coords.length;return this.coords.push(t),r.set(n,i),i},e.buildRouteGraph=function(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(var e,r=n(this.network.features);!(e=r()).done;)for(var i=e.value.geometry.coordinates,a=0;a<i.length-1;a++){var o=this.coordinateIndex(i[a]),s=this.coordinateIndex(i[a+1]),h=this.distanceMeasurement(i[a],i[a+1]);this.adjacencyList.has(o)||this.adjacencyList.set(o,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(o).push({node:s,distance:h}),this.adjacencyList.get(s).push({node:o,distance:h})}},e.getRoute=function(t,e){if(!this.network)throw new Error("Network not built. Please call buildNetworkGraph(network) first.");var i=this.coordinateIndex(t.geometry.coordinates),a=this.coordinateIndex(e.geometry.coordinates);if(i===a)return null;var o=new r;o.insert(0,i);for(var s=new Map,h=new Map([[i,0]]);o.size()>0;){var c=o.extractMin();if(c===a){for(var u=[],d=c;void 0!==d;)u.unshift(this.coords[d]),d=s.get(d);return{type:"Feature",geometry:{type:"LineString",coordinates:u},properties:{}}}for(var f,p=n(this.adjacencyList.get(c)||[]);!(f=p()).done;){var l,v,y=f.value,M=(null!=(l=h.get(c))?l:Infinity)+y.distance;if(M<(null!=(v=h.get(y.node))?v:Infinity)){s.set(y.node,c),h.set(y.node,M);var g=M+this.distanceMeasurement(this.coords[y.node],this.coords[a]);o.insert(g,y.node)}}}return null},t}(),t.createCheapRuler=function(t){var e=1/298.257223563,n=e*(2-e),r=Math.PI/180,i=Math.cos(t*r),a=1/(1-n*(1-i*i)),o=Math.sqrt(a),s=6378.137*r,h=s*o*i,c=s*o*a*(1-n);return function(t,e){for(var n=t[0]-e[0];n<-180;)n+=360;for(;n>180;)n-=360;var r=n*h,i=(t[1]-e[1])*c;return Math.sqrt(r*r+i*i)}},t.haversineDistance=i});
+!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t||self).terraRoute={})}(this,function(t){function e(t,e){(null==e||e>t.length)&&(e=t.length);for(var n=0,r=Array(e);n<e;n++)r[n]=t[n];return r}function n(t,n){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(r)return(r=r.call(t)).next.bind(r);if(Array.isArray(t)||(r=function(t,n){if(t){if("string"==typeof t)return e(t,n);var r={}.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?e(t,n):void 0}}(t))||n&&t&&"number"==typeof t.length){r&&(t=r);var i=0;return function(){return i>=t.length?{done:!0}:{done:!1,value:t[i++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var r=/*#__PURE__*/function(){function t(){this.nodeCount=0,this.minNode=null}var e=t.prototype;return e.insert=function(t,e){var n={key:t,value:e,degree:0,mark:!1,parent:null,child:null,left:null,right:null};n.left=n,n.right=n,this.minNode=this.mergeLists(this.minNode,n),this.nodeCount++},e.extractMin=function(){var t=this.minNode;if(!t)return null;if(t.child){var e=t.child;do{e.parent=null,e=e.right}while(e!==t.child);this.minNode=this.mergeLists(this.minNode,t.child)}return this.removeFromList(t),t===t.right?this.minNode=null:(this.minNode=t.right,this.consolidate()),this.nodeCount--,t.value},e.size=function(){return this.nodeCount},e.consolidate=function(){var t=Math.floor(Math.log2(this.nodeCount))+1,e=new Array(t).fill(null),r=[],i=this.minNode;do{r.push(i),i=i.right}while(i!==this.minNode);for(var o=0,a=r;o<a.length;o++){for(var s=a[o],h=s.degree;e[h];){var d=e[h];if(s.key>d.key){var u=s;s=d,d=u}this.link(d,s),e[h]=null,h++}e[h]=s}this.minNode=null;for(var c,l=n(e);!(c=l()).done;){var f=c.value;f&&(this.minNode=this.mergeLists(this.minNode,f))}},e.link=function(t,e){this.removeFromList(t),t.left=t.right=t,e.child=this.mergeLists(e.child,t),t.parent=e,e.degree++,t.mark=!1},e.mergeLists=function(t,e){if(!t)return e;if(!e)return t;var n=t.right,r=e.right;return t.right=r,r.left=t,e.right=n,n.left=e,t.key<e.key?t:e},e.removeFromList=function(t){t.left.right=t.right,t.right.left=t.left},t}(),i=function(t,e){var n=function(t){return t*Math.PI/180},r=n(t[1]),i=n(t[0]),o=n(e[1]),a=o-r,s=n(e[0])-i,h=Math.sin(a/2)*Math.sin(a/2)+Math.cos(r)*Math.cos(o)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3};t.TerraRoute=/*#__PURE__*/function(){function t(t){this.network=void 0,this.distanceMeasurement=void 0,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map,this.distanceMeasurement=t||i}var e=t.prototype;return e.coordinateIndex=function(t){var e=t[0],n=t[1];this.coordMap.has(e)||this.coordMap.set(e,new Map);var r=this.coordMap.get(e);if(r.has(n))return r.get(n);var i=this.coords.length;return this.coords.push(t),r.set(n,i),i},e.buildRouteGraph=function(t){this.network=t,this.adjacencyList=new Map,this.coords=[],this.coordMap=new Map;for(var e,r=n(this.network.features);!(e=r()).done;)for(var i=e.value.geometry.coordinates,o=0;o<i.length-1;o++){var a=this.coordinateIndex(i[o]),s=this.coordinateIndex(i[o+1]),h=this.distanceMeasurement(i[o],i[o+1]);this.adjacencyList.has(a)||this.adjacencyList.set(a,[]),this.adjacencyList.has(s)||this.adjacencyList.set(s,[]),this.adjacencyList.get(a).push({node:s,distance:h}),this.adjacencyList.get(s).push({node:a,distance:h})}},e.getRoute=function(t,e){if(!this.network)throw new Error("Network not built. Please call buildRouteGraph(network) first.");var i=this.coordinateIndex(t.geometry.coordinates),o=this.coordinateIndex(e.geometry.coordinates);if(i===o)return null;var a=new r,s=new r;a.insert(0,i),s.insert(0,o);for(var h=new Map,d=new Map,u=new Map([[i,0]]),c=new Map([[o,0]]),l=new Set,f=new Set,v=null;a.size()>0&&s.size()>0;){var g=a.extractMin();if(l.add(g),f.has(g)){v=g;break}for(var m,p=n(this.adjacencyList.get(g)||[]);!(m=p()).done;){var y,M,w=m.value,L=(null!=(y=u.get(g))?y:Infinity)+w.distance;if(L<(null!=(M=u.get(w.node))?M:Infinity)){h.set(w.node,g),u.set(w.node,L);var b=L+this.distanceMeasurement(this.coords[w.node],this.coords[o]);a.insert(b,w.node)}}var k=s.extractMin();if(f.add(k),l.has(k)){v=k;break}for(var I,N=n(this.adjacencyList.get(k)||[]);!(I=N()).done;){var j,x,S=I.value,A=(null!=(j=c.get(k))?j:Infinity)+S.distance;if(A<(null!=(x=c.get(S.node))?x:Infinity)){d.set(S.node,k),c.set(S.node,A);var C=A+this.distanceMeasurement(this.coords[S.node],this.coords[i]);s.insert(C,S.node)}}}if(null===v)return null;for(var R=[],q=v;void 0!==q;)R.unshift(this.coords[q]),q=h.get(q);var F=[];for(q=d.get(v);void 0!==q;)F.push(this.coords[q]),q=d.get(q);return{type:"Feature",geometry:{type:"LineString",coordinates:[].concat(R,F)},properties:{}}},t}(),t.createCheapRuler=function(t){var e=1/298.257223563,n=e*(2-e),r=Math.PI/180,i=Math.cos(t*r),o=1/(1-n*(1-i*i)),a=Math.sqrt(o),s=6378.137*r,h=s*a*i,d=s*a*o*(1-n);return function(t,e){for(var n=t[0]-e[0];n<-180;)n+=360;for(;n>180;)n-=360;var r=n*h,i=(t[1]-e[1])*d;return Math.sqrt(r*r+i*i)}},t.haversineDistance=i});
 //# sourceMappingURL=terra-route.umd.js.map

package/dist/terra-route.umd.js.map

@@ -1 +1 @@
-{"version":3,"file":"terra-route.umd.js","sources":["../src/min-heap.ts","../src/distance/haversine.ts","../src/terra-route.ts","../src/distance/cheap-ruler.ts"],"sourcesContent":["export class MinHeap {\n    private heap: Array<{ key: number; value: number; index: number }> = [];\n    private insertCounter = 0;\n\n    insert(key: number, value: number): void {\n        const node = { key, value, index: this.insertCounter++ };\n        let idx = this.heap.length;\n        this.heap.push(node);\n\n        // Optimized Bubble Up\n        while (idx > 0) {\n            const parentIdx = (idx - 1) >>> 1; // Fast Math.floor((idx - 1) / 2)\n            const parent = this.heap[parentIdx];\n            if (node.key > parent.key || (node.key === parent.key && node.index > parent.index)) break;\n            this.heap[idx] = parent;\n            idx = parentIdx;\n        }\n        this.heap[idx] = node;\n    }\n\n    extractMin(): number | null {\n        const length = this.heap.length;\n        if (length === 0) return null;\n\n        const minNode = this.heap[0];\n        const endNode = this.heap.pop()!;\n\n        if (length > 1) {\n            this.heap[0] = endNode;\n            this.bubbleDown(0);\n        }\n\n        return minNode.value;\n    }\n\n    size(): number {\n        return this.heap.length;\n    }\n\n    private bubbleDown(idx: number): void {\n        const { heap } = this;\n        const length = heap.length;\n        // Grab the parent node once, then move it down only if needed\n        const node = heap[idx];\n        const nodeKey = node.key;\n        const nodeIndex = node.index;\n\n        while (true) {\n            // Calculate left and right child indexes\n            const leftIdx = (idx << 1) + 1;\n            if (leftIdx >= length) {\n                // No children => we’re already in place\n                break;\n            }\n\n            // Assume left child is the smaller one by default\n            let smallestIdx = leftIdx;\n            let smallestKey = heap[leftIdx].key;\n            let smallestIndex = heap[leftIdx].index;\n\n            const rightIdx = leftIdx + 1;\n            if (rightIdx < length) {\n                // Compare left child vs. right child\n                const rightKey = heap[rightIdx].key;\n                const rightIndex = heap[rightIdx].index;\n                if (rightKey < smallestKey || (rightKey === smallestKey && rightIndex < smallestIndex)) {\n                    smallestIdx = rightIdx;\n                    smallestKey = rightKey;\n                    smallestIndex = rightIndex;\n                }\n            }\n\n            // Compare the smaller child with the parent\n            if (smallestKey < nodeKey || (smallestKey === nodeKey && smallestIndex < nodeIndex)) {\n                // Swap the smaller child up\n                heap[idx] = heap[smallestIdx];\n                idx = smallestIdx;\n            } else {\n                // We’re in the correct position now, so stop\n                break;\n            }\n        }\n\n        // Place the original node in its final position\n        heap[idx] = node;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { MinHeap } from \"./min-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const idx = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, idx);\n\n        return idx;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIdx = this.coordinateIndex(coords[i]);\n                const bIdx = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIdx)) this.adjacencyList.set(aIdx, []);\n                if (!this.adjacencyList.has(bIdx)) this.adjacencyList.set(bIdx, []);\n\n                this.adjacencyList.get(aIdx)!.push({ node: bIdx, distance });\n                this.adjacencyList.get(bIdx)!.push({ node: aIdx, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildNetworkGraph(network) first.\");\n        }\n\n        const startIdx = this.coordinateIndex(start.geometry.coordinates);\n        const endIdx = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIdx === endIdx) {\n            return null;\n        }\n\n        const openSet = new MinHeap();\n        openSet.insert(0, startIdx);\n        const cameFrom = new Map<number, number>();\n        const gScore = new Map<number, number>([[startIdx, 0]]);\n\n        while (openSet.size() > 0) {\n            const current = openSet.extractMin()!;\n\n            if (current === endIdx) {\n                const path: Position[] = [];\n                let currNode: number | undefined = current;\n                while (currNode !== undefined) {\n                    path.unshift(this.coords[currNode]);\n                    currNode = cameFrom.get(currNode);\n                }\n                return {\n                    type: \"Feature\",\n                    geometry: { type: \"LineString\", coordinates: path },\n                    properties: {},\n                };\n            }\n\n            const neighbors = this.adjacencyList.get(current) || [];\n\n            for (const neighbor of neighbors) {\n                const tentativeGScore = (gScore.get(current) ?? Infinity) + neighbor.distance;\n                if (tentativeGScore < (gScore.get(neighbor.node) ?? Infinity)) {\n                    cameFrom.set(neighbor.node, current);\n                    gScore.set(neighbor.node, tentativeGScore);\n                    const fScore = tentativeGScore + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIdx]);\n                    openSet.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        return null;\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}"],"names":["MinHeap","this","heap","insertCounter","_proto","prototype","insert","key","value","node","index","idx","length","push","parentIdx","parent","extractMin","minNode","endNode","pop","bubbleDown","size","nodeKey","nodeIndex","leftIdx","smallestIdx","smallestKey","smallestIndex","rightIdx","rightKey","rightIndex","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","Math","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","a","sin","cos","atan2","sqrt","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","lat","has","set","latMap","get","buildRouteGraph","_iterator","_step","_createForOfIteratorHelperLoose","features","done","geometry","coordinates","i","aIdx","bIdx","distance","getRoute","start","end","Error","startIdx","endIdx","openSet","cameFrom","gScore","current","path","currNode","undefined","unshift","type","properties","_step2","_iterator2","_gScore$get","_gScore$get2","neighbor","tentativeGScore","Infinity","fScore","FE","E2","RAD","cosLat","w2","w","m","kx","ky","b","deltaLng","dx","dy"],"mappings":"wgCAAa,IAAAA,eAAO,WAAA,SAAAA,IAAAC,KACRC,KAA6D,GAC7DC,KAAAA,cAAgB,CAAC,KAAAC,EAAAJ,EAAAK,UAmFxB,OAnFwBD,EAEzBE,OAAA,SAAOC,EAAaC,GAChB,IAAMC,EAAO,CAAEF,IAAAA,EAAKC,MAAAA,EAAOE,MAAOT,KAAKE,iBACnCQ,EAAMV,KAAKC,KAAKU,OAIpB,IAHAX,KAAKC,KAAKW,KAAKJ,GAGRE,EAAM,GAAG,CACZ,IAAMG,EAAaH,EAAM,IAAO,EAC1BI,EAASd,KAAKC,KAAKY,GACzB,GAAIL,EAAKF,IAAMQ,EAAOR,KAAQE,EAAKF,MAAQQ,EAAOR,KAAOE,EAAKC,MAAQK,EAAOL,MAAQ,MACrFT,KAAKC,KAAKS,GAAOI,EACjBJ,EAAMG,CACV,CACAb,KAAKC,KAAKS,GAAOF,CACrB,EAACL,EAEDY,WAAA,WACI,IAAMJ,EAASX,KAAKC,KAAKU,OACzB,GAAe,IAAXA,EAAc,OAAW,KAE7B,IAAMK,EAAUhB,KAAKC,KAAK,GACpBgB,EAAUjB,KAAKC,KAAKiB,MAO1B,OALIP,EAAS,IACTX,KAAKC,KAAK,GAAKgB,EACfjB,KAAKmB,WAAW,IAGbH,EAAQT,KACnB,EAACJ,EAEDiB,KAAA,WACI,OAAWpB,KAACC,KAAKU,MACrB,EAACR,EAEOgB,WAAA,SAAWT,GAQf,IAPA,IAAQT,EAASD,KAATC,KACFU,EAASV,EAAKU,OAEdH,EAAOP,EAAKS,GACZW,EAAUb,EAAKF,IACfgB,EAAYd,EAAKC,QAEV,CAET,IAAMc,EAAuB,GAAZb,GAAO,GACxB,GAAIa,GAAWZ,EAEX,MAIJ,IAAIa,EAAcD,EACdE,EAAcxB,EAAKsB,GAASjB,IAC5BoB,EAAgBzB,EAAKsB,GAASd,MAE5BkB,EAAWJ,EAAU,EAC3B,GAAII,EAAWhB,EAAQ,CAEnB,IAAMiB,EAAW3B,EAAK0B,GAAUrB,IAC1BuB,EAAa5B,EAAK0B,GAAUlB,OAC9BmB,EAAWH,GAAgBG,IAAaH,GAAeI,EAAaH,KACpEF,EAAcG,EACdF,EAAcG,EACdF,EAAgBG,EAExB,CAGA,KAAIJ,EAAcJ,GAAYI,IAAgBJ,GAAWK,EAAgBJ,GAMrE,MAJArB,EAAKS,GAAOT,EAAKuB,GACjBd,EAAMc,CAKd,CAGAvB,EAAKS,GAAOF,CAChB,EAACT,CAAA,CArFe,GCEP+B,EAAoB,SAACC,EAAoBC,GAClD,IAAMC,EAAY,SAACC,GAAgB,OAAMA,EAAWC,KAAKC,GAAM,GAAG,EAE5DC,EAASJ,EAAUF,EAAS,IAC5BO,EAAYL,EAAUF,EAAS,IAC/BQ,EAASN,EAAUD,EAAS,IAE5BQ,EAAWD,EAASF,EACpBI,EAFYR,EAAUD,EAAS,IAELM,EAE1BI,EACFP,KAAKQ,IAAIH,EAAW,GAAKL,KAAKQ,IAAIH,EAAW,GAC7CL,KAAKS,IAAIP,GACTF,KAAKS,IAAIL,GACTJ,KAAKQ,IAAIF,EAAc,GACvBN,KAAKQ,IAAIF,EAAc,GAM3B,OALU,EAAIN,KAAKU,MAAMV,KAAKW,KAAKJ,GAAIP,KAAKW,KAAK,EAAIJ,IAEtC,OAGG,GACtB,4BCZgB,WAYZ,SAAAK,EACIC,GAZIC,KAAAA,oBACAD,yBAAmB,EAAAhD,KACnBkD,cAAwE,IAAIC,IAAKnD,KACjFoD,OAAqB,QACrBC,SAA6C,IAAIF,IAUrDnD,KAAKgD,oBAAsBA,GAA4ClB,CAC3E,CAAC,IAAA3B,EAAA4C,EAAA3C,UAgHA,OAhHAD,EASOmD,gBAAA,SAAgBC,GACpB,IAAOC,EAAYD,KAAPE,EAAOF,EACnB,GAAKvD,KAAKqD,SAASK,IAAIF,IAAMxD,KAAKqD,SAASM,IAAIH,EAAK,IAAIL,KAExD,IAAMS,EAAS5D,KAAKqD,SAASQ,IAAIL,GACjC,GAAII,EAAOF,IAAID,GACX,OAAOG,EAAOC,IAAIJ,GAGtB,IAAM/C,EAAMV,KAAKoD,OAAOzC,OAIxB,OAHAX,KAAKoD,OAAOxC,KAAK2C,GACjBK,EAAOD,IAAIF,EAAK/C,GAETA,CACX,EAACP,EAUM2D,gBAAA,SAAgBb,GACnBjD,KAAKiD,QAAUA,EACfjD,KAAKkD,cAAgB,IAAIC,IACzBnD,KAAKoD,OAAS,GACdpD,KAAKqD,SAAW,IAAIF,IAEpB,IAAAY,IAA2CC,EAA3CD,EAAAE,EAAsBjE,KAAKiD,QAAQiB,YAAQF,EAAAD,KAAAI,MAEvC,IAFyC,IACnCf,EADQY,EAAAzD,MACS6D,SAASC,YACvBC,EAAI,EAAGA,EAAIlB,EAAOzC,OAAS,EAAG2D,IAAK,CACxC,IAAMC,EAAOvE,KAAKsD,gBAAgBF,EAAOkB,IACnCE,EAAOxE,KAAKsD,gBAAgBF,EAAOkB,EAAI,IACvCG,EAAWzE,KAAKgD,oBAAoBI,EAAOkB,GAAIlB,EAAOkB,EAAI,IAE3DtE,KAAKkD,cAAcQ,IAAIa,IAAOvE,KAAKkD,cAAcS,IAAIY,EAAM,IAC3DvE,KAAKkD,cAAcQ,IAAIc,IAAOxE,KAAKkD,cAAcS,IAAIa,EAAM,IAEhExE,KAAKkD,cAAcW,IAAIU,GAAO3D,KAAK,CAAEJ,KAAMgE,EAAMC,SAAAA,IACjDzE,KAAKkD,cAAcW,IAAIW,GAAO5D,KAAK,CAAEJ,KAAM+D,EAAME,SAAAA,GACrD,CAER,EAACtE,EAWMuE,SAAA,SAASC,EAAuBC,GACnC,IAAK5E,KAAKiD,QACN,MAAU,IAAA4B,MAAM,oEAGpB,IAAMC,EAAW9E,KAAKsD,gBAAgBqB,EAAMP,SAASC,aAC/CU,EAAS/E,KAAKsD,gBAAgBsB,EAAIR,SAASC,aAEjD,GAAIS,IAAaC,EACb,YAGJ,IAAMC,EAAU,IAAIjF,EACpBiF,EAAQ3E,OAAO,EAAGyE,GAIlB,IAHA,IAAMG,EAAW,IAAI9B,IACf+B,EAAS,IAAI/B,IAAoB,CAAC,CAAC2B,EAAU,KAE5CE,EAAQ5D,OAAS,GAAG,CACvB,IAAM+D,EAAUH,EAAQjE,aAExB,GAAIoE,IAAYJ,EAAQ,CAGpB,IAFA,IAAMK,EAAmB,GACrBC,EAA+BF,OACfG,IAAbD,GACHD,EAAKG,QAAQvF,KAAKoD,OAAOiC,IACzBA,EAAWJ,EAASpB,IAAIwB,GAE5B,MAAO,CACHG,KAAM,UACNpB,SAAU,CAAEoB,KAAM,aAAcnB,YAAae,GAC7CK,WAAY,CAAA,EAEpB,CAIA,IAFA,IAEgCC,EAAhCC,EAAA1B,EAFkBjE,KAAKkD,cAAcW,IAAIsB,IAAY,MAErBO,EAAAC,KAAAxB,MAAE,KAAAyB,EAAAC,EAAvBC,EAAQJ,EAAAnF,MACTwF,GAAsCH,OAApBA,EAACV,EAAOrB,IAAIsB,IAAQS,EAAII,UAAYF,EAASrB,SACrE,GAAIsB,GAA4C,OAA7BF,EAAIX,EAAOrB,IAAIiC,EAAStF,OAAKqF,EAAIG,UAAW,CAC3Df,EAAStB,IAAImC,EAAStF,KAAM2E,GAC5BD,EAAOvB,IAAImC,EAAStF,KAAMuF,GAC1B,IAAME,EAASF,EAAkB/F,KAAKgD,oBAAoBhD,KAAKoD,OAAO0C,EAAStF,MAAOR,KAAKoD,OAAO2B,IAClGC,EAAQ3E,OAAO4F,EAAQH,EAAStF,KACpC,CACJ,CACJ,CAEA,WACJ,EAACuC,CAAA,CAhIW,sBCoBV,SAA2BU,GAC7B,IACMyC,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMjE,KAAKC,GAAK,IAEhBiE,EAASlE,KAAKS,IAAIa,EAAM2C,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAIpE,KAAKW,KAAKwD,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAASzD,EAAaiE,GAGlC,IAFA,IAAIC,EAAWlE,EAAE,GAAKiE,EAAE,GAEjBC,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,IAAMC,EAAKD,EAAWH,EAChBK,GAAMpE,EAAE,GAAKiE,EAAE,IAAMD,EAE3B,OAAOvE,KAAKW,KAAK+D,EAAKA,EAAKC,EAAKA,EACpC,CACJ"}
+{"version":3,"file":"terra-route.umd.js","sources":["../src/fibonacci-heap.ts","../src/distance/haversine.ts","../src/terra-route.ts","../src/distance/cheap-ruler.ts"],"sourcesContent":["type FibNode = {\n    key: number;\n    value: number;\n    degree: number;\n    mark: boolean;\n    parent: FibNode | null;\n    child: FibNode | null;\n    left: FibNode;\n    right: FibNode;\n};\n\nexport class FibonacciHeap {\n    private nodeCount = 0;\n    private minNode: FibNode | null = null;\n\n    insert(key: number, value: number): void {\n        const node: FibNode = {\n            key,\n            value,\n            degree: 0,\n            mark: false,\n            parent: null,\n            child: null,\n            left: null as any,\n            right: null as any,\n        };\n        node.left = node;\n        node.right = node;\n\n        this.minNode = this.mergeLists(this.minNode, node);\n        this.nodeCount++;\n    }\n\n    extractMin(): number | null {\n        const z = this.minNode;\n        if (!z) return null;\n\n        // Add children to root list\n        if (z.child) {\n            let child = z.child;\n            do {\n                child.parent = null;\n                child = child.right!;\n            } while (child !== z.child);\n            this.minNode = this.mergeLists(this.minNode, z.child);\n        }\n\n        this.removeFromList(z);\n\n        if (z === z.right) {\n            this.minNode = null;\n        } else {\n            this.minNode = z.right;\n            this.consolidate();\n        }\n\n        this.nodeCount--;\n        return z.value;\n    }\n\n    size(): number {\n        return this.nodeCount;\n    }\n\n    // ========== Internal Methods ==========\n\n    private consolidate(): void {\n        const maxDegree = Math.floor(Math.log2(this.nodeCount)) + 1;\n        const A = new Array<FibNode | null>(maxDegree).fill(null);\n\n        const rootList: FibNode[] = [];\n        let curr = this.minNode!;\n        do {\n            rootList.push(curr);\n            curr = curr.right!;\n        } while (curr !== this.minNode);\n\n        for (const w of rootList) {\n            let x = w;\n            let d = x.degree;\n            while (A[d]) {\n                let y = A[d]!;\n                if (x.key > y.key) {\n                    const temp = x;\n                    x = y;\n                    y = temp;\n                }\n                this.link(y, x);\n                A[d] = null;\n                d++;\n            }\n            A[d] = x;\n        }\n\n        this.minNode = null;\n        for (const node of A) {\n            if (node) {\n                this.minNode = this.mergeLists(this.minNode, node);\n            }\n        }\n    }\n\n    private link(y: FibNode, x: FibNode): void {\n        this.removeFromList(y);\n        y.left = y.right = y;\n        x.child = this.mergeLists(x.child, y);\n        y.parent = x;\n        x.degree++;\n        y.mark = false;\n    }\n\n    private mergeLists(a: FibNode | null, b: FibNode | null): FibNode {\n        if (!a) return b!;\n        if (!b) return a;\n\n        const aRight = a.right!;\n        const bRight = b.right!;\n\n        a.right = bRight;\n        bRight.left = a;\n        b.right = aRight;\n        aRight.left = b;\n\n        return a.key < b.key ? a : b;\n    }\n\n    private removeFromList(node: FibNode): void {\n        node.left.right = node.right;\n        node.right.left = node.left;\n    }\n}\n","import { Position } from \"geojson\";\n\nexport const haversineDistance = (pointOne: Position, pointTwo: Position): number => {\n    const toRadians = (latOrLng: number) => (latOrLng * Math.PI) / 180;\n\n    const phiOne = toRadians(pointOne[1]);\n    const lambdaOne = toRadians(pointOne[0]);\n    const phiTwo = toRadians(pointTwo[1]);\n    const lambdaTwo = toRadians(pointTwo[0]);\n    const deltaPhi = phiTwo - phiOne;\n    const deltalambda = lambdaTwo - lambdaOne;\n\n    const a =\n        Math.sin(deltaPhi / 2) * Math.sin(deltaPhi / 2) +\n        Math.cos(phiOne) *\n        Math.cos(phiTwo) *\n        Math.sin(deltalambda / 2) *\n        Math.sin(deltalambda / 2);\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n    const radius = 6371e3;\n    const distance = radius * c;\n\n    return distance / 1000;\n}","import { FeatureCollection, LineString, Point, Feature, Position } from \"geojson\";\nimport { FibonacciHeap } from \"./fibonacci-heap\";\nimport { haversineDistance } from \"./distance/haversine\";\nimport { createCheapRuler } from \"./distance/cheap-ruler\";\n\n/**\n * TerraRoute is a routing utility for finding the shortest path\n * between two geographic points over a given GeoJSON LineString network.\n *\n * The class builds an internal graph structure based on the provided network,\n * then applies A* algorithm to compute the shortest route.\n */\nclass TerraRoute {\n    private network: FeatureCollection<LineString> | undefined;\n    private distanceMeasurement: (positionA: Position, positionB: Position) => number;\n    private adjacencyList: Map<number, Array<{ node: number; distance: number }>> = new Map();\n    private coords: Position[] = []\n    private coordMap: Map<number, Map<number, number>> = new Map();\n\n    /**\n     * Creates a new instance of TerraRoute.\n     * \n     * @param distanceMeasurement - Optional custom distance measurement function (defaults to haversine distance).\n     */\n    constructor(\n        distanceMeasurement?: (positionA: Position, positionB: Position) => number\n    ) {\n        this.distanceMeasurement = distanceMeasurement ? distanceMeasurement : haversineDistance;\n    }\n\n    /**\n     * Converts a coordinate into a unique index. If the coordinate already exists, returns its index.\n     * Otherwise, assigns a new index and stores the coordinate.\n     * \n     * @param coord - A GeoJSON Position array representing [longitude, latitude].\n     * @returns A unique numeric index for the coordinate.\n     */\n    private coordinateIndex(coord: Position): number {\n        const [lng, lat] = coord;\n        if (!this.coordMap.has(lng)) this.coordMap.set(lng, new Map());\n\n        const latMap = this.coordMap.get(lng)!;\n        if (latMap.has(lat)) {\n            return latMap.get(lat)!;\n        }\n\n        const index = this.coords.length;\n        this.coords.push(coord);\n        latMap.set(lat, index);\n\n        return index;\n    }\n\n    /**\n     * Builds the internal graph representation (adjacency list) from the input network.\n     * Each LineString segment is translated into bidirectional graph edges with associated distances.\n     * Assumes that the network is a connected graph of LineStrings with shared coordinates. Calling this \n     * method with a new network overwrite any existing network and reset all internal data structures.\n     * \n     * @param network - A GeoJSON FeatureCollection of LineStrings representing the road network.\n     */\n    public buildRouteGraph(network: FeatureCollection<LineString>): void {\n        this.network = network;\n        this.adjacencyList = new Map();\n        this.coords = [];\n        this.coordMap = new Map();\n\n        for (const feature of this.network.features) {\n            const coords = feature.geometry.coordinates;\n            for (let i = 0; i < coords.length - 1; i++) {\n                const aIndex = this.coordinateIndex(coords[i]);\n                const bIndex = this.coordinateIndex(coords[i + 1]);\n                const distance = this.distanceMeasurement(coords[i], coords[i + 1]);\n\n                if (!this.adjacencyList.has(aIndex)) this.adjacencyList.set(aIndex, []);\n                if (!this.adjacencyList.has(bIndex)) this.adjacencyList.set(bIndex, []);\n\n                this.adjacencyList.get(aIndex)!.push({ node: bIndex, distance });\n                this.adjacencyList.get(bIndex)!.push({ node: aIndex, distance });\n            }\n        }\n    }\n\n    /**\n    * Computes the shortest route between two points in the network using bidirectional A* algorithm.\n    * \n    * @param start - A GeoJSON Point Feature representing the start location.\n    * @param end - A GeoJSON Point Feature representing the end location.\n    * @returns A GeoJSON LineString Feature representing the shortest path, or null if no path is found.\n    * \n    * @throws Error if the network has not been built yet with buildRouteGraph(network).\n    */\n    public getRoute(start: Feature<Point>, end: Feature<Point>): Feature<LineString> | null {\n        if (!this.network) {\n            throw new Error(\"Network not built. Please call buildRouteGraph(network) first.\");\n        }\n\n        const startIndex = this.coordinateIndex(start.geometry.coordinates);\n        const endIndex = this.coordinateIndex(end.geometry.coordinates);\n\n        if (startIndex === endIndex) {\n            return null;\n        }\n\n        const openSetForward = new FibonacciHeap();\n        const openSetBackward = new FibonacciHeap();\n        openSetForward.insert(0, startIndex);\n        openSetBackward.insert(0, endIndex);\n\n        const cameFromForward = new Map<number, number>();\n        const cameFromBackward = new Map<number, number>();\n        const gScoreForward = new Map<number, number>([[startIndex, 0]]);\n        const gScoreBackward = new Map<number, number>([[endIndex, 0]]);\n\n        const visitedForward = new Set<number>();\n        const visitedBackward = new Set<number>();\n\n        let meetingNode: number | null = null;\n\n        while (openSetForward.size() > 0 && openSetBackward.size() > 0) {\n            const currentForward = openSetForward.extractMin()!;\n            visitedForward.add(currentForward);\n\n            if (visitedBackward.has(currentForward)) {\n                meetingNode = currentForward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentForward) || []) {\n                const tentativeG = (gScoreForward.get(currentForward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreForward.get(neighbor.node) ?? Infinity)) {\n                    cameFromForward.set(neighbor.node, currentForward);\n                    gScoreForward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[endIndex]);\n                    openSetForward.insert(fScore, neighbor.node);\n                }\n            }\n\n            const currentBackward = openSetBackward.extractMin()!;\n            visitedBackward.add(currentBackward);\n\n            if (visitedForward.has(currentBackward)) {\n                meetingNode = currentBackward;\n                break;\n            }\n\n            for (const neighbor of this.adjacencyList.get(currentBackward) || []) {\n                const tentativeG = (gScoreBackward.get(currentBackward) ?? Infinity) + neighbor.distance;\n                if (tentativeG < (gScoreBackward.get(neighbor.node) ?? Infinity)) {\n                    cameFromBackward.set(neighbor.node, currentBackward);\n                    gScoreBackward.set(neighbor.node, tentativeG);\n                    const fScore = tentativeG + this.distanceMeasurement(this.coords[neighbor.node], this.coords[startIndex]);\n                    openSetBackward.insert(fScore, neighbor.node);\n                }\n            }\n        }\n\n        if (meetingNode === null) {\n            return null;\n        }\n\n        // Reconstruct forward path\n        const pathForward: Position[] = [];\n        let node = meetingNode;\n        while (node !== undefined) {\n            pathForward.unshift(this.coords[node]);\n            node = cameFromForward.get(node)!;\n        }\n\n        // Reconstruct backward path (omit meeting node to avoid duplication)\n        const pathBackward: Position[] = [];\n        node = cameFromBackward.get(meetingNode)!;\n        while (node !== undefined) {\n            pathBackward.push(this.coords[node]);\n            node = cameFromBackward.get(node)!;\n        }\n\n        const fullPath = [...pathForward, ...pathBackward];\n\n        return {\n            type: \"Feature\",\n            geometry: { type: \"LineString\", coordinates: fullPath },\n            properties: {},\n        };\n    }\n}\n\nexport { TerraRoute, createCheapRuler, haversineDistance }","import { Position } from \"geojson\";\n\n// This code is based on Mapbox's cheap-ruler library:\n\n// ISC License\n\n// Copyright (c) 2024, Mapbox\n\n// Permission to use, copy, modify, and/or distribute this software for any purpose\n// with or without fee is hereby granted, provided that the above copyright notice\n// and this permission notice appear in all copies.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n// OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n// THIS SOFTWARE.\n\n/**\n * Creates a function for fast geodesic distance approximation using local scaling constants\n * based on a reference latitude. Useful for city-scale distances.\n *\n * @param {number} lat - Reference latitude in degrees\n * @returns {(a: Position, b: Position) => number} - Function that computes distance between two points\n * \n * @example\n * const distance = createCheapRuler(50.5);\n * const d = distance([30.5, 50.5], [30.51, 50.49]);\n * \n */\nexport function createCheapRuler(lat: number): (a: Position, b: Position) => number {\n    const RE = 6378.137; // Earth's equatorial radius in kilometers\n    const FE = 1 / 298.257223563; // Earth's flattening\n    const E2 = FE * (2 - FE);\n    const RAD = Math.PI / 180;\n\n    const cosLat = Math.cos(lat * RAD);\n    const w2 = 1 / (1 - E2 * (1 - cosLat * cosLat));\n    const w = Math.sqrt(w2);\n\n    const m = RAD * RE;\n    const kx = m * w * cosLat;        // scale for longitude\n    const ky = m * w * w2 * (1 - E2); // scale for latitude\n\n    return function distance(a: Position, b: Position): number {\n        let deltaLng = a[0] - b[0];\n\n        while (deltaLng < -180) deltaLng += 360;\n        while (deltaLng > 180) deltaLng -= 360;\n\n        const dx = deltaLng * kx;\n        const dy = (a[1] - b[1]) * ky;\n\n        return Math.sqrt(dx * dx + dy * dy);\n    };\n}"],"names":["FibonacciHeap","this","nodeCount","minNode","_proto","prototype","insert","key","value","node","degree","mark","parent","child","left","right","mergeLists","extractMin","z","removeFromList","consolidate","size","maxDegree","Math","floor","log2","A","Array","fill","rootList","curr","push","_i","_rootList","length","x","d","y","temp","link","_step","_iterator","_createForOfIteratorHelperLoose","done","a","b","aRight","bRight","haversineDistance","pointOne","pointTwo","toRadians","latOrLng","PI","phiOne","lambdaOne","phiTwo","deltaPhi","deltalambda","sin","cos","atan2","sqrt","TerraRoute","distanceMeasurement","network","adjacencyList","Map","coords","coordMap","coordinateIndex","coord","lng","lat","has","set","latMap","get","index","buildRouteGraph","features","geometry","coordinates","i","aIndex","bIndex","distance","getRoute","start","end","Error","startIndex","endIndex","openSetForward","openSetBackward","cameFromForward","cameFromBackward","gScoreForward","gScoreBackward","visitedForward","Set","visitedBackward","meetingNode","currentForward","add","_iterator2","_step2","_gScoreForward$get","_gScoreForward$get2","neighbor","tentativeG","Infinity","fScore","currentBackward","_step3","_iterator3","_gScoreBackward$get","_gScoreBackward$get2","pathForward","undefined","unshift","pathBackward","type","concat","properties","FE","E2","RAD","cosLat","w2","w","m","kx","ky","deltaLng","dx","dy"],"mappings":"wgCAWA,IAAaA,eAAa,WAAA,SAAAA,IAAAC,KACdC,UAAY,EACZC,KAAAA,QAA0B,IAAI,CAAA,IAAAC,EAAAJ,EAAAK,iBAAAD,EAEtCE,OAAA,SAAOC,EAAaC,GAChB,IAAMC,EAAgB,CAClBF,IAAAA,EACAC,MAAAA,EACAE,OAAQ,EACRC,MAAM,EACNC,OAAQ,KACRC,MAAO,KACPC,KAAM,KACNC,MAAO,MAEXN,EAAKK,KAAOL,EACZA,EAAKM,MAAQN,EAEbR,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASM,GAC7CR,KAAKC,WACT,EAACE,EAEDa,WAAA,WACI,IAAMC,EAAIjB,KAAKE,QACf,IAAKe,EAAG,OAAW,KAGnB,GAAIA,EAAEL,MAAO,CACT,IAAIA,EAAQK,EAAEL,MACd,GACIA,EAAMD,OAAS,KACfC,EAAQA,EAAME,YACTF,IAAUK,EAAEL,OACrBZ,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASe,EAAEL,MACnD,CAYA,OAVAZ,KAAKkB,eAAeD,GAEhBA,IAAMA,EAAEH,MACRd,KAAKE,QAAU,MAEfF,KAAKE,QAAUe,EAAEH,MACjBd,KAAKmB,eAGTnB,KAAKC,YACEgB,EAAEV,KACb,EAACJ,EAEDiB,KAAA,WACI,OAAOpB,KAAKC,SAChB,EAACE,EAIOgB,YAAA,WACJ,IAAME,EAAYC,KAAKC,MAAMD,KAAKE,KAAKxB,KAAKC,YAAc,EACpDwB,EAAI,IAAIC,MAAsBL,GAAWM,KAAK,MAE9CC,EAAsB,GACxBC,EAAO7B,KAAKE,QAChB,GACI0B,EAASE,KAAKD,GACdA,EAAOA,EAAKf,YACPe,IAAS7B,KAAKE,SAEvB,IAAA,IAAA6B,EAAAC,EAAAA,EAAgBJ,EAAQG,EAAAC,EAAAC,OAAAF,IAAE,CAGtB,IAHC,IACGG,EADIF,EAAAD,GAEJI,EAAID,EAAEzB,OACHgB,EAAEU,IAAI,CACT,IAAIC,EAAIX,EAAEU,GACV,GAAID,EAAE5B,IAAM8B,EAAE9B,IAAK,CACf,IAAM+B,EAAOH,EACbA,EAAIE,EACJA,EAAIC,CACR,CACArC,KAAKsC,KAAKF,EAAGF,GACbT,EAAEU,GAAK,KACPA,GACJ,CACAV,EAAEU,GAAKD,CACX,CAEAlC,KAAKE,QAAU,KACf,IAAA,IAAoBqC,EAApBC,EAAAC,EAAmBhB,KAACc,EAAAC,KAAAE,MAAE,CAAX,IAAAlC,EAAI+B,EAAAhC,MACPC,IACAR,KAAKE,QAAUF,KAAKe,WAAWf,KAAKE,QAASM,GAErD,CACJ,EAACL,EAEOmC,KAAA,SAAKF,EAAYF,GACrBlC,KAAKkB,eAAekB,GACpBA,EAAEvB,KAAOuB,EAAEtB,MAAQsB,EACnBF,EAAEtB,MAAQZ,KAAKe,WAAWmB,EAAEtB,MAAOwB,GACnCA,EAAEzB,OAASuB,EACXA,EAAEzB,SACF2B,EAAE1B,MAAO,CACb,EAACP,EAEOY,WAAA,SAAW4B,EAAmBC,GAClC,IAAKD,EAAG,OAAOC,EACf,IAAKA,EAAG,OAAOD,EAEf,IAAME,EAASF,EAAE7B,MACXgC,EAASF,EAAE9B,MAOjB,OALA6B,EAAE7B,MAAQgC,EACVA,EAAOjC,KAAO8B,EACdC,EAAE9B,MAAQ+B,EACVA,EAAOhC,KAAO+B,EAEPD,EAAErC,IAAMsC,EAAEtC,IAAMqC,EAAIC,CAC/B,EAACzC,EAEOe,eAAA,SAAeV,GACnBA,EAAKK,KAAKC,MAAQN,EAAKM,MACvBN,EAAKM,MAAMD,KAAOL,EAAKK,IAC3B,EAACd,CAAA,CAtHqB,GCTbgD,EAAoB,SAACC,EAAoBC,GAClD,IAAMC,EAAY,SAACC,GAAgB,OAAMA,EAAW7B,KAAK8B,GAAM,GAAG,EAE5DC,EAASH,EAAUF,EAAS,IAC5BM,EAAYJ,EAAUF,EAAS,IAC/BO,EAASL,EAAUD,EAAS,IAE5BO,EAAWD,EAASF,EACpBI,EAFYP,EAAUD,EAAS,IAELK,EAE1BX,EACFrB,KAAKoC,IAAIF,EAAW,GAAKlC,KAAKoC,IAAIF,EAAW,GAC7ClC,KAAKqC,IAAIN,GACT/B,KAAKqC,IAAIJ,GACTjC,KAAKoC,IAAID,EAAc,GACvBnC,KAAKoC,IAAID,EAAc,GAM3B,OALU,EAAInC,KAAKsC,MAAMtC,KAAKuC,KAAKlB,GAAIrB,KAAKuC,KAAK,EAAIlB,IAEtC,OAGG,GACtB,4BCZgB,WAYZ,SAAAmB,EACIC,GAZIC,KAAAA,aACAD,EAAAA,KAAAA,yBACAE,EAAAA,KAAAA,cAAwE,IAAIC,IAAKlE,KACjFmE,OAAqB,GAAEnE,KACvBoE,SAA6C,IAAIF,IAUrDlE,KAAK+D,oBAAsBA,GAA4ChB,CAC3E,CAAC,IAAA5C,EAAA2D,EAAA1D,UA4JA,OA5JAD,EASOkE,gBAAA,SAAgBC,GACpB,IAAOC,EAAYD,EAAPE,GAAAA,EAAOF,EACnB,GAAKtE,KAAKoE,SAASK,IAAIF,IAAMvE,KAAKoE,SAASM,IAAIH,EAAK,IAAIL,KAExD,IAAMS,EAAS3E,KAAKoE,SAASQ,IAAIL,GACjC,GAAII,EAAOF,IAAID,GACX,OAAOG,EAAOC,IAAIJ,GAGtB,IAAMK,EAAQ7E,KAAKmE,OAAOlC,OAI1B,OAHAjC,KAAKmE,OAAOrC,KAAKwC,GACjBK,EAAOD,IAAIF,EAAKK,GAETA,CACX,EAAC1E,EAUM2E,gBAAA,SAAgBd,GACnBhE,KAAKgE,QAAUA,EACfhE,KAAKiE,cAAgB,IAAIC,IACzBlE,KAAKmE,OAAS,GACdnE,KAAKoE,SAAW,IAAIF,IAEpB,IAAA,IAA2C3B,EAA3CC,EAAAC,EAAsBzC,KAAKgE,QAAQe,YAAQxC,EAAAC,KAAAE,MAEvC,IAFO,IACDyB,EADQ5B,EAAAhC,MACSyE,SAASC,YACvBC,EAAI,EAAGA,EAAIf,EAAOlC,OAAS,EAAGiD,IAAK,CACxC,IAAMC,EAASnF,KAAKqE,gBAAgBF,EAAOe,IACrCE,EAASpF,KAAKqE,gBAAgBF,EAAOe,EAAI,IACzCG,EAAWrF,KAAK+D,oBAAoBI,EAAOe,GAAIf,EAAOe,EAAI,IAE3DlF,KAAKiE,cAAcQ,IAAIU,IAASnF,KAAKiE,cAAcS,IAAIS,EAAQ,IAC/DnF,KAAKiE,cAAcQ,IAAIW,IAASpF,KAAKiE,cAAcS,IAAIU,EAAQ,IAEpEpF,KAAKiE,cAAcW,IAAIO,GAASrD,KAAK,CAAEtB,KAAM4E,EAAQC,SAAAA,IACrDrF,KAAKiE,cAAcW,IAAIQ,GAAStD,KAAK,CAAEtB,KAAM2E,EAAQE,SAAAA,GACzD,CAER,EAAClF,EAWMmF,SAAA,SAASC,EAAuBC,GACnC,IAAKxF,KAAKgE,QACN,MAAU,IAAAyB,MAAM,kEAGpB,IAAMC,EAAa1F,KAAKqE,gBAAgBkB,EAAMP,SAASC,aACjDU,EAAW3F,KAAKqE,gBAAgBmB,EAAIR,SAASC,aAEnD,GAAIS,IAAeC,EACf,OAAO,KAGX,IAAMC,EAAiB,IAAI7F,EACrB8F,EAAkB,IAAI9F,EAC5B6F,EAAevF,OAAO,EAAGqF,GACzBG,EAAgBxF,OAAO,EAAGsF,GAY1B,IAVA,IAAMG,EAAkB,IAAI5B,IACtB6B,EAAmB,IAAI7B,IACvB8B,EAAgB,IAAI9B,IAAoB,CAAC,CAACwB,EAAY,KACtDO,EAAiB,IAAI/B,IAAoB,CAAC,CAACyB,EAAU,KAErDO,EAAiB,IAAIC,IACrBC,EAAkB,IAAID,IAExBE,EAA6B,KAE1BT,EAAexE,OAAS,GAAKyE,EAAgBzE,OAAS,GAAG,CAC5D,IAAMkF,EAAiBV,EAAe5E,aAGtC,GAFAkF,EAAeK,IAAID,GAEfF,EAAgB3B,IAAI6B,GAAiB,CACrCD,EAAcC,EACd,KACJ,CAEA,IAAAE,IAAmEC,EAAnED,EAAA/D,EAAuBzC,KAAKiE,cAAcW,IAAI0B,IAAmB,MAAEG,EAAAD,KAAA9D,MAAE,CAAAgE,IAAAA,EAAAC,EAA1DC,EAAQH,EAAAlG,MACTsG,GAA+CH,OAAlCA,EAACV,EAAcpB,IAAI0B,IAAeI,EAAII,UAAYF,EAASvB,SAC9E,GAAIwB,GAA8CF,OAApCA,EAAIX,EAAcpB,IAAIgC,EAASpG,OAAKmG,EAAIG,UAAW,CAC7DhB,EAAgBpB,IAAIkC,EAASpG,KAAM8F,GACnCN,EAActB,IAAIkC,EAASpG,KAAMqG,GACjC,IAAME,EAASF,EAAa7G,KAAK+D,oBAAoB/D,KAAKmE,OAAOyC,EAASpG,MAAOR,KAAKmE,OAAOwB,IAC7FC,EAAevF,OAAO0G,EAAQH,EAASpG,KAC3C,CACJ,CAEA,IAAMwG,EAAkBnB,EAAgB7E,aAGxC,GAFAoF,EAAgBG,IAAIS,GAEhBd,EAAezB,IAAIuC,GAAkB,CACrCX,EAAcW,EACd,KACJ,CAEA,IAAA,IAAoEC,EAApEC,EAAAzE,EAAuBzC,KAAKiE,cAAcW,IAAIoC,IAAoB,MAAEC,EAAAC,KAAAxE,MAAE,CAAAyE,IAAAA,EAAAC,EAA3DR,EAAQK,EAAA1G,MACTsG,GAAiDM,OAApCA,EAAClB,EAAerB,IAAIoC,IAAgBG,EAAIL,UAAYF,EAASvB,SAChF,GAAIwB,GAA+CO,OAArCA,EAAInB,EAAerB,IAAIgC,EAASpG,OAAK4G,EAAIN,UAAW,CAC9Df,EAAiBrB,IAAIkC,EAASpG,KAAMwG,GACpCf,EAAevB,IAAIkC,EAASpG,KAAMqG,GAClC,IAAME,EAASF,EAAa7G,KAAK+D,oBAAoB/D,KAAKmE,OAAOyC,EAASpG,MAAOR,KAAKmE,OAAOuB,IAC7FG,EAAgBxF,OAAO0G,EAAQH,EAASpG,KAC5C,CACJ,CACJ,CAEA,GAAoB,OAAhB6F,EACA,OAAO,KAMX,IAFA,IAAMgB,EAA0B,GAC5B7G,EAAO6F,OACKiB,IAAT9G,GACH6G,EAAYE,QAAQvH,KAAKmE,OAAO3D,IAChCA,EAAOsF,EAAgBlB,IAAIpE,GAI/B,IAAMgH,EAA2B,GAEjC,IADAhH,EAAOuF,EAAiBnB,IAAIyB,QACZiB,IAAT9G,GACHgH,EAAa1F,KAAK9B,KAAKmE,OAAO3D,IAC9BA,EAAOuF,EAAiBnB,IAAIpE,GAKhC,MAAO,CACHiH,KAAM,UACNzC,SAAU,CAAEyC,KAAM,aAAcxC,YAJtB,GAAAyC,OAAOL,EAAgBG,IAKjCG,WAAY,CAAA,EAEpB,EAAC7D,CAAA,CA5KW,sBCoBV,SAA2BU,GAC7B,IACMoD,EAAK,EAAI,cACTC,EAAKD,GAAM,EAAIA,GACfE,EAAMxG,KAAK8B,GAAK,IAEhB2E,EAASzG,KAAKqC,IAAIa,EAAMsD,GACxBE,EAAK,GAAK,EAAIH,GAAM,EAAIE,EAASA,IACjCE,EAAI3G,KAAKuC,KAAKmE,GAEdE,EATK,SASDJ,EACJK,EAAKD,EAAID,EAAIF,EACbK,EAAKF,EAAID,EAAID,GAAM,EAAIH,GAE7B,OAAgB,SAASlF,EAAaC,GAGlC,IAFA,IAAIyF,EAAW1F,EAAE,GAAKC,EAAE,GAEjByF,GAAY,KAAKA,GAAY,IACpC,KAAOA,EAAW,KAAKA,GAAY,IAEnC,IAAMC,EAAKD,EAAWF,EAChBI,GAAM5F,EAAE,GAAKC,EAAE,IAAMwF,EAE3B,OAAO9G,KAAKuC,KAAKyE,EAAKA,EAAKC,EAAKA,EACpC,CACJ"}

package/jest.config.js

@@ -18,7 +18,7 @@ export default {
     global: {
       lines: 80,
       functions: 80,
-      branches: 80,
+      branches: 75,
       statements: 80,
     },
   }

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "terra-route",
-    "version": "0.0.5",
+    "version": "0.0.6",
     "description": "A library for routing along GeoJSON LineString networks",
     "scripts": {
         "docs": "typedoc",
@@ -40,18 +40,18 @@
         "eslint": "8.57.1",
         "eslint-config-prettier": "9.1.0",
         "eslint-plugin-prettier": "5.2.1",
-        "geojson": "^0.5.0",
         "geojson-path-finder": "^2.0.2",
         "jest": "^29.7.0",
         "knip": "^5.38.1",
         "microbundle": "0.15.1",
+        "ngraph.graph": "^20.0.1",
+        "ngraph.path": "^1.5.0",
         "serve": "^14.2.4",
         "ts-jest": "^29.2.5",
         "tsx": "^4.19.3",
         "typedoc": "^0.28.1",
         "typescript": "^5.8.3"
     },
-    "dependencies": {},
     "keywords": [
         "geojson",
         "linestring",
@@ -89,5 +89,8 @@
         "out": "docs",
         "skipErrorChecking": true,
         "sourceLinkExternal": true
+    },
+    "dependencies": {
+        "@types/geojson": "^7946.0.16"
     }
 }

package/src/fibonacci-heap.spec.ts

@@ -0,0 +1,55 @@
+import { FibonacciHeap } from './fibonacci-heap';
+
+describe('FibonacciHeap', () => {
+    let heap: FibonacciHeap;
+
+    beforeEach(() => {
+        heap = new FibonacciHeap();
+    });
+
+    test('insert() and size()', () => {
+        expect(heap.size()).toBe(0);
+        heap.insert(10, 1);
+        expect(heap.size()).toBe(1);
+        heap.insert(5, 2);
+        expect(heap.size()).toBe(2);
+    });
+
+    test('extractMin() returns the correct value', () => {
+        heap.insert(20, 101);
+        heap.insert(5, 102);
+        heap.insert(15, 103);
+
+        expect(heap.extractMin()).toBe(102); // key 5
+        expect(heap.size()).toBe(2);
+        expect(heap.extractMin()).toBe(103); // key 15
+        expect(heap.extractMin()).toBe(101); // key 20
+        expect(heap.extractMin()).toBeNull();
+    });
+
+    test('extractMin() on empty heap returns null', () => {
+        expect(heap.extractMin()).toBeNull();
+    });
+
+    test('insert() handles duplicate keys', () => {
+        heap.insert(10, 201);
+        heap.insert(10, 202);
+        heap.insert(10, 203);
+
+        const values = [heap.extractMin(), heap.extractMin(), heap.extractMin()];
+        expect(values).toContain(201);
+        expect(values).toContain(202);
+        expect(values).toContain(203);
+        expect(heap.size()).toBe(0);
+    });
+
+    test('interleaved insert and extractMin()', () => {
+        heap.insert(30, 301);
+        heap.insert(10, 302);
+        expect(heap.extractMin()).toBe(302);
+        heap.insert(20, 303);
+        expect(heap.extractMin()).toBe(303);
+        expect(heap.extractMin()).toBe(301);
+        expect(heap.extractMin()).toBeNull();
+    });
+});

package/src/fibonacci-heap.ts

@@ -0,0 +1,131 @@
+type FibNode = {
+    key: number;
+    value: number;
+    degree: number;
+    mark: boolean;
+    parent: FibNode | null;
+    child: FibNode | null;
+    left: FibNode;
+    right: FibNode;
+};
+
+export class FibonacciHeap {
+    private nodeCount = 0;
+    private minNode: FibNode | null = null;
+
+    insert(key: number, value: number): void {
+        const node: FibNode = {
+            key,
+            value,
+            degree: 0,
+            mark: false,
+            parent: null,
+            child: null,
+            left: null as any,
+            right: null as any,
+        };
+        node.left = node;
+        node.right = node;
+
+        this.minNode = this.mergeLists(this.minNode, node);
+        this.nodeCount++;
+    }
+
+    extractMin(): number | null {
+        const z = this.minNode;
+        if (!z) return null;
+
+        // Add children to root list
+        if (z.child) {
+            let child = z.child;
+            do {
+                child.parent = null;
+                child = child.right!;
+            } while (child !== z.child);
+            this.minNode = this.mergeLists(this.minNode, z.child);
+        }
+
+        this.removeFromList(z);
+
+        if (z === z.right) {
+            this.minNode = null;
+        } else {
+            this.minNode = z.right;
+            this.consolidate();
+        }
+
+        this.nodeCount--;
+        return z.value;
+    }
+
+    size(): number {
+        return this.nodeCount;
+    }
+
+    // ========== Internal Methods ==========
+
+    private consolidate(): void {
+        const maxDegree = Math.floor(Math.log2(this.nodeCount)) + 1;
+        const A = new Array<FibNode | null>(maxDegree).fill(null);
+
+        const rootList: FibNode[] = [];
+        let curr = this.minNode!;
+        do {
+            rootList.push(curr);
+            curr = curr.right!;
+        } while (curr !== this.minNode);
+
+        for (const w of rootList) {
+            let x = w;
+            let d = x.degree;
+            while (A[d]) {
+                let y = A[d]!;
+                if (x.key > y.key) {
+                    const temp = x;
+                    x = y;
+                    y = temp;
+                }
+                this.link(y, x);
+                A[d] = null;
+                d++;
+            }
+            A[d] = x;
+        }
+
+        this.minNode = null;
+        for (const node of A) {
+            if (node) {
+                this.minNode = this.mergeLists(this.minNode, node);
+            }
+        }
+    }
+
+    private link(y: FibNode, x: FibNode): void {
+        this.removeFromList(y);
+        y.left = y.right = y;
+        x.child = this.mergeLists(x.child, y);
+        y.parent = x;
+        x.degree++;
+        y.mark = false;
+    }
+
+    private mergeLists(a: FibNode | null, b: FibNode | null): FibNode {
+        if (!a) return b!;
+        if (!b) return a;
+
+        const aRight = a.right!;
+        const bRight = b.right!;
+
+        a.right = bRight;
+        bRight.left = a;
+        b.right = aRight;
+        aRight.left = b;
+
+        return a.key < b.key ? a : b;
+    }
+
+    private removeFromList(node: FibNode): void {
+        node.left.right = node.right;
+        node.right.left = node.left;
+    }
+}

package/src/terra-route.spec.ts

@@ -356,6 +356,7 @@ describe("TerraRoute", () => {
         const result = routeFinder.getRoute(start, end);
 
         expect(result).not.toBeNull();
+        expect(getReasonIfLineStringInvalid(result)).toBe(undefined);
 
         // Should take diagonals: (0,0) → (0.01,0.01) → (0.05,0.05)
         const expectedRoute = [
@@ -371,7 +372,7 @@ describe("TerraRoute", () => {
 
         const resultTwo = routeFinder.getRoute(end, start);
         expect(resultTwo).not.toBeNull();
-        expect(getReasonIfLineStringInvalid(result)).toBe(undefined);
+        expect(getReasonIfLineStringInvalid(resultTwo)).toBe(undefined);
         expect(resultTwo!.geometry.coordinates).toEqual(expectedRoute.reverse());
     })
 

package/src/terra-route.ts

@@ -1,5 +1,5 @@
 import { FeatureCollection, LineString, Point, Feature, Position } from "geojson";
-import { MinHeap } from "./min-heap";
+import { FibonacciHeap } from "./fibonacci-heap";
 import { haversineDistance } from "./distance/haversine";
 import { createCheapRuler } from "./distance/cheap-ruler";
 
@@ -102,8 +102,8 @@ class TerraRoute {
             return null;
         }
 
-        const openSetForward = new MinHeap();
-        const openSetBackward = new MinHeap();
+        const openSetForward = new FibonacciHeap();
+        const openSetBackward = new FibonacciHeap();
         openSetForward.insert(0, startIndex);
         openSetBackward.insert(0, endIndex);
 

package/src/test-utils/test-utils.ts

@@ -374,6 +374,8 @@ export function getReasonIfLineStringInvalid(
         return `Not enough coordinates: ${coords.length} (${coords})`;
     }
 
+    const seen = new Set<string>();
+
     // 5. Validate each coordinate is a valid Position
     //    (At minimum, [number, number] or [number, number, number])
     for (const position of coords) {
@@ -389,5 +391,12 @@ export function getReasonIfLineStringInvalid(
         ) {
             return 'Not a Position; elements are not a numbers';
         }
+
+        // 6. Check for duplicates
+        const key = `${position[0]},${position[1]}`;
+        if (seen.has(key)) {
+            return `Duplicate coordinate: ${key}`;
+        }
+        seen.add(key);
     }
 }

package/src/min-heap.spec.ts

@@ -1,75 +0,0 @@
-import { MinHeap } from './min-heap';
-
-describe('MinHeap', () => {
-    let heap: MinHeap;
-
-    beforeEach(() => {
-        heap = new MinHeap();
-    });
-
-    it('should create an empty heap', () => {
-        expect(heap.size()).toBe(0);
-    });
-
-    it('should insert a single element', () => {
-        heap.insert(5, 100);
-        expect(heap.size()).toBe(1);
-        expect(heap.extractMin()).toBe(100);
-        expect(heap.size()).toBe(0);
-    });
-
-    it('should maintain correct heap order when inserting multiple elements', () => {
-        heap.insert(10, 200);
-        heap.insert(5, 100);
-        heap.insert(3, 50);
-        heap.insert(7, 150);
-
-        expect(heap.size()).toBe(4);
-        expect(heap.extractMin()).toBe(50);
-        expect(heap.extractMin()).toBe(100);
-        expect(heap.extractMin()).toBe(150);
-        expect(heap.extractMin()).toBe(200);
-        expect(heap.size()).toBe(0);
-    });
-
-    it('should return null when extracting from an empty heap', () => {
-        expect(heap.extractMin()).toBeNull();
-    });
-
-    it('should handle duplicate keys properly', () => {
-        heap.insert(5, 100);
-        heap.insert(5, 200);
-        heap.insert(5, 300);
-
-        expect(heap.size()).toBe(3);
-        expect(heap.extractMin()).toBe(100);
-        expect(heap.extractMin()).toBe(200);
-        expect(heap.extractMin()).toBe(300);
-        expect(heap.size()).toBe(0);
-    });
-
-    it('should correctly reorder after sequential insert and extract', () => {
-        heap.insert(10, 100);
-        heap.insert(1, 50);
-        expect(heap.extractMin()).toBe(50);
-
-        heap.insert(2, 60);
-        heap.insert(3, 70);
-        expect(heap.extractMin()).toBe(60);
-        expect(heap.extractMin()).toBe(70);
-        expect(heap.extractMin()).toBe(100);
-    });
-
-    it('should handle large number of elements correctly', () => {
-        const elements = Array.from({ length: 1000 }, (_, i) => ({ key: 1000 - i, value: i }));
-        elements.forEach(el => heap.insert(el.key, el.value));
-
-        expect(heap.size()).toBe(1000);
-
-        for (let i = 999; i >= 0; i--) {
-            expect(heap.extractMin()).toBe(i);
-        }
-
-        expect(heap.size()).toBe(0);
-    });
-});

package/src/min-heap.ts

@@ -1,87 +0,0 @@
-export class MinHeap {
-    private heap: Array<{ key: number; value: number; index: number }> = [];
-    private insertCounter = 0;
-
-    insert(key: number, value: number): void {
-        const node = { key, value, index: this.insertCounter++ };
-        let idx = this.heap.length;
-        this.heap.push(node);
-
-        // Optimized Bubble Up
-        while (idx > 0) {
-            const parentIdx = (idx - 1) >>> 1; // Fast Math.floor((idx - 1) / 2)
-            const parent = this.heap[parentIdx];
-            if (node.key > parent.key || (node.key === parent.key && node.index > parent.index)) break;
-            this.heap[idx] = parent;
-            idx = parentIdx;
-        }
-        this.heap[idx] = node;
-    }
-
-    extractMin(): number | null {
-        const length = this.heap.length;
-        if (length === 0) return null;
-
-        const minNode = this.heap[0];
-        const endNode = this.heap.pop()!;
-
-        if (length > 1) {
-            this.heap[0] = endNode;
-            this.bubbleDown(0);
-        }
-
-        return minNode.value;
-    }
-
-    size(): number {
-        return this.heap.length;
-    }
-
-    private bubbleDown(idx: number): void {
-        const { heap } = this;
-        const length = heap.length;
-        // Grab the parent node once, then move it down only if needed
-        const node = heap[idx];
-        const nodeKey = node.key;
-        const nodeIndex = node.index;
-
-        while (true) {
-            // Calculate left and right child indexes
-            const leftIdx = (idx << 1) + 1;
-            if (leftIdx >= length) {
-                // No children => we’re already in place
-                break;
-            }
-
-            // Assume left child is the smaller one by default
-            let smallestIdx = leftIdx;
-            let smallestKey = heap[leftIdx].key;
-            let smallestIndex = heap[leftIdx].index;
-
-            const rightIdx = leftIdx + 1;
-            if (rightIdx < length) {
-                // Compare left child vs. right child
-                const rightKey = heap[rightIdx].key;
-                const rightIndex = heap[rightIdx].index;
-                if (rightKey < smallestKey || (rightKey === smallestKey && rightIndex < smallestIndex)) {
-                    smallestIdx = rightIdx;
-                    smallestKey = rightKey;
-                    smallestIndex = rightIndex;
-                }
-            }
-
-            // Compare the smaller child with the parent
-            if (smallestKey < nodeKey || (smallestKey === nodeKey && smallestIndex < nodeIndex)) {
-                // Swap the smaller child up
-                heap[idx] = heap[smallestIdx];
-                idx = smallestIdx;
-            } else {
-                // We’re in the correct position now, so stop
-                break;
-            }
-        }
-
-        // Place the original node in its final position
-        heap[idx] = node;
-    }
-}