73.1相邻矩阵 Indegree new int Vertex Mark= new intnumVertex for (int i=0;i< numVertex; i++)i Marki=UNVISItED ∥|标志位设为 UNVISITED Indegree=0 ∥入度设为0 Grapho i 析构函数 delete l Mark; 释放Mark数组 delete d Indegree ∥释放 Indegree a数组 int VerticesNumo i ∥返回图中顶点的个数 return numVertex; bool Is edge(edge one edge)i ∥ one edge是否是边 if (one Edge weight >0&& one edge weight INFINITY & one edge to >=0) return true else return false; “十一五”国家缀规划教材。张铭,王腾蛟,赵海￡,《飙据结构与算法》,高教社,B0.6。“十一五”国家级规划教材。张铭，王腾蛟，赵海燕，《数据结构与算法》，高教社，2008. 6。 7.3.1 相邻矩阵 Indegree = new int[numVertex]; Mark = new int[numVertex]; for (int i = 0; i < numVertex; i++) { Mark[i] = UNVISITED; // 标志位设为UNVISITED Indegree[i] = 0; // 入度设为0 } } ~Graph() { // 析构函数 delete [] Mark; // 释放Mark数组 delete [] Indegree; // 释放Indegree数组 } int VerticesNum() { // 返回图中顶点的个数 return numVertex; } bool IsEdge(Edge oneEdge) { // oneEdge是否是边 if (oneEdge.weight > 0 && oneEdge.weight < INFINITY && oneEdge.to >= 0) return true; else return false; } };