利用邻接矩阵的图广度优先遍历算法, 利用子指针数组的普通树前根遍历算法

利用邻接矩阵的图广度优先遍历算法, 利用子指针数组的普通树前根遍历算法-The use of adjacency matrix of the graph breadth-first traversal algorithm, using sub-array pointer before the root of the general tree traversal algorithm