News for hackers. Stuff that matters.
Re:Show HN: Six Degrees of Wikipedia by ryan_j_naughton on Monday February 26, 2018 @04:30PM (#16469149)
It is bidirectional BFS: https://github.com/jwngr/sdow/blob/master/sdow/breadth_first...

A* can't be used given that path cost or expected remaining distance is unknown.

Any ideas on how such an algorithm could be used without precomputing the entire graph?

There are no comments on this comment yet.