介绍了图的C++基本操作，建立，遍历，两种遍历方法，采用邻接矩阵建立图

1. 掌握图的基本存储方法； 2. 掌握有关图的操作算法并用高级语言实现； 3. 熟练掌握图的两种搜索路径的遍历方法。-1. To master plan the basic storage methods 2. Information on the plans and the operation of algorithms to achieve high-level language 3. The master plan of the traverse path of the

实现任意对角对称矩阵的压缩存储，可以便于树与图的存储，遍历等操作。-Any symmetric matrix diagonal compression and storage, easy tree storage traversal and other operations.

实现图的基本操作，实现广度优先遍历和深度优先遍历 。-Realize the basic operation of figure, the realization of breadth-first traversal and depth-first traversal.