有向图/无向图的建立及相应的邻接矩阵的输出，并进行深度/广度优先遍历结点再输出结果-Directed graph/no corresponding to the diagrams of the adjacency matrix of the output, and depth/breadth-first traversal and then the output node