Title:
Network-node-shortest-path
Download
Description: This code implements the network nodes being the shortest path calculation, and output of each network node routing table, routing table, including: the destination network, the next hop, the cost, full address. The principle of this code is Dijstra algorithm. There are comments in the code test cases, users only need to run test after test cases can be copied to the DOS black borders. Test use cases in detail to explain.
To Search:
File list (Check if you may need any files):
Network node shortest path.c
