Assertion: algorithm | /r/CapableOf | cut down on the size of the subgraph
Facets:
Source sentences:
text: The A* algorithm is a generalization of Dijkstra's algorithm that cuts down on the size of the subgraph that must be explored, if additional information is available that provides a lower bound on the "distance" to the target.