181–190 of 354 posts
Parquetry -> Romeo and Juliet, 46 paths ( https://www.sixdegreesofwikipedia.com/?source=Parquetry&targ... ). None through Shakespeare. Parquetry -> Tromeo and Juliet, 508 paths ( https://www.sixdegreesofwikipedia.com/?source=Parquetry&targ... ). All through Shakespeare.
Earlier quoted context omitted.
I had a conversation with a friend a few weeks ago that surely this already exists, and if not that someone should make this. Any plans to filter by mutual paths?
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?
There used to be a live demo on an AT&T Labs website but it is not available now. There are published algorithms for all the phases of the proposed heuristic, but my recollection is that Yehuda found an efficient, robust implementation of k-disjoint-shortest-paths was not easy.
This is an interesting problem, thank you for making your work available. (I do agree the HTML form placeholders that change rapidly but are ignored when you press the GO button are a little confusing; it took me a minute or two to figure out what was going on.)
Earlier quoted context omitted.
'Please' and 'thank you' go a long when requesting additional features for an OSS project.
Come on, this is Show HN! Not some GitHub issue tracker. Try to insert please and thank you in that post ... it will make it sound rude! It will turn it from Show HN feedback to sounding like a feature request, which it is clearly not...
Did I find a bug? https://www.sixdegreesofwikipedia.com/?source=Adolf%20Hitler... It's showing "Bill Gates" and "Mark Zuckerberg" as the hops, but on the start page I don't see links to those. (Apologies for the subject matter. It was the first thing I thought of, because of a Wikipedia-path-finding game I had heard of before.)
It uses a pre-downloaded database of links [1], so presumably certain pages that were once linked have been updated. [1] https://news.ycombinator.com/item?id=16469427
So by default I block all javascript and I got this message: "Sorry internet hipster, this little side project requires JavaScript." These kinds of condescending messages towards people concerned with privacy aren't going to win you any points here.
I would love to see a list compiled somewhere of two articles with exactly 6 degrees of separation. This is proving to be extremely difficult. In the entire HN thread so far, I only see one so far by dkuder https://www.sixdegreesofwikipedia.com/?source=Six%20Degrees%...
Purell_hack has managed a whopping 9°, based off dkuder's Phinney - https://news.ycombinator.com/item?id=16469620
Earlier quoted context omitted.
I had a conversation with a friend a few weeks ago that surely this already exists, and if not that someone should make this. Any plans to filter by mutual paths?
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?
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?