Challenge: Find the Shortest Path Between Two Vertices

Problem Statement #

Implement the findMin() function, which will take a graph and two vertices, A and B. The result will be the shortest path from A to B.

Remember, the shortest path will contain the minimum number of edges.

Note: Shortest distance between the same source and destination vertex will be 0.

Note: Your program should return -1 if either source or destination node does not exist.

Input #

A directed graph, a vertex A and a vertex B.

Output #

Returns number of edges in the shortest path between A and B.

Sample Input #

digraph = {
    0 -> 1
    0 -> 2
    0 -> 3
    3 -> 5
    5 -> 4
    2 -> 4
}

Vertex A = 0 
Vertex B = 4

Sample Output #

2