daylight/graph/base.hpp

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

Depends on

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

Required by

• daylight/graph/all.hpp
• ベルマンフォード法で単一始点最短経路長問題を解く (daylight/graph/bellman_ford.hpp)
• グラフビルダー (daylight/graph/builder.hpp)
• daylight/graph/cycle_detection.hpp
• 木の直径を求める (daylight/graph/diameter.hpp)
• ダイクストラ法 (daylight/graph/dijkstra.hpp)
• オイラーツアーを求めます (daylight/graph/euler_tour.hpp)
• 最小全域木のコストを求める (daylight/graph/kruskal.hpp)
• Lowest Common Ancestor (daylight/graph/lca.hpp)
• daylight/graph/manhattan_mst.hpp
• コンストラクタ (daylight/rerooting.hpp)

Verified with

• test/aoj/grl/1_A.test.cpp
• test/aoj/grl/1_C.test.cpp
• test/aoj/grl/2_A.test.cpp
• test/yosupo/tree/jump_on_tree.test.cpp
• test/yosupo/tree/lca.test.cpp
• test/yosupo/tree/tree_diameter.test.cpp

Code

#pragma once
#include "daylight/base.hpp"
template<class T = ll>
struct Edge {
public:
	int from, to;
	T cost;
	Edge() {
	}
	Edge(int _from, int _to, T _cost) {
		from = _from;
		to = _to;
		cost = _cost;
	}
};
template<class T = ll>
using Edges = vector<Edge<T>>;
template<class T = ll>
using Graph = vector<Edges<T>>;

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