练习6.1 邻接矩阵存储图的深度优先遍历 (20分) 代码: void DFS( MGraph Graph, Vertex V, void (*Visit)(Vertex) ) { Visited[V] = true; (*Visit)(V); int i = V, j = 0; for (j = 0; j < Graph->Nv; j++)//有可能都连在了一个点上,所以用Nv { if (Graph->G[i][j] == 1 && Visited[j] == false) DFS(Graph, j, Visit); } }