用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results

对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac

此程序主要是实现图的深度优先遍历和广度优先遍历。-The procedure is to achieve the figure of the depth-first traversal and breadth-first traversal.

图运算 在邻接矩阵存储结构上实现图的深度和广度优先遍历算法-Figure computing adjacency matrix storage structure diagram of the depth and breadth-first traversal algorithm