#include <iostream>
#include <vector>
#include <queue>
#define  MAXW  1000//定义最大权值
using namespace std;
template<class T>
class Graph//无向加权图
{
public:Graph();~Graph();void Create();//生成加权图void DFSTraverse(void (*fun)(T));//深度优先遍历void BFSTraverse(void (*fun)(T));//广度优先遍历int LocateVex(T vex);int  GetVexnum(){return vexnum;}int  GetArcnum(){return arcnum;}int** GetAdjMatrix(){return adjMatrix;}T GetVex(int i){return vexs[i];}
private:vector<T> vexs;//顶点数组int** adjMatrix;//邻接矩阵int arcnum;//弧数int vexnum;//顶点数bool *visited;int FirstAdjVex(int v);//v的第一个邻接点int NextAdjVex(int v,int w);//从w开始找v的下个邻接点void DFS(int i,void (*fun)(T));
};template<class T>
Graph<T>::Graph()
{adjMatrix=NULL;arcnum=0;visited=NULL;
}template<class T>
Graph<T>::~Graph()
{for (int i=0;i<vexnum;i++){delete [] adjMatrix[i];}delete adjMatrix;adjMatrix=0;delete [] visited;
}template<class T>
void Graph<T>::Create()
{cout<<"输入顶点数，弧数（以空格隔开）：";cin>>vexnum;cin>>arcnum;adjMatrix=new int*[vexnum];for(int i=0;i<vexnum;i++)adjMatrix[i]=new int[vexnum];for (int i=0;i<vexnum;i++){for(int j=0;j<vexnum;j++)adjMatrix[i][j]=MAXW;//初始化邻接矩阵
    }visited=new bool[vexnum];cout<<"输入顶点列，以空格隔开：";for (int i=0;i<vexnum;i++){T temp;cin>>temp;vexs.push_back(temp);//输入顶点
        }cout<<"输入一条边依附的顶点及权值（A B 1）:"<<endl;for (int i=0;i<arcnum;i++){T v1,v2;int w;cin>>v1;cin>>v2;cin>>w;int x=LocateVex(v1);int y=LocateVex(v2);adjMatrix[x][y]=w;adjMatrix[y][x]=w;//设置权值
}
}template<class T>
int Graph<T>::LocateVex(T vex)
{for(int i=0;i<vexnum;i++){if (vexs[i]==vex){return i;}}return -1;
}template<class T>
int Graph<T>::FirstAdjVex(int v)
{for (int i=0;i<vexnum;i++){if(adjMatrix[v][i]!=MAXW)return i;}return -1;
}template<class T>
int Graph<T>::NextAdjVex(int v,int w)
{for (int i=w+1;i<vexnum;i++){if(adjMatrix[v][i]!=MAXW)return i;}return -1;
}template<class T>
void Graph<T>::DFS(int i,void (*fun)(T))//从第i个顶点深度优先遍历
{visited[i]=true;fun(vexs[i]);for (int w=FirstAdjVex(i);w>=0;w=NextAdjVex(i,w)){if(!visited[w]) DFS(w,fun);}}template<class T>
void Graph<T>::DFSTraverse(void (*fun)(T))
{for(int i=0;i<vexnum;i++)visited[i]=false;for (int i=0;i<vexnum;i++){if(!visited[i])DFS(i,fun);}
}template<class T>
void Graph<T>::BFSTraverse(void (*fun)(T))
{queue<int>  Q;for(int i=0;i<vexnum;i++)visited[i]=false;visited[0]=true;fun(vexs[0]);Q.push(0);//顶点入队while (!Q.empty()){//int v=Q.back();int v=Q.front();// 出队
        Q.pop();for(int w=FirstAdjVex(v);w>=0;w=NextAdjVex(v,w)){if(!visited[w]){visited[w]=true;fun(vexs[w]);Q.push(w);//访问后顶点入队
                }}}
}