Assertion: graph's edge | /r/CapableOf | represent same reachability relation
Facets:
value: as g.
type: OTHER
Source sentences:
text: If G is a DAG, its transitive closure is the graph with the most edges that represents the same reachability relation.
text: The transitive reduction of a DAG G is the graph with the fewest edges that represents the same reachability relation as G.