Challenge: Find the Shortest Path between Two Vertices

The challenge involves finding the shortest path in a directed graph between two specified vertices, src and dest. The goal is to determine the minimum number of edges in this path, returning -1 if no path exists. The problem is constrained to graphs with up to 100 nodes, where each node has a unique identifier. A coding template is provided for implementation.