Today, we finished the Fibonacci heap and proved that it has O(1) amortized cost for insertion, merge, find_min, decrease_key. The only expensive work is delete_min which takes O(log n).
As an application, we show how to use Fibonacci heap in Prim's algorithm for Minimum Spanning Tree.
No comments:
Post a Comment