据结构连通图.docVIP

邻接矩阵 邻接矩阵 1 MGraph.h #include iostream using namespace std; const int MaxSize=10; //邻接矩阵存储无向图的类 template class DataType class MGraph { public: MGraph(DataType a[ ], int n, int e ); ~MGraph( ){ }; void DFSTraverse(int v); void BFSTraverse(int v); private: DataType vertex[MaxSize]; int arc[MaxSize][MaxSize]; int visited[MaxSize]; int vertexNum, arcNum; }; //构造函数 template class DataType MGraphDataType :: MGraph(DataType a[ ], int n, int e) { int i,j,k; vertexNum = n; arcNum = e; for (i = 0; i vertexNum; i++) vertex[i] = a[i]; fo