top | item 41347717 (no title) its_bbq | 1 year ago Yes I meant specifically for Kevin Bacon. There are other all pairs shortest paths algorithms besides running Dijkstra N times discuss order hn newest compsciphd|1 year ago 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.
compsciphd|1 year ago 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.
compsciphd|1 year ago