1059. All Paths from Source Lead to Destination

Given a directed graph represented as an adjacency list, a source vertex source, and a destination vertex destination, determine if all paths starting from source eventually lead to destination.

In other words, starting from source, follow any path of edges - is it guaranteed that you will eventually reach destination?

Examples
Input: [3,[[0,1],[0,2]],0,2]
Output: false
Hints
Related Problems

1059. All Paths from Source Lead to Destination

Given a directed graph represented as an adjacency list, a source vertex `source`, and a destination vertex `destination`, determine if all paths starting from `source` eventually lead to `destination`.