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, in terms of the number of edges.


1graph: {
2  0: [1, 2],
3  1: [0, 2, 3],
4  2: [0, 1],
5  3: [1]
7A: 0
8B: 3

Output: 2

You can use the BFS template from BFS on graphs as your starter code.

Try it yourself




Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.

Contrary to popular belief, Lorem Ipsum is not simply random text.

1  >>> a = [1, 2, 3]
2  >>> a[-1]
3  3

Get premium for instant access to all content and solutions