编写程序以邻接矩阵或邻接表的方式存储指定连通图。然后分别用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。-Write a program to the adjacency matrix or adjacency list stored in a manner specified connected. Then were used to depth-first traversal algorithm and the breadth-first algorithm stor