Dijkstra's shortest path algorithm and Vector-distance algorithm

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 [login to view URL], 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.