Introduction - If you have any usage issues, please Google them yourself
(1) keyboard input data, the establishment of a directed graph adjacency list. (2) the output of the adjacent table. (3) the establishment of an undirected graph Cross Chain. (4) to the adjacent table based on the calculation of each vertex of the degree, and outputs. (5) The adjacent table stores the depth-first traversal of undirected graph. . (6) adjacent table storage undirected graph breadth-first traversal. (7) to the adjacent table based to achieve adjacency matrix storage and output topological sorting sequence (8) PRIM algorithm undirected minimum spanning tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.