Given a directed graph of n nodes labeled from $0$ to n $- 1$, represented by a $2$D array edges where each edges[i] = [a_i, b_i] denotes a directed edge from node a_i to node b_i, along with two nodes source and destination, determine whether all paths starting from source eventually terminate at destination.

All paths starting from source lead to destination if and only if:

• At least one path starts from source.

• Every path starting from source ends at destination.

• The node destination has no outgoing edges.

• There is no cycle reachable from source that allows an infinite path.

Return true if all paths starting from source lead to destination, or false otherwise.

Constraints:

• $1 \leq$ n $\leq 10^4$

• $0 \leq$ edges.length $\leq 10^4$

• edges[i].length $= 2$

• $0 \leq$ a_i, b_i $\leq$ n $- 1$

• $0 \leq$ source $\leq$ n $- 1$

• $0 \leq$ destination $\leq$ n $- 1$

• The given graph may have self loops and parallel edges.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.