jcready

const PriorityQueue = (() => {
  const parent = i => ((i + 1) >>> 1) - 1
  const left = i => (i << 1) + 1
  const right = i => (i + 1) << 1

  const privateMap = new WeakMap()
  const $ = privateMap.get.bind(privateMap)

  const swap = (self, i, j) => {
    const h = $(self).heap

jcready

export const parseGraph = s => s
  .split(',')
  .map(edge => edge.trim().split('->'))
  .reduce((adjacency, [a, b]) => {
    if (!adjacency.has(a)) {
      adjacency.set(a, new Set())
    }
    if (!adjacency.has(b)) {
      adjacency.set(b, new Set())
    }