mirror of
https://github.com/multipleof4/lynchmark.git
synced 2026-01-14 00:27:55 +00:00
22 lines
578 B
JavaScript
22 lines
578 B
JavaScript
const findShortestPath = async (g, s, e) => {
|
|
const { default: PQ } = await import('https://esm.sh/js-priority-queue')
|
|
const q = new PQ({ comparator: (a, b) => a.w - b.w })
|
|
const d = { [s]: 0 }
|
|
q.queue({ n: s, w: 0 })
|
|
|
|
while (q.length) {
|
|
const { n, w } = q.dequeue()
|
|
if (n === e) return w
|
|
if (w > (d[n] ?? 1 / 0)) continue
|
|
|
|
for (const [v, cost] of Object.entries(g[n] || {})) {
|
|
const t = w + cost
|
|
if (t < (d[v] ?? 1 / 0)) {
|
|
d[v] = t
|
|
q.queue({ n: v, w: t })
|
|
}
|
|
}
|
|
}
|
|
return 1 / 0
|
|
}
|
|
export default findShortestPath; |