Re:Degrees of Kevin Bacon Using Postgres
by compsciphd on Sunday August 25, 2024 @09:13AM
(#41347058)
Eh? you have a full graph of one node to every other node. not shortest path between every pair (which I assume is what a full kevin bacon database would be).
[ Parent
| on HN ]
Yes I meant specifically for Kevin Bacon. There are other all pairs shortest paths algorithms besides running Dijkstra N times
Re:Degrees of Kevin Bacon Using Postgres
by compsciphd on Sunday August 25, 2024 @02:36PM
(#41349943)
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.
But there's only one Kevin Bacon.
I mean there's also Erdos, but that's a different story.