Introduction - If you have any usage issues, please Google them yourself
1. Define the graph class Graph_Matrix which is stored by the adjacency matrix.
2. The experiment verifies the correctness of the following algorithms, various functions and indicators.
1) create a graph of adjacency matrix storage.
2) return map refers to the weight of dingbian;
3) find the first adjacency vertex of a vertex in a graph, and the next vertex sequence number of one vertex on another vertex;
3, 4) the depth first traversal of the graph;
5) prim algorithm for minimum spanning tree based on. [selected]