Assertion: algorithm's time | /r/CapableOf | decrease key
Facets:
Source sentences:
text: If we use a Fibonacci heap to implement the open list instead of a binary heap/self-balancing tree, then the performance will become better (as Fibonacci heap takes O(1) average time to insert into open list and to decrease key)