0-1 BFS
(Mylib/Graph/ShortestPath/bfs_0_1.cpp)
Operations
Requirements
Notes
Problems
References
Depends on
Code
#pragma once
#include <deque>
#include <optional>
#include <vector>
#include "Mylib/Graph/Template/graph.cpp"
namespace haar_lib {
std::vector<std::optional<int64_t>> bfs_0_1(const graph<int> &g, const std::vector<int> &src) {
const int n = g.size();
std::vector<std::optional<int64_t>> ret(n);
std::vector<bool> visited(n);
for (auto i : src) ret[i] = 0;
std::deque<int> dq(src.begin(), src.end());
while (not dq.empty()) {
int cur = dq.front();
dq.pop_front();
if (visited[cur]) continue;
visited[cur] = true;
for (auto &e : g[cur]) {
if (not ret[e.to] or *ret[e.to] > *ret[e.from] + e.cost) {
ret[e.to] = *ret[e.from] + e.cost;
if (e.cost == 0)
dq.push_front(e.to);
else
dq.push_back(e.to);
}
}
}
return ret;
}
} // namespace haar_lib
#line 2 "Mylib/Graph/ShortestPath/bfs_0_1.cpp"
#include <deque>
#include <optional>
#include <vector>
#line 2 "Mylib/Graph/Template/graph.cpp"
#include <iostream>
#line 4 "Mylib/Graph/Template/graph.cpp"
namespace haar_lib {
template <typename T>
struct edge {
int from, to;
T cost;
int index = -1;
edge() {}
edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
edge(int from, int to, T cost, int index) : from(from), to(to), cost(cost), index(index) {}
};
template <typename T>
struct graph {
using weight_type = T;
using edge_type = edge<T>;
std::vector<std::vector<edge<T>>> data;
auto& operator[](size_t i) { return data[i]; }
const auto& operator[](size_t i) const { return data[i]; }
auto begin() const { return data.begin(); }
auto end() const { return data.end(); }
graph() {}
graph(int N) : data(N) {}
bool empty() const { return data.empty(); }
int size() const { return data.size(); }
void add_edge(int i, int j, T w, int index = -1) {
data[i].emplace_back(i, j, w, index);
}
void add_undirected(int i, int j, T w, int index = -1) {
add_edge(i, j, w, index);
add_edge(j, i, w, index);
}
template <size_t I, bool DIRECTED = true, bool WEIGHTED = true>
void read(int M) {
for (int i = 0; i < M; ++i) {
int u, v;
std::cin >> u >> v;
u -= I;
v -= I;
T w = 1;
if (WEIGHTED) std::cin >> w;
if (DIRECTED)
add_edge(u, v, w, i);
else
add_undirected(u, v, w, i);
}
}
};
template <typename T>
using tree = graph<T>;
} // namespace haar_lib
#line 6 "Mylib/Graph/ShortestPath/bfs_0_1.cpp"
namespace haar_lib {
std::vector<std::optional<int64_t>> bfs_0_1(const graph<int> &g, const std::vector<int> &src) {
const int n = g.size();
std::vector<std::optional<int64_t>> ret(n);
std::vector<bool> visited(n);
for (auto i : src) ret[i] = 0;
std::deque<int> dq(src.begin(), src.end());
while (not dq.empty()) {
int cur = dq.front();
dq.pop_front();
if (visited[cur]) continue;
visited[cur] = true;
for (auto &e : g[cur]) {
if (not ret[e.to] or *ret[e.to] > *ret[e.from] + e.cost) {
ret[e.to] = *ret[e.from] + e.cost;
if (e.cost == 0)
dq.push_front(e.to);
else
dq.push_back(e.to);
}
}
}
return ret;
}
} // namespace haar_lib
Back to top page