图的最小生成树和最短路径.docVIP

. . 采用图的邻接矩阵方式查找图的最小生成树和最短路径的完整程序代码： #include iostream #include vector #include set #include map #include string #include functional #include numeric #include algorithm #include math.h using namespace std; #define MAXNUM 26 #define MAXVALUE 32767 //矩?阵¨?领￠¨?接¨?图a?的ì?定?§义°? typedef struct { char Vertex[MAXNUM]; //vertex int Edges[MAXNUM][MAXNUM]; //edge int Istrave[MAXNUM]; //flag int Vertex_num; //number of vertex int Edges_num; //number of edges int Glaphtype; //0:no direction; 1:direction }Maxtrixgraph; //创???建?§矩?阵¨?领￠¨?接¨?矩?阵¨? void Creatmatrixgraph(Maxtrixgraph *G) { int i,j,k,weight; char start,end; coutplease input the all vertex information:endl; for(i=0;iG-Vertex_num;i++) { coutthe i+1 vertex:; cinG-Vertex[i]; } coutendlplease input the edges and value:endl; for(k=0;kG-Edges_num;k++) { coutthe k+1 edge:; cinstartendweight; i=0; j=0; while(G-Vertex[i] != start) { i++; } while(G-Vertex[j] != end) { j++; } G-Edges[i][j] = weight; if(G-Glaphtype == 0) G-Edges[j][i] = weight; } } //输o?出?邻￠¨2接¨?矩?阵¨? void Outmatrix(Maxtrixgraph *G) { int i,j; coutThe vertex is follow:endl; for(j=0;jG-Vertex_num;j++) cout G-Vertex[j]; coutendlThe edges matrix is follow:endl; for(i=0;iG-Vertex_num;i++) { coutG-Vertex[i]; for(j=0;jG-Vertex_num;j++) { if(G-Edges[i][j] == MAXVALUE) cout #; else cout G-Edges[i][j]; } coutendl; } } //下?面?介¨|绍|¨1图a?的ì?邻￠¨2接¨?表à¨a创???建?§方¤?法¤?§ typedef struct edgenode { int Vertex; //vertex number int weight; //quan struct edgenode *next; //the next edgenode }EdgeNode; //图a?的ì?邻￠¨2接¨?链￠??表à¨a定?§义°? typedef struct { EdgeNode* Adjlist[MAXNUM]; int vertex_num; int edge_num; int Graphtype; }ListGraph; //生|¨2成¨|图a?的ì?邻￠¨2接¨?表à¨a void Creatgraph(ListGraph *G) { int i,weight,start,end; EdgeNode *s; for(i=0;iG-vertex_num;i++) //clear the node po