Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
its_bbq
on Aug 25, 2024
|
parent
|
context
|
favorite
| on:
Degrees of Kevin Bacon Using Postgres
Yes I meant specifically for Kevin Bacon. There are other all pairs shortest paths algorithms besides running Dijkstra N times
compsciphd
on Aug 25, 2024
[–]
oh that's true, for some reason I was thinking path from A->Bacon. But dijkstra from Bacon->A is just as computational intensive and much more valuable to keep around.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
