Assertion: algorithm | /r/CapableOf | select the closest vertex
Facets:
value: to greedily
type: PURPOSE
Source sentences:
text: However, Dijkstra's algorithm uses a priority queue to greedily select the closest vertex that has not yet been processed, and performs this relaxation process on all of its outgoing edges; by contrast, the Bellman–Ford algorithm simply relaxes all the edges, and does