Assertion: optimization problem | /r/HasProperty | find path
Facets:
value: to v
type: LOCATION
value: from u
type: OTHER
Source sentences:
text: For example, if there is a graph G which contains vertices u and v, an optimization problem might be "find a path from u to v that uses the fewest edges".