Reachability Between Locations | Dataford Interview Questions

Create a canReach(src, dst) function to determine connectivity between locations in Snabbit.

Implement the function for a directed location graph represented by an adjacency-list dictionary. Use the supplied graph, source location, and destination location to return True if any directed path exists from src to dst, otherwise return False. The graph may contain cycles, missing destination keys, and a source equal to the destination.

Signature: def canReach(graph, src, dst):

graph maps each location to a list of directly reachable locations.

Constraints

1 <= number of locations <= 10^4
0 <= number of directed connections <= 5 * 10^4
Location identifiers are hashable values
The graph is directed
A location may be absent from the adjacency-list dictionary

Function Signature

def canReach(graph, src, dst):

Your question is Reachability Between Locations. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem