This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ruthen71/rcpl
#include "graph/zero_one_bfs.hpp"
#pragma once #include "graph/graph_template.hpp" template <class T> std::tuple<std::vector<T>, std::vector<int>, std::vector<int>> // zero_one_bfs(Graph<T> &G, std::vector<int> &s, const T INF) { int N = (int)G.size(); std::vector<T> dist(N, INF); std::vector<int> par(N, -1), root(N, -1); std::deque<int> que; for (auto &v : s) { dist[v] = 0; root[v] = v; que.push_back(v); } while (!que.empty()) { auto v = que.front(); que.pop_front(); for (auto &e : G[v]) { if (dist[e.to] > dist[v] + e.cost) { dist[e.to] = dist[v] + e.cost; root[e.to] = root[v]; par[e.to] = v; if (e.cost != 0) { que.push_back(e.to); } else { que.push_front(e.to); } } } } return {dist, par, root}; }
#line 2 "graph/zero_one_bfs.hpp" #line 2 "graph/graph_template.hpp" #include <vector> template <class T> struct Edge { int from, to; T cost; int id; Edge() = default; Edge(int from, int to, T cost = 1, int id = -1) : from(from), to(to), cost(cost), id(id) {} friend std::ostream &operator<<(std::ostream &os, const Edge<T> &e) { // output format: "{ id : from -> to, cost }" return os << "{ " << e.id << " : " << e.from << " -> " << e.to << ", " << e.cost << " }"; } }; template <class T> using Edges = std::vector<Edge<T>>; template <class T> using Graph = std::vector<std::vector<Edge<T>>>; #line 4 "graph/zero_one_bfs.hpp" template <class T> std::tuple<std::vector<T>, std::vector<int>, std::vector<int>> // zero_one_bfs(Graph<T> &G, std::vector<int> &s, const T INF) { int N = (int)G.size(); std::vector<T> dist(N, INF); std::vector<int> par(N, -1), root(N, -1); std::deque<int> que; for (auto &v : s) { dist[v] = 0; root[v] = v; que.push_back(v); } while (!que.empty()) { auto v = que.front(); que.pop_front(); for (auto &e : G[v]) { if (dist[e.to] > dist[v] + e.cost) { dist[e.to] = dist[v] + e.cost; root[e.to] = root[v]; par[e.to] = v; if (e.cost != 0) { que.push_back(e.to); } else { que.push_front(e.to); } } } } return {dist, par, root}; }