利用邻接矩阵或邻接表存储一张图，分别采用图的深度优先搜索和广度优先搜索遍历该图，并输出遍历结果-Using the adjacency matrix or adjacency list storage a picture, using depth-first search and the breadth first search traversal of the graph, and the output traversal results

c语言广度优先搜索算法的实现，输入几个节点，生成树，然后经广度优先搜索算法输出-c language breadth-first search algorithm, enter the number of nodes, spanning tree, and then by the breadth-first search algorithm output

to implement breadth first search and depth first searh