Swapped the Fibonacci heap for a standard array-based binary heap. Also added my own creation, an intrusive list-based binary heap which has been tested fairly well to confirm its' proper function. The IBH outperforms the BH for very large numbers of nodes (>1000000) and doesn't perform too much more slowly for small numbers of nodes. With further optimization of the IBH branch logic it may be possible to make it strictly better than the BH.