This method takes an acyclic graph as input and returns a list of graphs each of which is a modification of the
original graph with either an edge deleted, added or reversed.
This method takes an acyclic graph as input and returns a list of graphs each of which is a modification of the
original graph with either an edge deleted, added or reversed. Edges are not added or reversed if a cycle would
result.