ダイクストラ法 (daylight/graph/dijkstra.hpp)

View this file on GitHub
Last update: 2024-12-26 20:32:55+09:00
Include: #include "daylight/graph/dijkstra.hpp"

Depends on

Required by

daylight/graph/all.hpp

Verified with

test/aoj/grl/1_A.test.cpp

Code

#include "daylight/base.hpp"
#include "daylight/graph/base.hpp"
/// @brief ダイクストラ法
/// @param s 始点
/// @param G グラフ
/// @return ret[i]:sからiへの最短経路長
vll dijkstra(int s, const Graph<ll>& G) {
	using P = pair<ll, int>;
	priority_queue<P, vector<P>, greater<>> que;
	vll D(SZ(G), LINF);
	D[s] = 0;
	que.push(P(0, s));
	while(!que.empty()) {
		P p = que.top();
		que.pop();
		int v = p.second;
		if(D[v] < p.first) continue;
		for(Edge e: G[v]) {
			if(D[e.to] > D[v] + e.cost) {
				D[e.to] = D[v] + e.cost;
				que.push(P(D[e.to], e.to));
			}
		}
	}
	return D;
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 482, in update
    self.update(
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 477, in update
    raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: daylight/base.hpp: line 103: unable to process #include in #if / #ifdef / #ifndef other than include guards