“A heap is basically a data structure that allows you to do this very quickly ... Then you want your algorithm to find the fastest paths through any possible graph layout, assuming the worst possible ...