3 ms·
Haha. So given the graph of all article links, maybe you should figure out the articles with the longest shortest paths (shortest paths that are the longest) fr
by makmanalp 16y ago
Haha. So given the graph of all article links, maybe you should figure out the articles with the longest shortest paths (shortest paths that are the longest) from hitler. Or maybe to make it funnier you can find the longest path between any article and hitler.
- kerkeslager 16y agoFinding the longest path is computationally impossible.
- zck 16y agoThere are two ways to do it: the first is to consider the "longest shortest path", as makmanalp said, and find the longest path among the set of shortest paths from an article to Hitler. The second is to not travel to any node twice in a given path.
- deleted 16y ago[deleted]
- nostromo 16y agoI'm pretty sure he meant the article with the longest optimal path.
- tomjen3 16y agoThere is no defined longest path, since the graph has a ton of loops. Finding the longest shortest path (that is finding the minimum number of nodes from each wikipedia entry to the entry for Hitler) and then finding the longest is, however, rather easy.