Assertion: graph's path | /r/AtLocation | graph
Facets:
Source sentences:
text: Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete.