algorithms ...... !!!

LAN Shortcut System builds the routing tables for the nodes in a computer network, based on shortest-path routing from an any node to all other nodes, where path distance is measured by hop weight, that is, the total weight of edges in a path. The input for this problem is a text file that holds the connectivity information for all the nodes in the network, as in the following example:

241.12.31.14: 241.12.31.15 241.12.31.18 241.12.31.19

Which indicates three network nodes that are connected to 241.12.31.14, that is, three nodes that are one hop away. Edge weight is given by the absolute value of difference between destination and source in last segment of node address. So that, the edge weight between 241.12.31.14 and first node in the example above is 1. The routing table for the node at address A is a set of pairs (B, C), which indicates that, to route a message from A to B, the next node to send to (on the shortest path from A to B) is C. Your program should output the routing table for each node in the network, given an input list of node connectivity lists, each of which is input in the syntax as shown above, one per line.

Requirements:

1. Design two algorithms with two different techniques to solve the given problem

2. Analyze and compare both algorithms

3. Implement the algorithms by using C++/java

4. Test your programs on (same for both algorithms) randomly generated test connected graphs of 50, 100, 150, 200 and 250 vertices

a. For each type of graph generate 20 different random problem sets and report your results in a table (Containing obtained solutions and Computational time)

b. Represent the measurements of the Algorithms in a single table then on a single graph

5. Present this work in a clear and well-organized report

6. Prepare a short video to present your work (10 min maximum)

Documentation:

Write a report with 5 sections. First section includes proposed algorithms pseudocode and their analysis. Second section presents source code of each algorithm. Third section shows screen shots of the output on each tested graph, results tables and measurements. Fourth section is the conclusion that summarizes what you do to complete this the project, what the benefits you gain, and your suggestions of other optimization problems can use this algorithm as a solution. In last section, list all references and helps you used in completing this project even tools and libraries.