Introduction - If you have any usage issues, please Google them yourself
1, create an undirected graph adjacency matrix storage vertex edges using adjacency matrix representation with a single character 2, the output of the storage schematic 3, depth-first and breadth-first traversal of the graph and output traversal results.