1 const intV = 10000, INF = 1<<28; 2 using P = pair<int, int>; 3 vector<P> G[V]; // pair<辺ã®è·é¢, è¡ãå ã®é ç¹> 4 T dist[V]; // dist[i]ã¯sããé ç¹iã¸ã®æçè·é¢ãå ¥ã 5 bool used[V]; 6 void dijkstra(int s) { // s:å§ç¹ 7 fill_n(dist, V, INF); 8 fill_n(used, V, false); 9 priority_queue<P, vector<P>, greater<P>> q; 10 q.push(P(0, s)); 11 while (!q.empty()) { 12 T d; int t;//d:sããã®è·é¢ t:è¡ãå 13 tie(d, t) = q.top(); q.pop(); 14 i


{{#tags}}- {{label}}
{{/tags}}