//网图(带权值)的邻接矩阵
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int INFINIT = 0x3f3f3f3f;
const int MAXVAX = 100;
template<class T>
class MGraph {
private:
T * vertex; //数组,用来存放顶点信息
int ** arc; //二维数组,用来存放邻接矩阵
int vertexNum, arcNum; //顶点数量 边数
public:
MGraph(T v[], int n, int e);
~MGraph();
void display();
void BFS(int i,int * visited);
void BFSTraverse(int * visited);
};
template<class T>
void MGraph<T>::BFS(int i,int * visited){
queue<int> q;
visited[i] = 1;
q.push(i);
while(!q.empty()){
int temp = q.front();
cout<<vertex[temp]<<