m0_53389337的博客

void Dijkstra(){ int map[19][19]={0}; cout<<endl; int path[19],dis[19],book[19]; map[1][3]=3; map[2][3]=5;map[2][5]=6; map[3][1]=3;map[3][2]=5;map[3][4]=2;map[3][6]=8;map[3][12]=10; map[4][3].

#include<iostream>using namespace std;#include<queue>#include<stack>typedef int vertype ;#define max 100int book[max];struct ArcNode{ int adjvex;//记录一条边的右顶点的下标 int weight; ArcNode *next;//下一条边};struct VNode{ vertype data;.

#include<iostream>using namespace std;#include<queue>typedef int vertype ;#define max 100int book[max];struct ArcNode{ int adjvex;//记录一条边的右顶点的下标 int weight; ArcNode *next;//下一条边};struct VNode{ vertype data;//顶点的类型 ArcNode *fir.