News for hackers. Stuff that matters.

A comment on Show HN: Six Degrees of Wikipedia. Parent comment

Re:Show HN: Six Degrees of Wikipedia by jwngr on Monday February 26, 2018 @04:17PM (#16469045)
I'm definitely not the first to think of it or build a tool for it (lots of similar projects gave me inspiration), but I think I'm the first to make it really fast and with a nice usable UI. And to actually open source the code so others can build it themselves.

Can you tell me more about what you mean by filtering by mutual paths?

[ Parent | on HN ]
Re:Show HN: Six Degrees of Wikipedia by vanderZwan on Monday February 26, 2018 @05:48PM (#16469690)
> Can you tell me more about what you mean by filtering by mutual paths?

I should have said mutual connections, my apologies. So if article A connects to B and article B also connects to A. I suppose you could do this mostly client-side, all you need is two searches (one the reverse of the other) and an intersection of the resulting graphs, no?

[ Parent | on HN ]
Re:Show HN: Six Degrees of Wikipedia by stirner on Monday February 26, 2018 @04:46PM (#16469252)
I implemented this pretty naively a while back [1]. I was interested in how yours was so fast. I expected some sort of complex heuristic; cool to see that your solution is straightforward!

[1] https://github.com/wwalexander/wikipath

[ Parent | on HN ]
Re:Show HN: Six Degrees of Wikipedia by kozziollek on Monday February 26, 2018 @05:39PM (#16469644)
I think GP wanted to find paths in both directions: X -> A -> B -> Y and Y -> C -> D -> X. Possibly where A = D and B = C.
[ Parent | on HN ]