Today, we talked about Binomial Heap and why it takes an amortized running time of O(log n) for the deletion and O(1) for all the other operations. We also (try to) motivate Fibonacci Heap which also support decrease_key in O(1) time.
If you are confused by the Dijkstra's algorithm I described in the end, take a look at the wiki description.
Professor, did you mean to put a link in the post? There is not one.
ReplyDeletethere is a link on the word wiki.
DeleteThis comment has been removed by the author.
ReplyDelete