用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.

用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.

 MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。  ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。  DispMat(MGraph g)：输出邻接矩阵g。  DispAdj(ALGraph *G)：输出邻接表G。  DFS(ALGraph *G,int v)：以递归的方法从顶点v深度优先遍历图G。 =

DFS算法的非递归函数。DFS是求树的深度的深度优先算法-DFS algorithm of non-recursive function. DFS is seeking the depth of the tree depth-first algorithm