Shortest Path Between A and B
Prereq: BFS on Graph
Given an (unweighted) graph, return the length of the shortest path between two nodes A and B.
Input:
graph: {
0: [1, 2],
1: [0, 2, 3],
2: [0, 1],
3: [1]
}
A: 0
B: 3
Output: 2
Loading full content...