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

Solution: Find the Shortest Path between Two Vertices

Explore how to implement the Breadth-First Search algorithm in Go to find the shortest path between two vertices in a directed graph. Understand how to use queues for traversal, track visited nodes, and calculate distances efficiently, while considering time and space complexities.

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