鄰接矩陣實(shí)現(xiàn)圖

#include<iostream>usingnamespaceconstintMAXVERTEX=256;//最大結(jié)點(diǎn)數(shù)constintMAX=65536;//假設(shè)最大權(quán)值template<classT>classMGraph{MGraph(Ta[],intn,inte);voidDFS(intv);voidBFS(intintvNum,anum;//頂點(diǎn)數(shù)，邊數(shù)Tvertex[MAXVERTEX];//頂點(diǎn)}template<classT>MGraph<T>::MGraph(Ta[],intn,inte){inti,j,k,weight;for(i=0;i<n;i++)vertex[i]=a[i];{}}template<classvoidMGraph<T>::DFS(int{for(intj=0;j<vNum;if(arc[v][j]!=MAX&&!dvisited[j]) //j開始深度遍歷}template<classvoidMGraph<T>::BFS(int{};//Tintf=0,r=0;//初始化隊(duì)列{v=queue[++f]; forintj=0;j<vNumj++)if(arc[v][j]!=MAX&&{}}}voidprim(MGraph<T>{intadjvex[MAXVERTEX];//U頂點(diǎn)下標(biāo)intlowcost[g.vNum];//u->v-u最小權(quán)值邊intk;//輔助數(shù)組所有到的V0for(int lowcost[i]=}lowcost[0] //forinti=1;i<g.vNum //n-1{intmin=for(int{{min=lowcost[i];k=i;} lowcost[k]=0; for(int {if &&0<{lowcost[j]=g.arc[k][j];adjvex[j]=k;}}}}voidkrus(MGraph<T>{struct{//// intk=0,i,j; for(i=0;i<g.vNum;i++) for(j=i;j<g.vNum;j++){EdgeList[k].fromV=i; =j;EdgeList[k].weight=g.arc[i][j];}for //forif{}

VEdget=EdgeList[i];EdgeList[i]=EdgeList[j];EdgeList[j]=t;{ints2=EdgeList[j].endV;intw=vset[s2];{}}

intFindMin(intDisk[],boolS[],int //{intintk=0,min=MAX;for(int{{}}return-1;returnk;voidShortPath(MGraph<T>&G,int //v{boolintPath[MAXVERTEX];//i的前一個頂點(diǎn)intDisk[G.anum];//i的路徑長度for(inti=0;i<G.vNum;i++){}

for(int{for(int{if(!S[j]&&{}}}for(int{intpre=Path[i];{}}int{intMGraph<int>