Part 1
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.
Part 2
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 (See Lectures 27-30). 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
Hey, i am a java developer and have been working on java for last two years. I have excellent knowledge of java basic modules like swing, javafx, rpc and jdbc. I have through understanding of datastructures and algorithms. I will do this job for your very efficiently. If you give me an opportunity you will find me with in time and budget. Looking forward for your reply.
Thanks
Warm Regards
Hello
I am Java and Algorithm expert and interested in this project. I have reviewed your requirements and confident to handle this project perfectly.
I also have a lot of experience in helping students with assignments.
Please communicate to discuss further.
Regards
Anshu
hello.
I saw your description .
I'm master in Algorithm.
I understand it and can do it .
I have done several project like this.
I'm an expert in Data Mining, Data Structures and Algorithms.
And I know Java ,C/C++ and Python well.
I'm interested this project.
I want to discuss with you about this project.
If it's possible,please contact me and explain more detail.
I wait your good reply.
Bye.