dag
A subgraph of an acyclic graph that excludes any edges for which there is another path connecting those edges in the original graph.
A subgraph of an acyclic graph that excludes any edges for which there is another path connecting those edges in the original graph.