const findShortestPath = async (g, s, e) => {
  const { default: PQ } = await import('https://cdn.jsdelivr.net/npm/js-priority-queue@0.1.5/+esm')
  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 k in g[n] || {}) {
      const c = w + g[n][k]
      if (c < (d[k] ?? 1 / 0)) {
        d[k] = c
        q.queue({ n: k, w: c })
      }
    }
  }

  return 1 / 0
}
export default findShortestPath;