Assertion: graph's orientation | /r/CapableOf | lie along shortest paths
Facets:
value: to v.
type: LOCATION
value: from other vertices
type: LOCATION
Source sentences:
text: To find such a representation, create a 2-satisfiability instance in which each variable describes the orientation of one of the edges in the graph (an assignment of a direction to the edge causing the graph to become directed rather than undirected) and each constraint allows two edges to share a pair of orientations only when there exists a vertex v such that both orientations lie along shortest paths from other vertices to v.