{"version":3,"sources":["node_modules/dijkstrajs/dijkstra.js","node_modules/encode-utf8/index.js"],"sourcesContent":["'use strict';\n\n/******************************************************************************\n * Created 2008-08-19.\n *\n * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.\n *\n * Copyright (C) 2008\n * Wyatt Baldwin \n * All rights reserved\n *\n * Licensed under the MIT license.\n *\n * http://www.opensource.org/licenses/mit-license.php\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *****************************************************************************/\nvar dijkstra = {\n single_source_shortest_paths: function (graph, s, d) {\n // Predecessor map for each node that has been encountered.\n // node ID => predecessor node ID\n var predecessors = {};\n\n // Costs of shortest paths from s to all nodes encountered.\n // node ID => cost\n var costs = {};\n costs[s] = 0;\n\n // Costs of shortest paths from s to all nodes encountered; differs from\n // `costs` in that it provides easy access to the node that currently has\n // the known shortest path from s.\n // XXX: Do we actually need both `costs` and `open`?\n var open = dijkstra.PriorityQueue.make();\n open.push(s, 0);\n var closest, u, v, cost_of_s_to_u, adjacent_nodes, cost_of_e, cost_of_s_to_u_plus_cost_of_e, cost_of_s_to_v, first_visit;\n while (!open.empty()) {\n // In the nodes remaining in graph that have a known cost from s,\n // find the node, u, that currently has the shortest path from s.\n closest = open.pop();\n u = closest.value;\n cost_of_s_to_u = closest.cost;\n\n // Get nodes adjacent to u...\n adjacent_nodes = graph[u] || {};\n\n // ...and explore the edges that connect u to those nodes, updating\n // the cost of the shortest paths to any or all of those nodes as\n // necessary. v is the node across the current edge from u.\n for (v in adjacent_nodes) {\n if (adjacent_nodes.hasOwnProperty(v)) {\n // Get the cost of the edge running from u to v.\n cost_of_e = adjacent_nodes[v];\n\n // Cost of s to u plus the cost of u to v across e--this is *a*\n // cost from s to v that may or may not be less than the current\n // known cost to v.\n cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;\n\n // If we haven't visited v yet OR if the current known cost from s to\n // v is greater than the new cost we just found (cost of s to u plus\n // cost of u to v across e), update v's cost in the cost list and\n // update v's predecessor in the predecessor list (it's now u).\n cost_of_s_to_v = costs[v];\n first_visit = typeof costs[v] === 'undefined';\n if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {\n costs[v] = cost_of_s_to_u_plus_cost_of_e;\n open.push(v, cost_of_s_to_u_plus_cost_of_e);\n predecessors[v] = u;\n }\n }\n }\n }\n if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {\n var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');\n throw new Error(msg);\n }\n return predecessors;\n },\n extract_shortest_path_from_predecessor_list: function (predecessors, d) {\n var nodes = [];\n var u = d;\n var predecessor;\n while (u) {\n nodes.push(u);\n predecessor = predecessors[u];\n u = predecessors[u];\n }\n nodes.reverse();\n return nodes;\n },\n find_path: function (graph, s, d) {\n var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);\n return dijkstra.extract_shortest_path_from_predecessor_list(predecessors, d);\n },\n /**\n * A very naive priority queue implementation.\n */\n PriorityQueue: {\n make: function (opts) {\n var T = dijkstra.PriorityQueue,\n t = {},\n key;\n opts = opts || {};\n for (key in T) {\n if (T.hasOwnProperty(key)) {\n t[key] = T[key];\n }\n }\n t.queue = [];\n t.sorter = opts.sorter || T.default_sorter;\n return t;\n },\n default_sorter: function (a, b) {\n return a.cost - b.cost;\n },\n /**\n * Add a new item to the queue and ensure the highest priority element\n * is at the front of the queue.\n */\n push: function (value, cost) {\n var item = {\n value: value,\n cost: cost\n };\n this.queue.push(item);\n this.queue.sort(this.sorter);\n },\n /**\n * Return the highest priority element in the queue.\n */\n pop: function () {\n return this.queue.shift();\n },\n empty: function () {\n return this.queue.length === 0;\n }\n }\n};\n\n// node.js module exports\nif (typeof module !== 'undefined') {\n module.exports = dijkstra;\n}","'use strict';\n\nmodule.exports = function encodeUtf8(input) {\n var result = [];\n var size = input.length;\n for (var index = 0; index < size; index++) {\n var point = input.charCodeAt(index);\n if (point >= 0xD800 && point <= 0xDBFF && size > index + 1) {\n var second = input.charCodeAt(index + 1);\n if (second >= 0xDC00 && second <= 0xDFFF) {\n // https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae\n point = (point - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;\n index += 1;\n }\n }\n\n // US-ASCII\n if (point < 0x80) {\n result.push(point);\n continue;\n }\n\n // 2-byte UTF-8\n if (point < 0x800) {\n result.push(point >> 6 | 192);\n result.push(point & 63 | 128);\n continue;\n }\n\n // 3-byte UTF-8\n if (point < 0xD800 || point >= 0xE000 && point < 0x10000) {\n result.push(point >> 12 | 224);\n result.push(point >> 6 & 63 | 128);\n result.push(point & 63 | 128);\n continue;\n }\n\n // 4-byte UTF-8\n if (point >= 0x10000 && point <= 0x10FFFF) {\n result.push(point >> 18 | 240);\n result.push(point >> 12 & 63 | 128);\n result.push(point >> 6 & 63 | 128);\n result.push(point & 63 | 128);\n continue;\n }\n\n // Invalid character\n result.push(0xEF, 0xBF, 0xBD);\n }\n return new Uint8Array(result).buffer;\n};"],"mappings":"wCAAA,IAAAA,EAAAC,EAAA,CAAAC,EAAAC,IAAA,cAuBA,IAAIC,EAAW,CACb,6BAA8B,SAAUC,EAAO,EAAGC,EAAG,CAGnD,IAAIC,EAAe,CAAC,EAIhBC,EAAQ,CAAC,EACbA,EAAM,CAAC,EAAI,EAMX,IAAIC,EAAOL,EAAS,cAAc,KAAK,EACvCK,EAAK,KAAK,EAAG,CAAC,EAEd,QADIC,EAASC,EAAGC,EAAGC,EAAgBC,EAAgBC,EAAWC,EAA+BC,EAAgBC,EACtG,CAACT,EAAK,MAAM,GAAG,CAGpBC,EAAUD,EAAK,IAAI,EACnBE,EAAID,EAAQ,MACZG,EAAiBH,EAAQ,KAGzBI,EAAiBT,EAAMM,CAAC,GAAK,CAAC,EAK9B,IAAKC,KAAKE,EACJA,EAAe,eAAeF,CAAC,IAEjCG,EAAYD,EAAeF,CAAC,EAK5BI,EAAgCH,EAAiBE,EAMjDE,EAAiBT,EAAMI,CAAC,EACxBM,EAAc,OAAOV,EAAMI,CAAC,EAAM,KAC9BM,GAAeD,EAAiBD,KAClCR,EAAMI,CAAC,EAAII,EACXP,EAAK,KAAKG,EAAGI,CAA6B,EAC1CT,EAAaK,CAAC,EAAID,GAI1B,CACA,GAAI,OAAOL,EAAM,KAAe,OAAOE,EAAMF,CAAC,EAAM,IAAa,CAC/D,IAAIa,EAAM,CAAC,8BAA+B,EAAG,OAAQb,EAAG,GAAG,EAAE,KAAK,EAAE,EACpE,MAAM,IAAI,MAAMa,CAAG,CACrB,CACA,OAAOZ,CACT,EACA,4CAA6C,SAAUA,EAAcD,EAAG,CAItE,QAHIc,EAAQ,CAAC,EACTT,EAAIL,EACJe,EACGV,GACLS,EAAM,KAAKT,CAAC,EACZU,EAAcd,EAAaI,CAAC,EAC5BA,EAAIJ,EAAaI,CAAC,EAEpB,OAAAS,EAAM,QAAQ,EACPA,CACT,EACA,UAAW,SAAUf,EAAO,EAAGC,EAAG,CAChC,IAAIC,EAAeH,EAAS,6BAA6BC,EAAO,EAAGC,CAAC,EACpE,OAAOF,EAAS,4CAA4CG,EAAcD,CAAC,CAC7E,EAIA,cAAe,CACb,KAAM,SAAUgB,EAAM,CACpB,IAAIC,EAAInB,EAAS,cACfoB,EAAI,CAAC,EACLC,EACFH,EAAOA,GAAQ,CAAC,EAChB,IAAKG,KAAOF,EACNA,EAAE,eAAeE,CAAG,IACtBD,EAAEC,CAAG,EAAIF,EAAEE,CAAG,GAGlB,OAAAD,EAAE,MAAQ,CAAC,EACXA,EAAE,OAASF,EAAK,QAAUC,EAAE,eACrBC,CACT,EACA,eAAgB,SAAUE,EAAGC,EAAG,CAC9B,OAAOD,EAAE,KAAOC,EAAE,IACpB,EAKA,KAAM,SAAUC,EAAOC,EAAM,CAC3B,IAAIC,EAAO,CACT,MAAOF,EACP,KAAMC,CACR,EACA,KAAK,MAAM,KAAKC,CAAI,EACpB,KAAK,MAAM,KAAK,KAAK,MAAM,CAC7B,EAIA,IAAK,UAAY,CACf,OAAO,KAAK,MAAM,MAAM,CAC1B,EACA,MAAO,UAAY,CACjB,OAAO,KAAK,MAAM,SAAW,CAC/B,CACF,CACF,EAGI,OAAO3B,EAAW,MACpBA,EAAO,QAAUC,KCnJnB,IAAA2B,EAAAC,EAAA,CAAAC,EAAAC,IAAA,cAEAA,EAAO,QAAU,SAAoBC,EAAO,CAG1C,QAFIC,EAAS,CAAC,EACVC,EAAOF,EAAM,OACRG,EAAQ,EAAGA,EAAQD,EAAMC,IAAS,CACzC,IAAIC,EAAQJ,EAAM,WAAWG,CAAK,EAClC,GAAIC,GAAS,OAAUA,GAAS,OAAUF,EAAOC,EAAQ,EAAG,CAC1D,IAAIE,EAASL,EAAM,WAAWG,EAAQ,CAAC,EACnCE,GAAU,OAAUA,GAAU,QAEhCD,GAASA,EAAQ,OAAU,KAAQC,EAAS,MAAS,MACrDF,GAAS,EAEb,CAGA,GAAIC,EAAQ,IAAM,CAChBH,EAAO,KAAKG,CAAK,EACjB,QACF,CAGA,GAAIA,EAAQ,KAAO,CACjBH,EAAO,KAAKG,GAAS,EAAI,GAAG,EAC5BH,EAAO,KAAKG,EAAQ,GAAK,GAAG,EAC5B,QACF,CAGA,GAAIA,EAAQ,OAAUA,GAAS,OAAUA,EAAQ,MAAS,CACxDH,EAAO,KAAKG,GAAS,GAAK,GAAG,EAC7BH,EAAO,KAAKG,GAAS,EAAI,GAAK,GAAG,EACjCH,EAAO,KAAKG,EAAQ,GAAK,GAAG,EAC5B,QACF,CAGA,GAAIA,GAAS,OAAWA,GAAS,QAAU,CACzCH,EAAO,KAAKG,GAAS,GAAK,GAAG,EAC7BH,EAAO,KAAKG,GAAS,GAAK,GAAK,GAAG,EAClCH,EAAO,KAAKG,GAAS,EAAI,GAAK,GAAG,EACjCH,EAAO,KAAKG,EAAQ,GAAK,GAAG,EAC5B,QACF,CAGAH,EAAO,KAAK,IAAM,IAAM,GAAI,CAC9B,CACA,OAAO,IAAI,WAAWA,CAAM,EAAE,MAChC","names":["require_dijkstra","__commonJSMin","exports","module","dijkstra","graph","d","predecessors","costs","open","closest","u","v","cost_of_s_to_u","adjacent_nodes","cost_of_e","cost_of_s_to_u_plus_cost_of_e","cost_of_s_to_v","first_visit","msg","nodes","predecessor","opts","T","t","key","a","b","value","cost","item","require_encode_utf8","__commonJSMin","exports","module","input","result","size","index","point","second"],"x_google_ignoreList":[0,1]}