Assertion: graph's vertex | /r/CapableOf | exist path
Facets:
value: from recognizable
type: OTHER
Source sentences:
text: A vertex y is said to be reachable from a vertex x if there exists a path from x to y . recognizable
text: In general, this ordering is not unique; a DAG has a unique topological ordering if and only if it has a directed path containing all the vertices, in which case the ordering is the same as the order in which the vertices appear in the path.
text: A vertex v of a directed graph is said to be reachable from another vertex u when there exists a path that starts at u and ends at v.
text: We say that one vertex is connected to another if there exists a path that contains both of them.