Java algorithms and graphs - simple road trip game
Budget: $10 – $30 CAD
Consider the following two player "Road Trip" Game:
player 1 starts with a word w1 (typically country or city); player 2 then names a new word w2 that starts with the last letter of w1. Player 1 then names a new word w3 that starts with the last letter of w2, and so on.
For example, this game might play out as "dortmund", "dominican republic", "canada", "ajax".
Read in the input one line at a time, and output the fewest number of turns it might take for such a game that starts at line 1, ends at line n (where n is the total number of lines in the file) using only lines of the file as the possible words in between. If there is no way to play to get to the last line from the first line, output 0.
For example, the input "dortmund", "bermuda", "canada", "paris", "dominican republic", "ajax" would return 4 ("dortmund" -> "dominican republic" -> "canada" -> "ajax"), whereas the input "dortmund", "bermuda", "canada", "dominican republic", "ajax", "paris" would return 0 since there is no way of playing to get from the first line to the last line, and you want to return the fewest number of turns that do so. Each turn must use a line that is not used on any previous turn, You may assume that each line has at least one character on it, and case matters (so, you do not need to do any fancy changing of letters from upper to lower case or vice-versa.)
Source code files are attached, you only need to modify the RoadTripGame.java file and the others can be left untouched.
player 1 starts with a word w1 (typically country or city); player 2 then names a new word w2 that starts with the last letter of w1. Player 1 then names a new word w3 that starts with the last letter of w2, and so on.
For example, this game might play out as "dortmund", "dominican republic", "canada", "ajax".
Read in the input one line at a time, and output the fewest number of turns it might take for such a game that starts at line 1, ends at line n (where n is the total number of lines in the file) using only lines of the file as the possible words in between. If there is no way to play to get to the last line from the first line, output 0.
For example, the input "dortmund", "bermuda", "canada", "paris", "dominican republic", "ajax" would return 4 ("dortmund" -> "dominican republic" -> "canada" -> "ajax"), whereas the input "dortmund", "bermuda", "canada", "dominican republic", "ajax", "paris" would return 0 since there is no way of playing to get from the first line to the last line, and you want to return the fewest number of turns that do so. Each turn must use a line that is not used on any previous turn, You may assume that each line has at least one character on it, and case matters (so, you do not need to do any fancy changing of letters from upper to lower case or vice-versa.)
Source code files are attached, you only need to modify the RoadTripGame.java file and the others can be left untouched.