Assertion: priority queue | /r/CapableOf | implement dijkstra's algorithm
Facets:
Source sentences:
text: When the graph is stored in the form of adjacency list or matrix, priority queue can be used to extract minimum efficiently when implementing Dijkstra's algorithm, although one also needs the ability to alter the priority of a particular vertex in the priority queue efficiently.