Heaps are the the most elegant data structure, IMO. So many ways to prioritize. ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

pcvarmint on July 6, 2014 | parent | context | favorite | on: Dijkstra’s algorithm and the Fibonacci heap

Heaps are the the most elegant data structure, IMO.

So many ways to prioritize. So many ways to support the same basic operations, with different tradeoffs.

My semi-outdated site: http://leekillough.com/heaps/

amitp on July 6, 2014 [–]

I love that page! I link to it from my own semi-outdated page: http://theory.stanford.edu/~amitp/GameProgramming/Implementa...

shanusmagnus on July 6, 2014 | [–]

I in turn love your page -- so useful how you show all the data structures working together to enable a larger task. Bookmarked.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact