042-shortest-path

shortest path

Write a function, shortestPath, that takes in an array of edges for an undirected graph and two nodes (nodeA, nodeB). The function should return the length of the shortest path between A and B. Consider the length as the number of edges in the path, not the number of nodes. If there is no path between A and B, then return -1.

test_00:

const edges = [
['w', 'x'],
['x', 'y'],
['z', 'y'],
['z', 'v'],
['w', 'v']
];

shortestPath(edges, 'w', 'z'); // -> 2

test_01:

const edges = [
['w', 'x'],
['x', 'y'],
['z', 'y'],
['z', 'v'],
['w', 'v']
];

shortestPath(edges, 'y', 'x'); // -> 1

test_02:

const edges = [
['a', 'c'],
['a', 'b'],
['c', 'b'],
['c', 'd'],
['b', 'd'],
['e', 'd'],
['g', 'f']
];

shortestPath(edges, 'a', 'e'); // -> 3

test_03:

const edges = [
['a', 'c'],
['a', 'b'],
['c', 'b'],
['c', 'd'],
['b', 'd'],
['e', 'd'],
['g', 'f']
];

shortestPath(edges, 'e', 'c'); // -> 2

test_04:

const edges = [
['a', 'c'],
['a', 'b'],
['c', 'b'],
['c', 'd'],
['b', 'd'],
['e', 'd'],
['g', 'f']
];

shortestPath(edges, 'b', 'g'); // -> -1

test_05:

const edges = [
['c', 'n'],
['c', 'e'],
['c', 's'],
['c', 'w'],
['w', 'e'],
];

shortestPath(edges, 'w', 'e'); // -> 1

test_06:

const edges = [
['c', 'n'],
['c', 'e'],
['c', 's'],
['c', 'w'],
['w', 'e'],
];

shortestPath(edges, 'n', 'e'); // -> 2

test_07:

const edges = [
['m', 'n'],
['n', 'o'],
['o', 'p'],
['p', 'q'],
['t', 'o'],
['r', 'q'],
['r', 's']
];

shortestPath(edges, 'm', 's'); // -> 6