Introduction - If you have any usage issues, please Google them yourself
1, in a text file format according to certain data stored in Figure 2, read from the file of the information, and construct two storage mode 3, the output two storage methods, and converted to see the results of the correct 4 in the adjacency list graph traversal based on the operation of 5, prepared for the minimal spanning tree algorithm, and validated 6, the preparation of the shortest path algorithm, and validate the input graph