Assertion: algorithm | /r/HasProperty | suitable
Facets:
value: particularly
type: DEGREE
value: for graphs
type: PURPOSE
value: for the purpose of pathfinding
type: PURPOSE
value: largely
type: DEGREE
Source sentences:
text: However, since for many practical purposes there will never be a negative edgeweight, Dijkstra's algorithm is largely suitable for the purpose of pathfinding.
text: The algorithm is believed to work well on random sparse graphs and is particularly suitable for graphs that contain negative-weight edges.