Search⌘ K
AI Features
Home
Courses
Data Structures for Coding Interviews

Solution: Find the Shortest Path between Two Vertices

Explore how to find the shortest path between two vertices in a directed graph by applying the Breadth-First Search algorithm. This lesson helps you understand how to use a queue to efficiently traverse nodes, track distances, and handle cases where no path exists. You'll also gain insight into the time and space complexity of this approach.

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:

  • 0≤0 \leq n ≤100\leq 100
  • 0≤0 \leq Node.data
...