Given a DAG N, if an edge $(U \rightarrow V)$ is added between any existing nodes U and V. Then, by performing DFS from the node $U$ and checking whether there is a cycle or a not, should be sufficient to conclude that this addition of edge didn't violate the acyclic property of the given DAG. Is it correct?
Or there is a need to perform DFS from other nodes in the network to verify the cyclic property of DAG?
Trying to find the most efficient way to verify whether addition of an edge to an existing DAG introduces cycles or not?