For a given directed acyclic graph G, how can I best create a list of all new edges which would keep the graph acyclic?
I have a directed acyclic graph G
. I want to generate some data structure which would tell me which new given edges (u,v)
would be allowed while keeping the graph acyclic.