建立无向图的邻接矩阵存储；对已经建立的无向图进行深度优先和广度优先遍历操作。建立有向图的邻接表存储；对已经建立的有向图进行深度优先和广度优先遍历操作。

-Establishment of the adjacency matrix storage　on the already established undirected graph depth first and breadth-first traversal operation. Establish a table to store the adjacency　have already established the graph depth first and breadth-first traversal operation.