Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
icambron
on July 6, 2014
|
parent
|
context
|
favorite
| on:
Dijkstra’s algorithm and the Fibonacci heap
I like "Fancy algorithms are slow when n is small, and n is usually small." -Rob Pike
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
