Challenge: Find the Shortest Path between Two Vertices

Explore how to find the shortest path between two vertices in a directed graph by implementing graph traversal algorithms. Learn to handle constraints and edge cases while returning the minimum edge count or -1 if no path exists.