Assertion: graph's g | /r/HasProperty | dag
Facets:
Source sentences:
text: If G is a DAG, its transitive closure is the graph with the most edges that represents the same reachability relation.