All Ancestors of a Node in a Directed Acyclic Graph - Leetcode 2192 - Java

Problem Description
Program to find all the ancestors of the nodes in the directed acyclic graph (DAG) by running a depth-first search(DFS) solution on each node.
In the next part, we will use Topological sorting.
Problem: leetcode.com/problems/all-anc...
Code link: k5kc.com/cs/algorithms/all-an...