Comment on Degrees of Kevin Bacon Using PostgresparentComments−its_bbq2yYes I meant specifically for Kevin Bacon. There are other all pairs shortest paths algorithms besides running Dijkstra N times−compsciphd2yoh 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.
Comments
Yes I meant specifically for Kevin Bacon. There are other all pairs shortest paths algorithms besides running Dijkstra N times
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.