Solve a graph-based problem using breadth-first search (BFS) or depth-first search (DFS) to find the shortest path under specific constraints.
