Solution: Bus Routes
Explore how to solve the bus routes problem by applying breadth-first search on an adjacency list mapping stations to bus routes. Understand how to efficiently find the shortest path in terms of bus transfers from a source to a destination station, while managing visited routes to avoid redundant traversals.
We'll cover the following...
We'll cover the following...
Statement
You are given an array, routes, representing bus routes where routes[i] is a bus route that the bus repeats forever. Every route contains one or more stations. You have also been given the source station, src, and a destination station, des. Return the minimum number of buses someone must take to travel from src to dest, or return -1 if there is no route.
Constraints:
-
routes.length