Assertion: graph's vertex | /r/HasProperty | obtained via any of its incoming edges
Facets:
Source sentences:
text: For example, it is possible to find shortest paths and longest paths from a given starting vertex in DAGs in linear time by processing the vertices in a topological order, and calculating the path length for each vertex to be the minimum or maximum length obtained via any of its incoming edges.