Java Program
E-cisco
hey.rtfNOTE: Attached is a "nearly" complete version if the solution, missing only the path finding code itself. There is only one method that you need to fill in, so please read the comments. (Also note that it's a Netbeans Project; Eclipse As you may expect, this will involve graphs (with a twist); but of course, there will be some problem solving involved as well. Instructions Imagine a “dungeon game” where all the rooms are laid out in a perfect grid within a square environment. Each room has a creature posing some degree of danger ranging from 0 (harmless) to 9 (avoidance would be prudent). The object is to find a path through the dungeon from start to end which minimizes the overall amount of danger. Each room, unless at a boundary, only has exists in the up, down, left, right directions (no diagonals). The entrance is at the upper-left (0,0) and the exit is at the lower right (n-1, n-1). List all of the “rooms” which must be traversed, in the form of a path of room coordinates, from the start to finish. 00
70
20
50
40
10
50
10
20
10
10
20
20
10
10
10
90
50
30
50
10
10
90
10
00
Example input file: 00 70 20 50 40 10 50 10 20 10 10 20 20 10 10 10 90 50 30 50 10 10 90 10 00 Example output: (0,0) (1,0) (2,0) (2,1) (2,2) (2,3) (3,3) (4,3) (4,4) Total danger = 110 Input The input file will consist of 100 rows of 100 digits, 00-99. (Yes, 10,000 is be a lot of rooms, Output The program should write the output to a file (in the format illustrated above, including the "total danger" output). Submit As always, your program should accept a "command line" filename, indicating the file to be read and include a proper "package structure" The source code for your program. You code should be readily compilable and runnable "as-is". IMPORTANT: Your program should accept an input file-name and an output file-name from the "command line".
