Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nilkn
on July 7, 2014
|
parent
|
context
|
favorite
| on:
Dijkstra’s algorithm and the Fibonacci heap
I'm not familiar with this calculus of data structures, but I'd surmise it's because L(a) = 1 + a L(a) implies that (1 - a) L(a) = 1.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
