 　　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。

 　　DFS1(ALGraph *G,int v)：以非递归的方法从顶点v深度优先遍历图G。

 　　BFS(ALGraph *G,int v)：从顶点v广度优先遍历图G。

-　MatToList (MGraph g, ALGraph* &　G): the adjacency matrix adjacency list g into G. 　ListToMat (ALGraph* G, MGraph &　g): the adjacent table adjacency matrix G into g. 　DispMat (MGraph g): output adjacency matrix g. 　DispAdj (ALGraph* G): output adjacency list G. 　DFS (ALGraph* G, int v): to the method of recursive vertex v from the depth-first traversal graph G. 　DFS1 (ALGraph* G, int v): non-recursive method to vertex v from the depth-first traversal graph G. 　BFS (ALGraph* G, int v): vertex v from the breadth-first traversal graph G.