You are required to implement Dijkstra's Single Source Shortest Path (ssp) algorithm for undirected graphs using Fibonacci heaps. You must use the adjacency list representation for graphs.
You are required to implement a routing scheme (routing) for a network. Each router has an IP
address and packets are forwarded to the next hop router by longest prefix matching using a binary trie. For each router R in the network, call ssp implemented in Part 1 to obtain shortest path from R to each destination router Y. To construct the router table for R, for each destination Y, examine the shortest path from R to Y and determine the router Z just after R on this path. This gives you a set of pairs <IP address of Y, next-hop router Z>. Insert these pairs into a
binary trie. Finally, do a postorder traversal, removing subtries in which the next hop is the same for all destinations. Thus, multiple destinations having a prefix match and the same next hop will be grouped together in the trie.
2. Input/Output Requirements
You may implement this assignment in Java or C++. Your program must be compilable and runable on the Thunder CISE server using gcc/g++ or standard JDK. You may access the server using Telnet or SSH client on thunder.cise.ufl.edu.
You must write a makefile document which creates two executables. The names of your executables must be ssp and routing.
14 freelancers are bidding on average $72 for this job
Hi I have implemented both fibonacci heaps, red black trees and AVL trees all using JAVA as well as graph traversal algorithms inclusing shortest paths. I can do this for you to your satisfaction.