Algorithm · Disney · Easy
You are given a graph represented as an adjacency list, along with a starting node and a target node. Decide whether the target can be reached from the starting node by following edges of the graph, and return true if it can and false otherwise. Your implementation is expected to explore the graph with breadth-first search. Examples Example 1 Example 2