图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。

遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms, it is necessary to master the graph depth-first traversal