Implement Dijkstra's shortest path algorithm and Vector-distance algorithm. For every node, build a routing table using each algorithm and compare the routing tables.
The program should read the network topology from an input file [url removed, login to view], and then builds a routing table for EVERY node. Please be aware that for a network with N nodes, it may take up to N-1 message exchanges for the vector-distance algorithm to fully propagate the information throughout the network.
In each line of the input file, the first and the second numbers are the node numbers, the third number is the cost of the link between the two nodes.
5 freelancers estão ofertando em média $41 para este trabalho
Hi i can work on this project , i have good experience in c/c++ development so i can help you on your project , please pm me for discussion ..thanks vkoder