dijkstra 优先队列最短路模板

;
;
*maxn];
,):id(a),dist(b){}
        ));
        ;i<=n;i++)dist[i]=inf;
        dist[st]=;
        ;i=edge[i].next)
                {
                        v=edge[i].to;
                        if(dist[v]>dist[u]+edge[i].val)
                        {
                                dist[v]=dist[u]+edge[i].val;
                                q.push(Node(v,dist[v]));
                        }
                }
        }
}

my code