All the details are in pdf please read throughout and do perfect
Microsoft Word - netp4.doc 1 PROJECT 4 Centralized Routing Via a Routing Matrix Due Date: Dec. 2, 2021 (100 points) In centralized routing, all the routing information is generated and maintained in a centralized location. A common way of maintaining routing information centrally is via a routing matrix. A routing matrix has a row and a column for each node in the network, where a row corresponds to the source node and a column corresponds to the destination node. The entry in row i column j is a pair (x , y), where x is the first node on the shortest path from i to j, and y is the cost of the shortest path from i to j. Write a program that reads a weighted graph representing a network, and finds and outputs the corresponding routing matrix. The routing matrix will be written both to the screen and to an output file. Use Dijkstra’s algorithm to find the shortest cost and path between nodes. The program runs from the command line with two optional command line arguments. Use the following command line options to indicate the presence of a command line argument: -i (for input file name) and –o (for output file name). If no command line arguments are present, the program uses “xyz_input.txt” and “xyz_output.txt” as default input and output file names respectively. See examples below: Ø java xyz_rmatrix Ø java xyz_rmatrix –o xyz_rmatrixo.txt Ø java xyz_rmatrix –i xyz_rmatrixi.txt –o xyz-rmatrixo.txt Ø java xyz_rmatrix –o xyz_rmatrixo.txt –i xyz-rmatrixi.txt Sample Input/Output: The input file contains zero or more lines representing a graph of a network. Each line represents a bi-directional edge that is made up of two vertices (routers) and the cost associated with the link (communication line) between them. One or more whitespaces (blank, tab, etc.) will separate data on each line and the node names might be a string rather than a single character. Note that the routing matrix rows and columns are listed in alphabetical order. A B 1 A D 2 B C 4 C D 2 C E 2 D E 7 2 Routing matrix A B C D E -------------------------------------------------------------------------------------------------- A | - B,1 D,4 D,2 D,6 B | A,1 - C,4 A,3 C,6 C | D,4 B,4 - D,2 E,2 D | A,2 A,3 C,2 - C,4 E | C,6 C,6 C,2 C,4 - Submission requirements: Please submit the following material to the class website for grading on the due date. - copy all of your files (xyz_rmatrix.java, xyz_input.txt, xyz_output.txt, xyz_Readme.txt, etc.) into a folder named xzy_proj4 and compress that folder. If you develop your code with an IDE (eclipse, etc.), don’t submit any of the folders created by the IDE. - submit the zip file (xyz_proj4.zip) to the class website on ‘canvas.emich.edu’ Note “xyz” represents your first, last, and middle initials. IMPORTANT: There is no late submission for this project. Any project submitted to the class website after the due date (5:29pm Dec. 2rd) will NOT be graded.