return m;int main() {
int n, m, w;
cout << "请输入顶点的数量n和边的数量m（空格分隔，下同）：\n";
cin >> n >> m;
AMGraph G;
cout << "请依次输入m条边所依附的两端顶点以及边权重：\n";
createUDN(G, n, m);
printUDN(G);
int v;
cout << "请输入开始顶点编号：\n";
cin >> v;
cout << ShortestPathMAX(G, v) << endl;
system("pause");
return 0;
}