simple java program

Project Budget

$10 - $15 USD

Completed In

1 day

Total Bids

21

Project Description

Write a Java program [url removed, login to view] that reads the input graph as a text file, and finds the Minimum Spanning Tree rooted at the node specified as a run time argument, as specified in the attached file. Your program should be invoked as

java ShortestPathFinderApp input-file root-node

where input-file is the name of a text-file that contains the weighted adjacency list and root-node is the starting point to the shortest path algorithm. Your program should compute the shortest path, and print the routing table of the root node represented as a three column table as follows:

Node Cost Next-Hop

where Node column is the set of destination nodes, Cost column is the total cost to reach those nodes, and the Next-Hop column is the next node to forward packets in order to reach that node.