Dijkstra's algorithm on JavaScript (es6)

index.js

const start = 'ml'
const graph = {
    ml: {
        zp: 30,
        dp: 120,
    },

    zp: {
        kv: 300,
        dp: 70,
    },

    dp: {
        kv: 250,
    },

    kv: {}
}

const costs = Object.keys(graph).filter(v => v !== start).reduce((obj, v) => {
    obj[v] = Infinity
    return obj
}, {})

const parents = Object.keys(costs).reduce((obj, v) => {
    obj[v] = []
    return obj
}, {})

const goPoint = (next, current, cost, parent) => {
    console.log(costs)
    if (costs[next] > cost + current) {
        costs[next] = cost + current
        if(parents[parent]) parents[next].push( ...parents[parent] )
        parents[next].push(parent)
        if(graph[next]) {
            getWay(graph[next], costs[next], next)
        }
    }
}

const getWay = (node, cost, parent) => {
    for (let i in node) {
        goPoint(i, node[i], cost, parent)
    }
}

getWay(graph.ml, 0, start)

console.log(costs)
console.log(parents)