Return to Question

replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/

edited Apr 13, 2017 at 12:40

(See also http://codereview.stackexchange.com/questions/131341/finding-shortest-paths-in-a-wikipedia-article-graph-using-java-second-attempt. https://codereview.stackexchange.com/questions/131341/finding-shortest-paths-in-a-wikipedia-article-graph-using-java-second-attempt.)

(See also http://codereview.stackexchange.com/questions/131341/finding-shortest-paths-in-a-wikipedia-article-graph-using-java-second-attempt.)

(See also https://codereview.stackexchange.com/questions/131341/finding-shortest-paths-in-a-wikipedia-article-graph-using-java-second-attempt.)

deleted 60 characters in body; edited tags

Source Link

edited Dec 5, 2016 at 21:32

Jamal

edited Dec 5, 2016 at 21:32

Jamal

35.2k
13
134
238

I have this sort of a web crawler that asks for two (English) Wikipedia article titles (the source and the target), and proceeds to compute the shortest path between the two. My code is as follows:

Any critique is much appreciated!

I have this sort of a web crawler that asks for two (English) Wikipedia article titles (the source and the target), and proceeds to compute the shortest path between the two. My code is as follows:

Any critique is much appreciated!

I have this sort of a web crawler that asks for two (English) Wikipedia article titles (the source and the target), and proceeds to compute the shortest path between the two: