without Redundant Edges
Given an acyclic graph, produce a subgraph that excludes any edges for which there is another path connecting those edges in the original graph.
Return
A reduced copy of this graph.
Parameters
spanning Dag
The spanning directed acyclic graph to structure.