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

Solution: Find the Shortest Path between Two Vertices

Understand how to implement the Breadth-First Search algorithm to find the shortest path between two vertices in a directed graph. This lesson teaches you to use a queue and track visited nodes and distances, helping you solve graph traversal problems efficiently during coding interviews.

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
...