Route Between Nodes

Given a directed graph, design an algorithm to find out whether there is a route between two nodes.

Example:

Graph: A→E, B→C, D→E
find_path(A, E) → True
find_path(A, D) → False

For this problem, the graph is given as an adjacency dictionary.