Search⌘ K
Home
Courses
Data Structures for Coding Interviews in JavaScript

Challenge: Find the Shortest Path between Two Vertices

Explore how to determine the shortest path between two vertices in a directed graph by counting the minimum edges connecting them. This lesson guides you through implementing a solution in JavaScript that returns the shortest route length or -1 if no path exists, reinforcing graph traversal concepts and practical coding skills.

We'll cover the following...

Statement

Given a directed graph of n nodes and two vertices, src and dest, return the length of the shortest path between src and dest. The shortest path will contain the minimum number of edges.

If no path exists between src and dest, return -1.

Constraints:

...