The program first read the input file to create node link list with name of nodes and count the number of nodes. Then it reread the input file to form the adjacency matrix of the graph. It has functions of creating, adding, deleting link list, as well as finding shortest path and printing result. It can point out if there is any disconnected graph form the source node and can print out an alternative shortest path of a node. However, the shortcoming of the program is that it can only point out one alternative shortest path of the nodes. If there are many shortest paths of a node, the program might not point out all of them.

README.txt
__MACOSX
........\._README.txt
ShortestPath.c
__MACOSX\._ShortestPath.c
testdata.txt
__MACOSX\._testdata.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．