tternquist

function shortestPath(adjList, v, goal) {
    var visited = []
    var queue = [];
    var shortestDistance = {};
    var distance = {}
    var adjListKeys = Object.keys(adjList);
    for (var i = 0; i < adjListKeys.length; i++) {
        var node = adjListKeys[i];
        if (node !== v.toString()) {
            shortestDistance[node] = -1;