分别以邻接表、邻接矩阵为存储结构，实现图的深度优先和广度优先遍历，分别输出每种遍历下的节点访问序列。-Respectively adjacent table, the adjacency matrix for the storage structure, to achieve depth-first and breadth-first traversal, respectively, each output node access under traversal sequence.