Fibonacci Heap Famous as the data structure that achieved optimum runtime in Djikstra’s algorithm. In practice it isn’t often used because simpler heaps outper

Fibonacci Heap Famous as the data structure that achieved optimum runtime in Djikstra’s algorithm. In practice it isn’t often used because simpler heaps outperform it except in very specific circumstances. https://en.wikipedia.org/wiki/Fibonacci_heap https://en.wikipedia.org/wiki/Fibonacci_heap Soft heap As far as I know this hasn’t really been implemented. It’s used for the best known minimum spanning tree algorithm. Pretty crazy. https://en.wikipedia.org/wiki/Soft_heap https://en.wikipedia.org/wiki/Soft_heap