Redundant Connection in a Directed Graph
You are given a directed graph that started as a rooted tree with n nodes (values 1 to n), where one additional directed edge was added. A rooted tree is a directed graph where exactly one node (the root) has no parents, and all other nodes have exactly one parent and are descendants of the root. The graph is represented as a 2D array
edges where edges[i] = [u, v] indicates a directed edge from u to v. Your task is to find and return an edge that can be removed so that the resulting graph is a valid rooted tree of n nodes. If there are multiple possible answers, return the one that appears last in the input array.JavaDSUGraphDFS
00