补充：迪杰斯特拉算法的最短路径跟踪

//迪杰斯特拉最短路径算法
//有向图  //6 9 1 2 7 1 3 9 1 6 14 2 3 10 2 4 15 3 6 2 3 4 11 6 5 9 4 5 6 
//6 9 1 3 3 1 2 6 2 3 2 2 4 5 3 4 3 3 5 4 4 5 2 4 6 3 5 6 5
#include<iostream>
#include<queue>
#include<stack>
using namespace std;
#define MAX 20
#define MAXint 99999
int map[MAX][MAX];
int arr[MAX] = { 0 }; //标记是否已经经被最小访问
//int path[MAX];
struct kk
{
    kk() :key(0), val(0){}
    int key;
    int val;
    friend bool operator<(kk a, kk b)
    {
        return a.val>b.val;
    }
};
struct Path{
    int a[MAX];
    int index=0;
};
Path path[MAX];
priority_queue<kk> p; 
void dijisiter( int n,kk vexkk[])
{   
    while (!p.empty())
    {
        int index = 0;
        kk temless = p.top();
        for (int i = 0; i < n; i++)
        {
            if (map[temless.key][i] != MAXint)                 //如果路径可达，则将当前起点距离+路径距离存入路径表lenval（只存最小的）
            {
                if ((vexkk[temless.key].val + map[temless.key][i]) < vexkk[i].val)
                  {
                    path[i].index = 0;
                    while (path[i].index<=path[temless.key].index)
                    {                   
                        path[i].a[path[i].index] = path[temless.key].a[path[i].index];
                        path[i].index++;
                    }
                    path[i].a[path[i].index] = i;
                    vexkk[i].val = vexkk[temless.key].val + map[temless.key][i];
                  }
                  if (arr[i] == 0)              //如果当前顶点未被访问
                  {
                        p.push(vexkk[i]);   //进入优先级队列
                        arr[i] = 1;
                   }
        }
        }
        p.pop();
    }

}
int main()
{
    int vex, edge, x, y, val;
    cin >> vex >> edge;
    for (int i = 0; i < MAX; i++)
    {
        for (int j = 0; j < MAX; j++)
            map[i][j] = MAXint;
    }
    kk vexkk[MAX];
    for (int i = 0; i < MAX; i++)
    {
        vexkk[i].val = MAXint;
    }
    for (int i = 0; i < vex; i++)
    {
        vexkk[i].key = i;
    }
    for (int i = 0; i < edge; i++)             
    {
        cin >> x >> y>>val;
        map[x - 1][y - 1] = map[y - 1][x - 1]= val;               
    }
    vexkk[0].val = 0;
    arr[0] = 1;
    p.push(vexkk[0]);

    dijisiter( vex, vexkk);
    for (int i = 0; i < vex; i++)
    {
        cout << vexkk[i] .val<< ends;
    }
    cout << endl;
    int k;
    while (cin >> k)
    {
        --k;
        for (int i = 0; i < path[k].index; i++)
        {
            cout << path[k].a[i]+1 << "-->";
        }
        cout << k + 1 << endl;
    }
}