Assertion: best search | /r/CapableOf | find path
Facets:
value: compared to dijkstra’s algorithm
type: OTHER
Source sentences:
text: It shows that Greedy Best-First-Search can find paths very quickly compared to Dijkstra’s Algorithm: However, both of these examples illustrate the simplest case―when the map has no obstacles, and the shortest path really is a straight line.