Leetcode 1059. All Paths from Source Lead to Destination

Given a directed graph and nodes source and destination, determine whether every possible path starting from source eventually ends at destination — i.e., no path terminates at a different node or gets stuck in a cycle. Ensure destination is a sink (no outgoing edges) and that all reachable paths from source lead to it.