This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub
#include "C++/graph/mst/MST.hpp"
#pragma once #include <vector> #include "C++/graph/edge.hpp" struct MST { std::vector<edge> tree; long long cost; }; /** * @brief 最小全域木 */
#line 2 "C++/graph/mst/MST.hpp" #include <vector> #line 2 "C++/graph/edge.hpp" struct edge { int src, to, id; long long cost; edge(){} edge(const int src_, const int to_, const int id_ = -1, const long long cost_ = 0): src(src_), to(to_), id(id_), cost(cost_){} operator int() const { return to; } }; /** * @brief Edge */ #line 5 "C++/graph/mst/MST.hpp" struct MST { std::vector<edge> tree; long long cost; }; /** * @brief 最小全域木 */