dijkstra

//usage language C++ 领接表
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
int dist[MAX_VERTEX_NUM];
int vis[MAX_VERTEX_NUM];

void MyDijkstra(AdjList G, int v0){
    vector<vector<int>> path(MAX_VERTEX_NUM);
    memset(vis, 0, sizeof(vis));
    memset(dist, 0x3f, sizeof(dist));
    ArcNode *p;
    p = G.vertex[v0].firstarc;
    while(p != NULL){
        dist[p->adjvex] = p->weight;
        /*
            path[p->adjvex].push_back(v0);
            path[p->adjvex].push_back(p->adjvex);
        */
        p = p->nextarc;
    }
    vis[v0] = 1;
    int k;
    for(int t = 1; t < G.vexnum; t++){
        int min = INF;
        for(int i = 0; i < G.vexnum; i++){
            if(!vis[i] && dist[i] < min){
                k = i;
                min = dist[i];
            }
        }
        //记录k是已经最短的了
        vis[k] = 1;
        //以k为基点更新最短路
        p = G.vertex[k]->firstarc;
        while(p != NULL){
            if(!vis[p->adjvex] && p->weight + dist[k] < dist[p->adjvex]){
                dist[p->adjvex] = dist[k] + p->weight;
                /*
                    path[p->adjvex].assign(path[k].begin(), path.end());
                    path[p->adjvex].push_back(G.vertex[i]);
                */
            }

            p = p->nextarc;
        }
    }

}