ベルマンフォード法で単一始点最短経路長問題を解く (daylight/graph/bellman_ford.hpp)

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

Depends on

• 基本テンプレート (daylight/base.hpp)
• daylight/graph/base.hpp

Required by

• daylight/graph/all.hpp

Code

#include "daylight/base.hpp"
#include "daylight/graph/base.hpp"
/// @brief ベルマンフォード法で単一始点最短経路長問題を解く
/// @param V 頂点数
/// @param EG 辺のリスト
/// @param s 始点
/// @param D out:最短経路長が入る配列
/// @return 負閉路を含むかどうか
bool shortest_path(int V, const Edges<ll>& EG, int s,
				   vll& D) {
	D = vll(V, LINF);
	D[s] = 0;
	int cnt = 0;
	while(true) {
		bool update = false;  //このループで更新が起こったか
		for(auto e: EG) {
			if(D[e.from] == LINF) continue;
			if(chmin(D[e.to], D[e.from] + e.cost)) {
				//このEdgeを通ると暫定より低コストでe.toに行ける場合
				D[e.to] = D[e.from] + e.cost;  //値を更新
				update = true;
			}
		}
		if(!update) return false;  //最短距離の更新が終了
		cnt++;
		if(cnt == V) return true;
	}
}

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

Back to top page